1. Achievement of Optimum Decoding Performance at the Multithreshold Algorithms Basis * * * * * * * MNITI, Space Research Institute (Report at Conference DSPA’07 in Moscow, 28.03.07) - - - - - - - - U.B.Zubarev V.V.Zolotarev V.V.Zolotarev

2. Performance OD at MTD basis2 Application of coding is necessary, because: 1. Rate of communication increases. 2. Reliability of transmission improves. 3. The sizes of aerials considerably decrease. 4. The data retransmission number decreases. 5. Work of communication system is provided at essentially higher noise levels. 6. All this is possible due to large code gain!

3. Performance OD at MTD basis3 MTD Sample Convolutional Multithreshold Decoder for Code with R=1/2, d=5 and 3 Iterations

4. Performance OD at MTD basis4 Chipset MTD at PLIS Xilinx

5. Performance OD at MTD basis5 Decoders MTD at PLIS Xilinx, Altera 1. Speeds of decoding 160 - 480 Mbit/s with (and more - in the nearest future) 1. Speeds of decoding 160 - 480 Mbit/s with (and more - in the nearest future) 2. A code gain is at a level 7,5-9dB and more - already now! 2. A code gain is at a level 7,5-9dB and more - already now! 3. Code rates R=1/4 - 7/8 - and for all types of signals. 3. Code rates R=1/4 - 7/8 - and for all types of signals. 4. The new decoder price will be quickly reduced from $400’000 (development!) up to $5000 - $20000 for small series 4. The new decoder price will be quickly reduced from $400’000 (development!) up to $5000 - $20000 for small series

6. Performance OD at MTD basis6

7. 7 Guests of specialized bilingual web-site SRI RAS www.mtdbest.iki.rssi.ru in December 2006. Свыше 8000 посетителей нашего веб-сайта из 46 стран переписали более 2 Гбайт данных об алгоритмах МПД в 2006 г. More than 8000 guests of our web-site from 50 countries have written more than 5 Gbytes data about MTD algorithms at 2006. USA Russia More than 200 infoblocks! Statistics for 2006, December

8. Performance OD at MTD basis8 « Noiseproof coding. Methods and algorithms » Under edition the member-correspondent of the Russian Academy of Sciences U.B.Zubarev Authors: V.V.Zolotarev, G.V.Ovechkin Authors: V.V.Zolotarev, G.V.Ovechkin Publishing house «Hot Line - Telecom», 2004. Publishing house «Hot Line - Telecom», 2004.

9. Performance OD at MTD basis9 V.V.Zolotarev Theory and multithreshold decoding algorithms * * * * * Under edition the member-correspondent of the Russian Academy of Sciences U.B.Zubarev Publishing houses: «Radio and Communications», «Hot Line - Telecom» 2006

10. Performance OD at MTD basis10Conclusions 1. 1.Iterative MTD algorithms were open 35 years ago. 2. 2.Complexity of soft МПД is an absolute minimum of calculations known now. 3. 3.A difference with a turbo codes on number of operations ~ 100 times! 4. 4.Hard MTD are more quick than a turbo of codes ~1000 times! 5. 5. MTD decisions quickly converges to the optimum decoder (OD) decisions. 6. 6.MTD - is the leader among all algorithms by criteria "complexity - efficiency". 7. 7.We are absolute leaders among other algorithms! 8. 8. WE SUGGEST TO WORK TOGETHER!

11. Performance OD at MTD basis11 28.03.2007 MNITI, SRI RAS Ph.+7-(495)-333-45-45 E-mail: zolotasd@yandex.ru mob.: +7-916-518-86-28 www.mtdbest.iki.rssi.ru