Review of modern noise proof coding methods

1. Review of modern noise proof coding methods D. Sc. Valeri V. Zolotarev 0 1 0 00%1 1 10? 01 1 0 1 # 0 1

2. The large volume of transmitting data demands to provide their high veracity • One of major ways for transmission error probability decrease in noisy digital channels is usage of noise proof coding methods V. Zolotarev - Review of modern coding methods

3. Principles of noise proof coding • The information is broken into blocks, for example, binary digits, to which one the check bits being by a function from an information part of the transmitting data are added. • The relative part of initial information characters in such enlarged block is called as code rate R. V. Zolotarev - Review of modern coding methods

4. The main concepts of information theory • Channel capacity С - • characterizes a maximum mean information quantity, which one can be transferred to the receiver during the period of one usage of a channel. • С - function of a channel noise level, i. e. of mean transmission error probability for binary digits. V. Zolotarev - Review of modern coding methods

5. The main limitation in information theory for coding • The condition should be always satisfied: • R < C ! • In this case there are coders, which one can ensure a digital transmission with an arbitrary small probability of an error, if the block length will be great enough. • . V. Zolotarev - Review of modern coding methods

6. 1. The introducing of redundancy conforming to a given value of code rate R is very simply. 3. SoR<C - understandable for the specialists condition 2. For given error probabilities of transmitting binary digits in Gaussian channel its capacity C also is easily calculated How to fulfill the indicated condition in communication engineering? Is it difficult or not? V. Zolotarev - Review of modern coding methods

7. The elementary encoder for a block code with 2 correcting errors! It is way to form redundancy (code rate): R=1/2 V. Zolotarev - Review of modern coding methods

8. Whenever possible - it is else easier!!! An example of the encoder for a convolutional code with the same code rate R=1/2. V. Zolotarev - Review of modern coding methods

9. Limit possibilities of coding V. Zolotarev - Review of modern coding methods

10. What quality of codes is main? • - Code distance d ! • It determines minimum number of symbol positions, in which the code words (permissible data) are different. • For example, in parity checking codes all permissible words - are only ones with an even number of «ones». So its code distance is d=2 ! V. Zolotarev - Review of modern coding methods

11. What for it is necessary to take codes with large d values? • The more d, then the greater number of errors appeared in the transmitted code block by, can be corrected. • In this case portion of blocks grows, which one after decoding can be error-free. • And then what maximum d values are possible? V. Zolotarev - Review of modern coding methods

12. Limits of correcting properties for two code classes V. Zolotarev - Review of modern coding methods

13. ! One of main questions: // What may the code length be? • As at R<C the theory guarantees good outcomes of the coded data transmission, let's see, as far as lengthy should be the code block in different cases. V. Zolotarev - Review of modern coding methods

14. The lower estimations of error probabilities of optimum block code decoding with R=1/2 in BSC. Even the codes with length n=1000 are ineffective at channel error probability Po > 0.07. But the theory affirms, that it is possible to work successfully at Po < 0.11, in accordance to main condition C > 1/2. And it is true for total searching methods! V. Zolotarev - Review of modern coding methods

15. The main «jokes» of the Nature • 1. Almost all codes are "good". If decoder is optimal then resulting error probability will be close to the best ones. • 2. Almost all codes can be decoded only by total searching methods. For a code length n=1000 exhaustive search at R=1/2 requires to look through 2500(!!!) versions of the possible code words. But it exceeds number of atoms in the Universe! • So what must we do? PROBLEM!!! V. Zolotarev - Review of modern coding methods

16. The Main Problem of the noise proof coding theory • 1. To find and to investigate simple non exhaustive search decoding methods in noisy channel. • 2. To ensure such decoding quality with these methods, that they were more close to efficiency of optimal procedures. • 3. To remember needs and conditions of coding usage in communication systems. V. Zolotarev - Review of modern coding methods

17. Threshold decoders: everything is simple!Let's pay attention: It is truly the elementary errors correcting scheme! V. Zolotarev - Review of modern coding methods

