1 / 20

Space Research Institute RAS United Radioelectronic Technologies - - - - - - - -

Optimum Decoding Characteristics Achievement on the Basis of Multithreshold Algorithms (for ISCTA’07). Space Research Institute RAS United Radioelectronic Technologies - - - - - - - - V.V.Zolotarev, S.V.Averin, I.V.Chulkov. Application of noiseproof coding is necessary, because:.

kamuzu
Download Presentation

Space Research Institute RAS United Radioelectronic Technologies - - - - - - - -

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Optimum Decoding Characteristics Achievement on the Basis of Multithreshold Algorithms(for ISCTA’07) Space Research Institute RAS United Radioelectronic Technologies - - - - - - - - V.V.Zolotarev, S.V.Averin, I.V.Chulkov

  2. Application of noiseproof coding is necessary, because: • 1. The large code gain can be received! • Thus: • 2. Distance of communication increases. • 3. Data transmission reliability and speed increases. • 4. The sizes of aerials considerably decrease. • 6. Work of a communication system is provided at essential higher noise levels. 35 years MTD

  3. The lower estimations for error probabilities of an optimum decoding blockcodes with R=1/2 in BSC. Even codes of length n=1000 are inefficient at probability of an error Ро~0.08 in the channel.But the theory states, that it is possible to work successfully if P0<0.11 when C>R C=R n=24 35 years MTD 0,11

  4. Threshold repeated short convolutional codedecoding R=1/2 d=5But it was a weak result! Information Out Out Syndrome Threshold element 35 years MTD

  5. Repeated Application Efficiency of the Threshold Algorithm Part of good decoded blocks 2 Why is it much more than d/2? 1 Very good! d=11 R=1/2 n=1000 N errors in code block 35 years MTD

  6. The ConvolutionalMultithreshold Decoder for a Code with R=1/2, d=5 and 3 iterations Рис. 1. Многопороговый декодер сверточного СОК с R=1/2, d=5 и nA=14 It is - discovery! 35 years MTD

  7. The Block Multithreshold Decoder for Code with R=1/2 and d=5 35 years MTD

  8. SOFTWARE IMPLEMENTATION OF MULTITHRESHOLD DECODER • 1. The complexity of software implementation: NMTD1=(I+1)(d+2) additive equivalent operations on an information bit, whereI isnumber of iterations and d isa minimal code distance. • 2. MTD is applicable for codes withd<20 and needs about 10-20 decoding iterations. • 3. It’s possible to decrease number of operations to NMTD2~4d+3Ioperations.It is much less than turbo codes decoder complexity! • In ~100 times more quickly, than for turbo codes! 35 years MTD

  9. Chipset MTD Decoderat PLISXilinx 35 years MTD

  10. NEW DECODER IN ALTERA PLISFOR SPEED 600Mb/s AND MORE IN THE SPACE CHANNEL Декодер МПД на ПЛИС ALTERA, 640 Мб/с Pb(e)~10-7 Created – Создано -in 2007 35 years MTD

  11. HARDWARE IMPLEMENTATION OF MULTITHRESHOLD DECODER 1.MTD consists of shift registers. They are the fastest elements in PLIS or BIS. The part of other elements in MTD is less than 1%. 2.MTD consists of 6 - 40 parallel shift registers and one-step threshold elements. That’s why the complexity of MTD implemented on PLIS is in 100 and more times faster than other decoder 3.Characteristics of MTD PLIS codec : - speedisabout 320 - 960Mbpsand more, - coding gainisabout 6,5 - 9,5 dB.So, decoding speed is as for single 2 bit adder! 35 years MTD

  12. 35 years MTD

  13. Which decoder must be used? - Most simple and effective !!! 35 years MTD

  14. Welcome for everybody! Visitors of oursite www.mtdbest.iki.rssi.ru in November, 2006. 240 data units ------------------------------------------------------------ ???? USA Russia ~5 Gbytes asked data from us for more than 8000 site visitors of 60 countries in 2006. 35 years MTD

  15. Гостидвуязычного специализированного сайта ИКИ РАНwww.mtdbest.iki.rssi.ru в декабре 2006г. Более 240 блоков данных! Статистика за 2006 год, декабрь USA ???? Россия Свыше 8000 посетителей нашего веб-сайта из 60 стран переписали более 5 Гбайт данных об алгоритмах МПД в 2006 г. Свыше 8000 посетителей нашего веб-сайта из 46 стран переписали более 2 Гбайт данных об алгоритмах МПД в 2006 г. 35 years MTD

  16. Reference book«Помехоустойчивое кодирование. Методы и алгоритмы»под редакцией Ю.Б.Зубарева Авторы: В.В.Золотарёв, Г.В.Овечкин Издательство «Горячая линия - Телеком», 2004г. 35 years MTD

  17. В.В.ЗолотарёвТеория и алгоритмы многопорогового декодированияПод редакцией члена-корреспондента РАН Ю.Б.Зубарева Издательства «Радио и связь», «Горячая линия - Телеком» 2006г. 35 years MTD

  18. Conclusions 1.We have invented effective iterative MTDalgorithms 35 years ago.2.Complexity of program versions MTD - for today an absolute minimum of calculations. A difference from a turbo codes on number of operations at comparable efficiency of ~100 times!3.Hardware MTDcan be faster than a turbo decoders up to 1000 times!4.Decisions MTDquickly aspire to decisions of the optimum decoder (OD) even for large noise level5.MTD– is the absolute leader by criteria "speed" and "complexity-efficiency".6.MTD – is one of the leading algorithms!WE SUGGEST TO WORK TOGETHER! 35 years MTD

  19. Thank you! Moscow 17.07.2007 Russia SRI RAS, URT In Russia: e-mail: zolotasd@yandex.ru Work ph.: +7 495 333 45 45, +7 495 573 51 32 mоb.: +7 916 518 86 28, V.V.Zolotarev, S.V.Averin, I.V.Chulkov www.mtdbest.iki.rssi.ru 35 years MTD

  20. Спасибо ! Конец доклада! 17.07.2007 г. ИКИ РАН Space Research Institute RAS т.+7-(495)-333-45-45 E-mail:zolotasd@yandex.ru моб.: +7-916-518-86-28 www.mtdbest.iki.rssi.ru В.В.Золотарёв Москва 35 years MTD

More Related