You are on page 1of 6

www.ietdl.

org
Published in IET Communications
Received on 8th December 2011
Revised on 28th August 2013
Accepted on 9th October 2013
doi: 10.1049/iet-com.2012.0791

ISSN 1751-8628

Design of forward adaptive hybrid quantiser with


GolombRice code for compression of
Gaussian source
Jelena R. Nikolic,
Zoran H. Peric, Aleksandar V. Mosic
Department of Telecommunications, Faculty of Electronic Engineering, University of Nis, Aleksandra Medvedeva 14,
Nis 18000, Serbia
E-mail: mosicaca@yahoo.com

Abstract: This study proposes a novel model of hybrid quantiser composed of a uniform scalar quantiser and a non-uniform
optimal companding scalar quantiser, both designed for a Gaussian source. We examine whether by appropriately designing a
novel forward adaptive hybrid quantiser with GolombRice code, one can achieve more sophisticated compression and a
higher signal to quantisation noise ratio compared with the uniform quantiser with GolombRice code. We observe which
value of the bit rate should be chosen to provide high-quality quantisation. It is shown that the authors compression model
can satisfy G.712 recommendation for high-quality quantisation achieving the compression of 1.68 bit/sample over the G.711
quantiser. In addition, for the average bit rate of 6.32 bit/sample their hybrid quantiser outperforms the uniform quantiser for
1.32 dB. The presented performances of the forward adaptive hybrid quantiser indicate that it should be of theoretical and
practical signicance in quantisation of the Gaussian source signals.

1 Introduction recommendation [1, 12, 13]. In fact, the two modied


logarithmic compressor characteristics obtained by
Signal compression is usually categorised into quantisation, piecewise linear approximation to the A-law and the -law
as a lossy compression technique, and its lossless characteristics have become widely used as a design
counterpart called entropy coding [14]. Both compression guideline for non-uniform quantisation of speech signals in
techniques have found wide application in various data digital telephony. The idea with the European A-law
representation needs. Lossless coders compress data without companding is similar to the North American -law because
loss of information, but, in many cases, achievable for signals with small amplitudes the mapping is almost
compression, bounded by the entropy of the source data, is linear and for large amplitudes the transformation is
insufcient for the purpose of low rate coding. By contrast, logarithmic. The main disadvantage of these quantisers is
quantisation can provide exible compression for a wide that a bit rate decrease brings the signicant reduction in
range of bit rates at the cost of accordingly introduced quality of a quantised signal (6 dB per 1 bit) [1].
quantisation error or information loss. Therefore it is Nowadays, in the new bandwidth limited communication
important to research suitable lossy compression technique systems, this can be unfavourable. Thus, more sophisticated
that provides the desired level of signal quality for the speech compression has become an essential component in
given bit rate. Lossless compression allows decreasing of telecommunications. This has prompted our extensive
bit rate without losing information and can be achieved by research in the area of speech compression during the past
using some of the entropy codes [1, 2, 4, 5]. There are years [1418].
many different types of entropy codes, the examples of Until recently, it was thought that a uniform quantiser is the
which are Huffman, GolombRice and arithmetic code [3, most appropriate for use with lossless code [4, 11, 19, 20],
611]. In many modern applications, a combination of a because it has been shown that uniform quantisation yields
quantiser and a lossless coder is used. Most often, because an entropy which is smaller than that of any other
of simplicity, the quantiser and lossless coder are designed quantisers. It is well known that entropy provides a
separately. The obtained performances are not optimal, theoretical bound of the minimum number of bits for the
although. However, the desired performances can be information and that the difference between the average bit
obtained only with joined design of the quantiser and rate and the entropy represents the amount of the
lossless coder, which is done in this paper. redundancy in the code [4]. In practical compression
To achieve high-quality quantised speech signals, systems where some of the entropy codes are used,
the contemporary public switched telephone networks redundancy always exists because of the imperfection of
utilise logarithmic quantisation specied by G.711 entropy codes. This is why the further research has been

