<?xml version="1.0" encoding="utf-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.0 20120330//EN" "JATS-journalpublishing1.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">INFORMATICA</journal-id>
<journal-title-group><journal-title>Informatica</journal-title></journal-title-group>
<issn pub-type="epub">0868-4952</issn><issn pub-type="ppub">0868-4952</issn>
<publisher>
<publisher-name>VU</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">INFO1114</article-id><article-id pub-id-type="doi">10.15388/Informatica.2016.98</article-id>
<article-categories><subj-group subj-group-type="heading">
<subject>Research Article</subject></subj-group></article-categories>
<title-group>
<article-title>New Coding Algorithm Based on Variable-Length Codewords for Piecewise Uniform Quantizers</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="Author">
<name><surname>Dinčić</surname><given-names>Milan R.</given-names></name><email xlink:href="mailto:mdincha@hotmail.com">mdincha@hotmail.com</email><xref ref-type="aff" rid="j_INFORMATICA_aff_000"/><xref ref-type="corresp" rid="cor1">*</xref>
</contrib>
<contrib contrib-type="Author">
<name><surname>Perić</surname><given-names>Zoran H.</given-names></name><email xlink:href="mailto:zoran.peric@elfak.ni.ac.rs">zoran.peric@elfak.ni.ac.rs</email><xref ref-type="aff" rid="j_INFORMATICA_aff_000"/>
</contrib>
<contrib contrib-type="Author">
<name><surname>Jovanović</surname><given-names>Aleksandra Ž.</given-names></name><email xlink:href="mailto:aleksandra.jovanovic@elfak.ni.ac.rs">aleksandra.jovanovic@elfak.ni.ac.rs</email><xref ref-type="aff" rid="j_INFORMATICA_aff_000"/>
</contrib>
<aff id="j_INFORMATICA_aff_000">Faculty of Electronic Engineering, Niš, Aleksandra Medvedeva 14, 18000 Niš, Serbia</aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>*</label>Corresponding author.</corresp>
</author-notes>
<pub-date pub-type="epub"><day>01</day><month>01</month><year>2016</year></pub-date><volume>27</volume><issue>3</issue><fpage>527</fpage><lpage>548</lpage><history><date date-type="received"><day>01</day><month>01</month> <year>2014</year></date><date date-type="accepted"><day>01</day><month>08</month> <year>2015</year></date></history>
<permissions><copyright-statement>Vilnius University</copyright-statement><copyright-year>2016</copyright-year></permissions>
<abstract>
<p>This paper presents a model for signal compression, which consists of a piecewise uniform quantizer and a new lossless coder. The model is designed in a general manner, i.e. for any symmetrical signal distribution; this general theory is applied to design models for Gaussian and Laplacian distributions. Rigorous mathematical derivation of the expression for the bit-rate is presented. Forward adaptation of the model is done for non-stationary signals. Theory is proved by simulations in MATLAB and by an experiment with a real speech signal. The most important advantages of the model are low complexity and good performances – it satisfies G.712 standard for the speech transmission quality with 6.18 bps (bits per sample), which is significantly smaller than 8 bps required for quantizers used in PSTN (public switched telephone network) defined with G.711 standard.</p>
</abstract>
<kwd-group>
<label>Keywords</label>
<kwd>piecewise uniform quantizer</kwd>
<kwd>lossless code</kwd>
<kwd>forward adaptation</kwd>
<kwd>Gaussian and Laplacian distributions</kwd>
</kwd-group>
</article-meta>
</front>
</article>