18. But TD efficiency - is paltry! It is extremely far from Ро=0.11. V. Zolotarev - Review of modern coding methods

19. Multithreshold decoders (MTD) for Gaussian channels They are designed and deeply investigated during last 30 years multithreshold decoders very poorly distinguished from customary extremely simple classic threshold procedures, offered by J.L.Massey. The main property MTD - at each change of symbols new decoder decision becomes more close to the optimum one! V. Zolotarev - Review of modern coding methods

20. The main consequence from MTD properties • If MTD for a long time changes characters of the received data, it can achieve the solution of the optimum decoder (OD) at linear complexity of decoding. • Usually solutions OD - are the outcomes of exponential growing with code length exhaustive search ....., • but here we get linear complexity?!! V. Zolotarev - Review of modern coding methods

21. It is multithreshold decoder!!! It is a view of block MTD. The new register contains a difference between the MTD solutions and values of information bits of a channel. Why? V. Zolotarev - Review of modern coding methods

22. Рис. 1. Многопороговый декодер сверточного СОК с R=1/2, d=5 и nA=14 This is convolutional MTD with R=1/2, d=5 and 3 iterations V. Zolotarev - Review of modern coding methods

23. The resolved MTD problems • 1. The very complicated problem of an error propagation effect (EP) estimation in TD is completely resolved • 2. The codes with minimum EP were successfully constructed ! • 3. Four generations of MTD coding equipment have been built. • 4. Most important: the minimum possible complexity of decoding, referenced for customary TD is saved. • 5. Consequent. MTD works at high noise levels almost as OD. • 6. TOTAL. Creation of the effective decoder near channel capacity C • - generally resolved problem. V. Zolotarev - Review of modern coding methods

24. The estimations of convolutional code error probability decoding for Viterbi algorithm and MTD in BSC with R=1/2. 2.0 V. Zolotarev - Review of modern coding methods

25. And what is necessary for communication engineering? • “The energy decrease in communication channel at 1 dB gives an economic efficiency $1’000’000 ,” - E.R.Berlecamp, IEEE, 1980, vol.68, №5. • Now at enormous growth of communication network cost the price of signal power decrease has increased (!!!) multiply. • But how to fasten probabilistic channel parameters to its signal energy? V. Zolotarev - Review of modern coding methods

26. The coding considerably reduces signal power in transmission channel! • The value of a decrease is called code gain (CG)G = 10*Lg(R*d) dB • The signalmen for a long time know how to change the receiver for increase code gain. • And where are limits of signal power decrease? V. Zolotarev - Review of modern coding methods

27. The “soft” modem estimating reliability of a signal reception instead of "hard", which one only makes a decision about value of received bit, allows to diminish signal power approximately at 2 dB. « - » « + » V. Zolotarev - Review of modern coding methods

28. The minimally possible ratio of energy per bit of the transmitted information to a noise power density Eb/No in binary channel for different code rate R can be submitted for “hard” and “soft” modems so: V. Zolotarev - Review of modern coding methods

29. V. Zolotarev - Review of modern coding methods

30. Concatenation - it’s the best!In this case the coding implements two and more codes, which ones in the receiver are decoded in the return order and at definite interplay of decoders. On the chart - best known outcomes on efficiency in Gaussian channel: Viterbi algorithm (VAk), MTD usual and cascaded (MTDK), VA+RS-code, best of turbo (T1 and T2), and woven code (W1) too. V. Zolotarev - Review of modern coding methods

31. BUT! MTD in 100 times more simple!!! V. Zolotarev - Review of modern coding methods

32. What shall we use ?- Most simple and effective methods !!! MTD-K V. Zolotarev - Review of modern coding methods

33. Thank you! NIIRadio 05.09.2003 Moscow Space Research Institute E-mail: zolotasd@yandex.ru Work tel. +7 - 095-333-23-56, +7 -095-261-54-44 моb.: +7-916-518-86-28 www.mtdbest.iki.rssi.ru V. Zolotarev - Review of modern coding methods