Coding by non-linear coder

Type non-linear encoder for the 18th variant is 3. So let’s consider an algorithm of the non-linear coder 3:1 step:

Stage 1. Step1. Define a sign. A q1 =S=1 for ls>0 and q1 =S=0 for ls<0.

Stage 2. Step2–4. Define a segment number Nsegm, it is lower bound lsegm min and q2– q4 by means of tree on the Fig. 2.18.

Stage 3. Step5–8. Define bits q5– q8. Calculate the difference ∆ls= ls–lsegm min, quantization step ∆q=2Nsegm –1.

Calculate a number of quantization level N=∆ls/∆q (rounded to the lower whole number) and code it is by means of 4-bit linear codeword or

Step5. If ls–(lsegm min+lsegm min/2)>0, then q5=1, else q5=0.

Step6. If ls–(lsegm min+q5*lsegm min/2+lsegm min/4)>0, then q6=1, else q6=0.

Step7. If ls–(lsegm min+q5*lsegm min/2+q6*lsegm min/4+lsegm min/8)>0, then q7=1, else q7=0.

Step8. If ls–(lsegm min+q5*lsegm min/2+q6*lsegm min/4+q7*lsegm min/8+lsegm min/16)>0, then q8=1, else q8=0.

Now lnowing the algorithm let’s start the coding process.

n.u.

1) ; ;

2) ; ;

3) ; ;

4) ; ;

5) ; ;

6) ; ;

7) ; ;

8) ; ;

Scales of 2-nd Coding stage

Steps of 2-nd coding stage

Q2Q3Q4

u_seg1

∆u_seg

Figure 4.2 - Forming algorithm of 8 bit code combination under non-linear coding

Дата добавления: 2015-08-18