1. Concatenated symbolical MTD1 Concatenated coding for data bases with MTD * * * * * * * MNITI, Space Institute Research (the Report at 10-th International conference DSPA-2008, in Moscow, 26.03.08) - - - - - -- J.B.Zubarev,V.V.Zolotarev

2. Concatenated symbolical MTD2 Chipset of the MTD decoder at PLIS Xilinx

3. Concatenated symbolical MTD3 МАКЕТ МПД для каналов на 640 Мбит/с. Многопороговый декодер (МПД) для спутниковых и космических каналов связи. Повышает кпд их использования в 3 -10 раз, в том числе для ДЗЗ. Может работать на информационных скоростях до 1,6 Гбит/с

4. Concatenated symbolical MTD4 Chipset of the MTD decoder at PLIS ALTERA

5. Concatenated symbolical MTD5 The reference book " 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 Publishing house Publishing house "the Hot Line - a Telecom ", 2004г. "the Hot Line - a Telecom ", 2004г.

6. Concatenated symbolical MTD6 V.V.Zolotarev The Theory and Algorithms of Multithreshold Decoding Under edition the member - correspondent of the Russian Academy of Science J.B.Zubarev ( Do you want to get translated this monograph?) Publishing houses " Radio and communication ", " the Hot Line - Telecom " 2006 Publishing houses " Radio and communication ", " the Hot Line - Telecom " 2006

7. Concatenated symbolical MTD7 Example of MTD with 3 iterations The convolutional multithreshold decoder for a code with R=1/2, d=5 and 3 iterations

8. Concatenated symbolical MTD8 The block symbolical MTD for a code with R=1/2 and d=5

9. Concatenated symbolical MTD9 Application of coding in databases necessarily, because: 1. Raises fidelity the stored data. 1. Raises fidelity the stored data. 2. Integrity of the digital information is guaranteed 2. Integrity of the digital information is guaranteed 3. Increased reliability of storage is provided 3. Increased reliability of storage is provided 4. The fast control of the storage reliability changes is realized. 4. The fast control of the storage reliability changes is realized. 5. Work of system of storage is provided at high levels of distortions in the data. 5. Work of system of storage is provided at high levels of distortions in the data. 6. It is provided with increased adjusting ability of MTD at the big decoder productivity 6. It is provided with increased adjusting ability of MTD at the big decoder productivity 7. Non-binary MTD – discovery in symbol decoding processing! RS codes- are out of any competions at all! 7. Non-binary MTD – discovery in symbol decoding processing! RS codes- are out of any competions at all!

10. Concatenated symbolical MTD10 Decoders MPD for the superbig DB 1. Speeds of soft decoders for usual PC - up to 30 Mbit/s 1. Speeds of soft decoders for usual PC - up to 30 Mbit/s 2. A level of error probabilities - up to 1 % - 8 %! 2. A level of error probabilities - up to 1 % - 8 %! 3. Code rates R=1/4 - 19/20 - anyone and for all levels of error probabilities. 3. Code rates R=1/4 - 19/20 - anyone and for all levels of error probabilities. 4. The decoder price will be quickly reduced from 30'000 $(development!) up to 3000 $ - 10000 $ for small series 4. The decoder price will be quickly reduced from 30'000 $(development!) up to 3000 $ - 10000 $ for small series

11. Concatenated symbolical MTD11

12. Concatenated symbolical MTD12 Characteristics of the symbolical MTD and Read - Solomon codes, R=7/8

13. Concatenated symbolical MTD13 Characteristics of the symbolical MTD and Read - Solomon codes, R=19/20

14. Concatenated symbolical MTD14 Visitors of bilingual specialized site SRI of the Russian Academy of Sciences www.mtdbest.iki.rssi.ru in December, 2006. Over 8000 visitors of our website from 46 countries have copied more than 2 Гбайт the data on algorithms МПД in 2006. Over 8000 visitors of our website from 50 countries have copied more than 5 Gbites the data on MTD algorithms in 2006. THE USA Russia More 250 info-blocks! Statistics for 2006, December

15. Concatenated symbolical MTD15 The REVIEW of METHODS NOISEPROOF CODING with MULTITHRESHOLD ALGORITHMS J.B.Zubarev, V.V.Zolotarev, G.V.Ovechkin Digital signals processing, RF, Moscow, № 1, 2008 (in Russian! Do you want to get translation in English?)

16. Concatenated symbolical MTD16Conclusions 1. Binary MTD algorithms are revealed 35 years, and non-binary - 24 years ago. 2. Complexity of soft versions of QMTD is an absolute minimum of calculations known now. 3. They can get QMTD simulation statistics up to 10 10 bits for ~1 hour with the usual PC! 4. Hard MTD at PLIS is extremely quick decoder 5. Decisions of QMTD usually well converge to decisions of the optimum decoder (OD) 6. QMTD – is the absolute leader among all algorithms by criteria "complexity - efficiency" 7. QMTD is out of to comparison! Their characteristics are fully unique because of decoding simplicity. 8.We suggest many demo programs from our web-site about various best algorithms. Let's work together!

17. Concatenated symbolical MTD17 26.03.2008 MNITI, SRI RAS ph:. 632-17-34, 333-45-45 - in Moscow! e-mail: mniti@mniti.ru, zolotasd@yandex.ru mobile.: +7 916 518 86 28 www.mtdbest.iki.rssi.ru www.mtdbest.iki.rssi.ru