372 IET Commun., 2014, Vol. 8, Iss. 3, pp. 372377


& The Institution of Engineering and Technology 2014 doi: 10.1049/iet-com.2012.0791
www.ietdl.org
conducted in this eld with the goal to examine whether tN}. By relating decision thresholds = t0 < t1 < < tN
uniform quantisation is actually optimal for some of the = +, one can dene quantisation rule as many-to-one
entropy codes. Specically, for the given average bit rate, mapping, Q(x) = yi if ti1 < x ti for i = 1, 2, , N [13]. In
signal-to-quantisation noise ratio (SQNR) of the uniform other words, a quantised signal has the value yi when the
quantiser with GolombRice code is compared with the one original signal belongs to the quantisation cell Ri = (ti1, ti],
of the hybrid quantiser with the same code [15], where both i = 1, 2, , N. Non-uniform quantisation can be achieved in
quantisers are designed for Laplacian source. Interestingly, the following way: rst, by compressing the input signal x
it has been revealed that hybrid quantiser with Golomb using a non-uniform compressor characteristic c(x) (also
Rice code provides a better performance than the uniform called companding law); next by quantising the compressed
quantiser with GolombRice code. Moreover, it has been signal c(x) by employing a uniform quantiser Qu(c(x)); and
shown that the hybrid quantiser, composed of a uniform nally by expanding the quantised version of the
and an optimal companding quantiser, allows a great compressed signal using a non-uniform transfer
exibility regarding the quality of the quantised signal, the characteristic c1(Qu(c(x))), which is inverse to the
complexity and the bit rates, which are not achievable by characteristic of the compressor. The overall structure,
classical uniform or non-uniform quantisers. This is due to which consists of a compressor, a uniform quantiser and an
the fact that, for the xed number of quantisation levels, the expandor in cascade, is called compandor [13], or
hybrid quantiser provides many combinations for the companding quantiser.
number of levels in the uniform and non-uniform regions In situations such as speech coding, the variance of an
that result in a more sophisticated compression model. Let input signal changes with time and is not known in advance
us mention that the idea of a hybrid quantiser has been [1]. In cases like that, by using an optimal companding
reported in [16], where the hybrid quantiser is composed of quantiser one can obtain maximal SQNR at the variance
two non-uniform quantisers, the optimal companding and and PDF for which the optimal companding quantiser is
LloydMaxs quantiser. That combination of two designed [1]. To decrease the dynamic of SQNR
non-uniform quantisers is suitable for code words with (SQNRmax SQNRmin) in the wide variance range of an
xed length. Similarly as in [15], in this paper, we show input signal to be quantised, the application of some of the
that for variable-length code words, the hybrid quantiser we adaptive techniques is preferable [1]. Adaptive quantisation
propose is more appropriate than the uniform quantiser. techniques conceptually differ regarding the manner in
Unlike [15], where the hybrid quantiser has been designed which the adaptation is performed whether it is performed
for the assumed Laplacian probability density function forward, that is from the input sequence or backward, that
(PDF) of an input signal with unit variance, here we is from the coded output signal [1]. In addition, let us
assume Gaussian PDF and we observe the cases where the mention that the forward adaptive technique requires the
designed-for and applied-to sources are Gaussian that may transmission of the side information, whereas it is not
have different variances. Observe that Gaussian PDF is a required by the backward adaptive technique since the
more realistic PDF for the short-term statistics of speech adaptation is performed according to what has previously
signals [1]. Moreover, observe that, as in [15], we consider been transmitted. However, because of the reduced
GolombRice code rather than Huffman code, although sensitivity of the forward adaptive technique to transmission
Huffman code provides the closest approaching of the errors when compared with the backward adaptive
average bit rate to the source entropy. This is due to the fact technique, as well as since it is demonstrated that the
that for the large number of quantisation levels we are in backward adaptive technique provides SQNR within 1 dB
this paper interested in, Huffman code becomes impractical of the forward adaptive technique [1], we have decided to
because of high implementation complexity that increases utilise forward adaptation.
with the number of quantisation levels [21]. GolombRice Output levels of a quantiser can be considered as a discrete
code is used in many standards because it is much simpler source of symbols y1, y2, , yN and can be coded using
for implementation than Huffman code [811, 21]. xed-length code words. However, a more effective manner
This paper is organised as follows. Section 2 recalls some of coding is by using an entropy code with variable-length
basic theory of scalar quantisation and GolombRice code. code words [13]. The bit rate of any lossless code is
Section 3 provides a detailed description of the novel model always higher than the entropy, where the aim is to
of hybrid quantiser with GolombRice code designed for approach the entropy the closest possible with the
the Gaussian source. The obtained numerical results are reasonable complexity of the compression model. To
discussed in Section 4 and, based on it the conclusions achieve this, symbols with large probabilities are coded
about the possibilities of the proposed compression model with shorter code words and less-probable symbols are
application are derived. Section 4 also provides an analysis coded with longer code words. There are many types of
of forward adaptive hybrid scalar quantisation of Gaussian entropy codes, such as Huffman code, arithmetic code and
source for the case of coding output levels by GolombRice GolombRice code. GolombRice code is much simpler
code. Section 5 summarises the key features of the and faster than Huffman code because it requires only a few
proposed quantiser and provides brief conclusions. logical operations [911]. This is the reason why Golomb
Rice code is a part of many modern compression standards
[8], as well as the reason why we consider GolombRice code.
2 Scalar quantisation and GolombRice code Let us begin the explanation of GolombRice code with the
description of unary code. A unary code is a very simple
In this section, we recall some basic theory of scalar entropy code for coding non-negative integers. In a unary
quantisation and GolombRice code. We begin by dening code, an arbitrary non-negative integer n is coded with n
the terms and reviewing relevant scalar quantiser ones followed by one zero, so that the code word for n is:
characteristics. The N-point scalar quantiser Q is 11...1 0 [2]. The GolombRice code is a parameterised

characterised by a set of N real-valued quantisation points n
{y1, y2, , yN} and N + 1 decision thresholds {t0, t1, , prex entropy code for coding non-negative integers n. A

IET Commun., 2014, Vol. 8, Iss. 3, pp. 372377 373


doi: 10.1049/iet-com.2012.0791 & The Institution of Engineering and Technology 2014
www.ietdl.org
parameterised code depends on the parameter m, m = 2k, k In our case, the granular distortion consists of distortions
Z. By choosing the appropriate value of the parameter m one from the uniform Dg1(Q) and non-uniform Dg2(Q) part.
can adjust GolombRice code to every value of integer n. The Accordingly, the total distortion D(Q) of our hybrid
rst step in constructing GolombRice code for a quantiser consists of three components, the two granular
non-negative integer n is based on the computation of the distortions Dg1(Q) and Dg2(Q), and the one overload Dol(Q)
following quantities distortion
 
q = n/m , r = n mq, r [ (0, m 1) (1) D(Q) = Dg1 (Q) + Dg2 (Q) + Dol (Q) (3)

where q and r stand for a quotient and a remainder, given by the following expressions
respectively. n
Every integer n is uniquely determined by q and r. The 2D2u xmin
code word for n is constructed in such a way that the unary Dg1 (Q) = p(x) dx (4)
12 0
code with (1 + n/m bits is used to code q followed by the
 n
k-bits natural code for r. Therefore the code word for n has 2 xnmax xnmin xmax p(x)
(1 + k + n/m) bits. In other words, with the GolombRice Dg2 (Q) =
dx
3 N2 2 xnmin [c ( x)]
2
code the set of non-negative integers is divided into groups
of m integers and an ordinal number is assigned to every  n 3 (5)
xmax
group (numbers from 0 to m 1 belong to group 0, from m =
2 1/3
p (x) dx
to 2m 1 belong to group 1 etc.). For an arbitrary integer 3 N2 2 xnmin
n, the quotient q is equal to the ordinal number of the
+1
group and reminder r determines the position of n inside 2
the group. In what follows we consider the application of Dol (Q) = 2 x yN p(x) dx (6)
xnmax
GolombRice code to output levels of the novel hybrid
quantiser.
where
n in (5) we apply Bennetts

integral [1] on
xmax , xnmin ) < (xnmin , xnmax and it holds that
3 Novel hybrid quantiser with GolombRice Du = 2xnmin /N1 . As already mentioned, we assume Gaussian
code PDF
Let us now consider the novel hybrid quantiser. In our N-level
1 x2 /2s2
hybrid quantiser, the N1-level uniform quantiser covers the p(x) =  e (7)
interval around the point 0, called the uniform region, 2ps
whereas the N2-level non-uniform optimal companding
where x is zero-mean statistically independent Gaussian
quantiser covers the outer region, called the non-uniform
random variable of variance 2. Substituting (7) into (4)(6)
region. The support region of the quantiser we propose
and approximating yN with xnmax , after some straightforward
consists of the uniform and the
non-uniform
part, dened
mathematical manipulations yields
on the regions xnmin , xnmin and xnmax , xnmin ) <
(xnmin , xnmax ], respectively. xnmin is the threshold between 2  n 
these two parts and xnmax is the considered quantisers xnmin x
Dg1 (Q) = erf min
 (8)
support region threshold. As the optimal companding 3N1 2
2s
quantiser
n has the support
region dened on  2   n   n 3
xmax , xnmin ) < (xnmin , xnmax , by using the basic 3ps xmax x
denition of an optimal compressor function from [1] we Dg2 (Q) = erf  erf min
 (9)
2 N2 2
6s 6s
can dene the following optimal compressor function
x 1/3
(see (10))

n xnmin p (x) dx

n
xnmin , x xnmax

xmax x min xnmax , where we use well known function
1/3
p (x)dx
xnmin
c(x) = z

x n
2 2

x min p1/3 (x)dx erf (z) =  et dt (11)
xnmax xnmin x
, xnmax x , xnmin p
n
min 1/3
0
xnmax p (x)dx
(2) The quality of the quantised signal along with distortion is
often specied by SQNR [13]
For a source that is characterised as a continuous random  2 
variable, with PDF p(x), the N-level scalar quantiser s
SQNR = 10 log (12)
distortion is usually dened as the expected mean square D(Q)
error between an original and quantised signals. It is well
known that a distortion because of quantisation consists of In this paper, the analysis of numerical results is conducted
a granular Dg(Q) and an overload Dol(Q) distortion [13]. using SQNR rather than distortion.

  n 2    n   n 
xmax xmax 2 xmax (xnmin )2 /2s2
Dol (Q) = s 2
1+ 1 erf  e (10)
s 2s p s

374 IET Commun., 2014, Vol. 8, Iss. 3, pp. 372377


& The Institution of Engineering and Technology 2014 doi: 10.1049/iet-com.2012.0791
www.ietdl.org
where, as we have already mentioned, we assume that
log2N2 = k so that within each segment there are m levels.
In our compression model, we assume that the decoder
knows where the rst code word begins and that it also
knows the values of parameters S and m = 2k. The decoder
counts ones in the rst code word before the rst 0, and
this number of ones is denoted by g. If g < S 1, then this
Fig. 1 Division of the support region into two regions with division code word represents the level in the gth segment within
of the regions into segments the uniform region. Following k bits behind the rst 0
represents the xed-length natural code that species the
corresponding level inside the gth segment. If g S 1,
In this section, we also consider the application of then the level belongs to the non-uniform region and log2
GolombRice code on the novel hybrid quantiser dened N2 = k bits behind the rst 0 represent the xed-length
above. As aforementioned, the considered hybrid quantiser natural code of the level inside the non-uniform region.
is composed of the uniform and the optimal companding After decoding the value of the level, the obtained decoded
quantiser.
n The

uniform quantiser is applied on the interval value passes through the expandor having inverse function
xmin , xnmin , called the uniform region, whereas the c1(x). After decoding the rst code word, the decoder
optimal
companding
quantiser
is applied on the interval continues to decode the next code words in the same manner.
1, xnmin < xnmin , +1 , called the non-uniform
region. Recall that the number of levels in the uniform
region is denoted by N1 and in the non-uniform region by 4 Numerical results
N2. We divide N levels into S segments of m levels, where
the segments are denoted by 0, 1, , S 1. Let us assume, A very important characteristic of the hybrid quantiser is its
as in [15], that S 1 segments are in the uniform region exibility. Particularly, we can adjust the number of levels
and only one segment is in the non-uniform region. The in the uniform and non-uniform regions, N1 and N2,
division of the support region into two regions and the respectively, that is, there are a lot of combinations (N1,
division of these regions into segments is depicted in N2), which provide the required SQNR. This is different
Fig. 1. The code words for levels in the jth segment (0 from the uniform or non-uniform quantisers, where there is
j S 1) have the form 
11...1 0 
xx...x and their lengths are only one number of levels N, which gives some required
j k SQNR. For the considered hybrid quantiser with Golomb
Rice coding, the combinations (N1, N2) giving similar
lj = j + k + 1 bits, 0j S1 (13) SQNR result in the different bit rates and different
implementation complexities that depend on the total
xx...x , x {0, 1} is the natural xed-length code for m
where  number of levels N1 + N2. Observe that for the given total
k number of levels N1 + N2, the implementation complexity of
levels in the jth segment. Let us denote the decision the hybrid quantiser decreases with an increase of N1 and
thresholds between the segments in the positive part of the with a decrease of N2. This notication justies our
support region by dj, 0 < j S. For the segment decision assumption that S 1 segments are in the uniform region
thresholds dj, it is valid that dj = jmxnmin /N1 = j2k xnmin /N1 , and only one segment is in the non-uniform region. The
0 < j S 1 and dS = xnmax . Let us dene the following SQNR values obtained by assuming values of parameters
d d
probabilities by P0 = 2 01 p(x) dx, Pj = 2 djj+1 p(x) dx, for N1 = 112 and N2 = 16 for the proposed hybrid quantiser
+1 model are given in Table 1. We have considered the case
0 < j < S 1 and by PS1 = 2 d p(x) dx, for j = S 1. For N = N1 + N2 = 128 and we have determined the values of
S1
the assumed Gaussian PDF these probabilities become parameters xnmin , xnmax , average, maximal and minimal
 k    SQNR, as well as the average bit rate for GolombRice

2 j + 1 xnmin 2k jxnmin code. The parameter k takes value 4 because in this way

erf  erf  , 0j ,S1 one can obtain a model comparable with G.711 quantiser
2sN1 2sN1
Pj =  n  consisting of 16 levels per segment. Parameters xnmin and




x
1 erf min , j =S1 xnmax have been numerically optimised in order to provide
2s the required robustness and the highest possible SQNR.
(14) RGR has been obtained from the expression (15) and
SQNRavg is the result of averaging SQNR in the assumed
variance range of 40 dB. From the rst row of Table 1, it
Now, we can dene the average bit rate for GolombRice can be concluded that one hybrid quantiser does not meet
code, denoted by RGR the required robustness in the wide range of input variances
(observe the case when Ng = 1). We have solved this

S 1
RGR [bit/sample] = lj Pj problem by the application of forward adaptation.
j=0
The forward adaptive technique utilises the frame-by-frame
      manner with the length of frame M to process an input signal

S2 2k j + 1 xnmin 2k jxnmin [13]. For each frame, rst the gain g = /0 is estimated,
= j + k + 1 erf  erf  where 2 is the frame variance, and then the gain is
j=0 2sN1 2sN1
quantised and used to scale the code book of the quantiser
  n  designed for some reference variance s20 , which is usually
  x
+ S + log2 N2 1 erf min
 assumed to have unit value. In other words, forward
2s adaptation can be performed by normalising the samples of
(15) an input signal within the current frame using the quantised

IET Commun., 2014, Vol. 8, Iss. 3, pp. 372377 375


doi: 10.1049/iet-com.2012.0791 & The Institution of Engineering and Technology 2014
www.ietdl.org
FA
Table 1 Parameters of the forward adaptive hybrid quantiser and performances expressed through RGR , SQNRavg, SQNRmax and
SQNRmin, which reflect the importance of proper choice of these parameters
n n FA
Ng M N1 N2 xmin xmax k S RGR SQNRavg SQNRmax SQNRmin

1 1 112 16 2.66 18.90 4 8 7.33 27.33 37.02 17.26


2 10 112 16 2.76 10.90 4 8 6.95 32.10 37.02 26.93
4 20 112 16 2.61 6.25 4 8 6.85 35.10 37.03 32.41
8 30 112 16 2.90 5.40 4 8 6.58 36.08 37.18 34.00
16 40 112 16 3.32 4.90 4 8 6.32 35.30 36.45 34.08

gain so that only one quantiser designed for the variance s20 is case of Ng = 16 can satisfy G.712 recommendation for
applied to the normalised signal [13]. Once for each frame, high-quality quantisation [23] at the bit rate of 6.32 bit/
the index specifying the number of levels for gain sample achieving the compression of 1.68 bit/sample over
quantisation Ng is transmitted as the side information the G.711 quantiser [1]. This is a higher compression than
(log2Ng/M ) to the receiver. When longer frames of M the one ascertained in [18] that amounts to 1.25 bit/sample.
[160, 240] samples are considered, the side information Moreover, this is a higher compression than the one
does not signicantly affect the average bit rate. For the ascertained in [22], where high-quality quantisation and a
procession of the short frames, one should carefully choose higher SQNR compared with one of G.711 quantiser have
Ng that affects the increase of both, the side information been achieved for the bit rate of R = 7.117 bit/sample. In
and the average SQNR. In this paper, the short frames of addition, Fig. 2 shows that by increasing the value of Ng,
M [10, 40] samples are assumed to provide the possibility SQNR characteristics are attened. In addition, one can
of application of the proposed model in the real-time perceive that for the bit rate of 6.32 bit/sample SQNR
digitalisation of continuous signals having Gaussian PDF dynamic (SQNRmax SQNRmin) is small and amounts to
and a wide variance range (e.g. for VoIP applications). By 2.37 dB. By assuming the same bit rate of 6.32 bit/sample
using the basic denition for the average SQNR for the forward adaptive uniform quantiser with Golomb
Rice code, which, for N = N1 = 128, is the special case of
1 
Ng K
   the proposed forward adaptive hybrid quantiser with
SQNRavg = SQNR sij , s0j (16) GolombRice code, we have ascertained a worst
Ng K j=1 i=1 performance. In particular, in the observed case, we have
ascertained the maximum of the SQNR of 35.13 dB. It is
where NgK denes the number of the particular variances ij less for 1.32 dB in relation to the proposed forward
which are considered in the assumed variance range adaptive hybrid quantiser. In addition, since the forward
Ng adaptive uniform quantiser with GolombRice code does
B = j=1 [s21j /s20 [dB], s2Kj /s20 [dB]) = [20, 20), s20 = 1,
we have calculated the values of SQNRavg for the forward not offer the sophisticated choice of the bit rate and SQNR,
adaptive version of our hybrid quantiser (see Table 1). as it has been observed in the case of the forward adaptive
Moreover, we have determined SQNRmin = min (SQNR (ij, hybrid quantiser with GolombRice code, one can highlight
0j)) and SQNRmax = max (SQNR(ij, 0j)), which dene the advantage of the proposed quantiser with GolombRice
the dynamics of SQNR (SQNRmax SQNRmin) for the code over the uniform and the forward adaptive uniform
observed quantiser model and the assumed variance range quantiser with GolombRice code. Moreover, the
B. Instead of averaging the SQNR over the range B, we comparison of the proposed quantiser with GolombRice
have performed the SQNR averaging over the range B/Ng. code with optimal companding quantiser and GolombRice
In particular, we have utilised one of the meaningful results code has revealed that the proposed quantiser for the same
from [22]

1 K
SQNRavg = SQNR si1 , s01 (17)
K i=1

The bit rate corresponding to the forward adaptive version of


our quantiser is

1 
Ng K   log N
2 g
RFA
GR = RGR sij , s0j +
Ng K j=1 i=1 M
(18)
1 K log2 Ng
= RGR si1 , s01 +
K i=1 M

The parameters of the forward adaptive version of our hybrid


quantiser and performances expressed through RFA GR , SQNR,
which reect the importance of the proper choice of these
parameters, are shown in Table 1. SQNR characteristics for
the forward adaptive hybrid quantiser with N1 = 112, N2 =
16, Ng = 8 and Ng = 16 are presented in Fig. 2. From Fig. 2 Fig. 2 Theoretical dependence of the SQNR as a function of signal
and Table 1, one can conclude that our quantiser, in the variance 2 (in decibels) for the proposed forward adaptive model

376 IET Commun., 2014, Vol. 8, Iss. 3, pp. 372377


& The Institution of Engineering and Technology 2014 doi: 10.1049/iet-com.2012.0791
www.ietdl.org
means that we can choose different values for the number
of levels in the uniform and non-uniform regions, so we
can determine the combination that meets our design
requests most appropriately. All aforementioned points out
the reasons why our model can be used in many
applications for the compression of signals with Gaussian
PDF.

6 References
1 Jayant, N.S., Noll, P.: Digital coding of waveforms (Prentice-Hall,
New Jersey, 1984)
2 Hankerson, D., Harris, G.A., Johnson, P.D.Jr.: Introduction to
information theory and data compression (CHAPMAN & HALL/
CRC, 2004, 2nd edn.)
3 Hanzo, L., Somerville, C., Woodard, J.: Voice and audio compression
for wireless communications (John Wiley and Sons, IEEE Press, 2007)
4 Sayood, K.: Introduction to data compression (Elsevier Inc., 2006)
Fig. 3 Theoretical dependence of the RGR as a function of signal 5 Ramalho, M.: Ramalho G.711 lossless (RGL) codec whitepaper (Cisco
Systems, Inc, 2002)
variance 2 (in decibels) for the proposed forward adaptive model
6 Elabdalla, A.R., Irshid, M.: An efcient bitwise Huffman coding
(Ng = 8 and Ng = 16) technique based on source mapping, Comput. Electr. Eng., 2001, 27,
pp. 265272
7 Zolghadr-E-Asli, A., Alipour, S.: An effective method for still image
SQNR of 37.8 dB provides the gain in compression of 0.262 compression /decompression for transmission on PSTN lines based on
bit/sample. Eventually, observe that if there is a need for modications of Huffman coding, Comput. Electr. Eng., 2004, 30,
pp. 129145
high-quality quantisation and the most constant possible 8 Consultative Committee for Space Data Systems (CCSDS): Lossless
SQNR, our forward adaptive hybrid quantiser designed for data compression (Blue Book, 1997)
the bit rate of 6.58 bit/sample meets these requirements 9 Malvar, H.: Adaptive run-length/Golomb-Rice encoding of quantized
providing SQNRavg that amounts to 36.08 dB. In this case, generalized Gaussian sources with unknown statistics. Proc. Data
Compression Conf. (DCC), IEEE Computer Society, 2006, pp. 2332
the gain in compression of 1.42 bit/sample over the G.711 10 Rice, R.F., Yeh, P.S., Miller, W.H.: Algorithms for high speed universal
GR = 6.58 bit/sample) is achieved. The values
quantiser (RFA noiseless coding module. Proc. AIAA Computing in Aerospace Conf.,
of RGR, calculated according to (15) and (18) for the two San Diego, 1993
above mentioned cases of the proposed model are presented 11 Salomon, D.: Variable-length codes for data compression (Springer,
in Fig. 3, where N1 = 112, N2 = 16, M = 30, Ng = 8 and N1 = 2007)
12 ITU-T: Recommendation G.711, Pulse Code Modulation (PCM) of
112, N2 = 16, M = 40, Ng = 16. As it can be observed, the Voice Frequencies, 1972
great exibility in the bit rates and in the achieved SQNR 13 Hiwasaki, Y., Mori, T., Sasaki, S., Ohmuro, H., Kataoka, A.: A
of our model allows us to nd the combination, which is wideband speech and audio coding candidate for ITU-T G.711 WBE
the most appropriate for our purposes. Everything standardization (ICASSP, 2008)
14 Petkovic, M., Peric, Z., Mosic, A.: Optimisation of variable-length code
mentioned above is the reason why our model can be used for data compression of memoryless Laplacian source, IET Commun.,
for compression of signals with Gaussian PDF. 2011, 5, (7), pp. 906913
15 Peric, Z., Dincic, M., Petkovic, M.: Design of a hybrid quantizer with
5 Summary and conclusion variable length code, Fundam. Inform., 2010, 98, (23), pp. 233256
16 Peric, Z., Nikolic, J., Pokrajac, D.: Hybrid scalar quantizer for the
Laplacian source, WSEAS Trans. Commun., 2007, 6, pp. 6065
In this paper, we have analysed SQNR of the novel forward 17 Peric, Z., Petkovic, M., Dincic, M.: Simple compression algorithm for
adaptive hybrid scalar quantiser designed for the Gaussian memoryless Laplacian source based on the optimal companding
source, as well as the compression achieved with the technique, Informatica, 2009, 20, (1), pp. 99114
application of GolombRice code over the G.711 quantiser. 18 Peric, Z., Dincic, M., Denic, D., Jocic, A.: Forward adaptive
logarithmic quantizer with new lossless coding method for Laplacian
In particular, the discussion is provided about which values source, Wirel. Pers. Commun., 2011, 59, (4), pp. 625641
of parameters affecting the bit rate and SQNR should be 19 Gish, H., Pierce, N.J.: Asymptotically efcient quantizing, IEEE
chosen in order to satisfy high-quality quantisation and the Trans. Inf. Theory, 1968, 14, pp. 676683
necessary robustness requests. It is shown that our model 20 Farvardin, N., Modestino, J.W.: Optimum quantizer performance for a
class of non-gaussian memoryless sources, IEEE Trans. Inf. Theory,
can satisfy G.712 recommendation for high-quality 1984, 30, (3), pp. 485497
quantisation at the bit rate of 6.32 bit/sample achieving the 21 Irvine, A.C., Thyagarajan, K.: Hybrid lossy and lossless compression
compression of 1.68 bit/sample over the G.711 quantiser. In method and apparatus, United States Patent Application Publication
addition, we have revealed that the maximum of the SQNR 2003/0012431 A1, January 16 2003
of our hybrid quantiser is higher for 1.32 dB than the one 22 Peric, Z., Nikolic, J.: An adaptive waveform coding algorithm and its
application in speech coding, Digit. Signal Process., 2012, 22, (1),
of the uniform quantiser designed for the same Gaussian pp. 199209
source and the same bit rate. Our model allows great 23 ITU-T.: Recommendation G.712, Transmission Performance
exibility of the bit rates and, accordingly, of SQNR. This Characteristics of Pulse Code Modulation Channels, 2001

IET Commun., 2014, Vol. 8, Iss. 3, pp. 372377 377


doi: 10.1049/iet-com.2012.0791 & The Institution of Engineering and Technology 2014

You might also like