Upload
barry-booth
View
223
Download
2
Embed Size (px)
Citation preview
Concatenated symbolical MTDConcatenated symbolical MTD 11
Concatenated coding Concatenated coding for data bases for data bases
with MTD with MTD * * * * * * ** * * * * * *
MNITI, Space Institute Research MNITI, Space Institute Research (the Report at 10-th International (the Report at 10-th International conference DSPA-2008, in Moscow, conference DSPA-2008, in Moscow,
26.03.08)26.03.08)
- - - - - -- - - - - - --
J.B.Zubarev, J.B.Zubarev,
V.V.ZolotarevV.V.Zolotarev
Concatenated symbolical MTDConcatenated symbolical MTD 22
Chipset of the MTD decoder Chipset of the MTD decoder
at PLIS Xilinx at PLIS Xilinx
Concatenated symbolical MTDConcatenated symbolical MTD 33
МАКЕТ МПД для каналов на 640 Мбит/с.МАКЕТ МПД для каналов на 640 Мбит/с. Многопороговый декодер (МПД) для Многопороговый декодер (МПД) для
спутниковых и космических каналов связи. спутниковых и космических каналов связи. Повышает кпд их использования в 3 -10 раз, в Повышает кпд их использования в 3 -10 раз, в
том числе том числе для ДЗЗдля ДЗЗ.. Может работать на Может работать на информационных скоростях до 1,6 Гбит/синформационных скоростях до 1,6 Гбит/с
Concatenated symbolical MTDConcatenated symbolical MTD 44
Chipset of the MTD Chipset of the MTD decoder decoder
at PLIS ALTERA at PLIS ALTERA
Concatenated symbolical MTDConcatenated symbolical MTD 55
The reference bookThe reference book " Noiseproof coding. " Noiseproof coding.
Methods and algorithms Methods and algorithms " "
Under edition the Under edition the member - correspondent member - correspondent of the Russian Academy of the Russian Academy of Sciences U.B.Zubarevof Sciences U.B.ZubarevAuthors: V.V.Zolotarev, G.V.OvechkinAuthors: V.V.Zolotarev, G.V.Ovechkin
Publishing housePublishing house "the Hot Line - a Telecom ", 2004г."the Hot Line - a Telecom ", 2004г.
Concatenated symbolical MTDConcatenated symbolical MTD 66
V.V.Zolotarev V.V.Zolotarev The Theory and The Theory and
Algorithms of Algorithms of Multithreshold DecodingMultithreshold Decoding
Under edition Under edition the member - correspondent the member - correspondent of the Russian Academy of of the Russian Academy of
Science J.B.ZubarevScience J.B.Zubarev ((Do you want to get Do you want to get
translated this monograph?)translated this monograph?) Publishing houses " Radio and communication Publishing houses " Radio and communication ", " the Hot Line - Telecom " 2006", " the Hot Line - Telecom " 2006
Concatenated symbolical MTDConcatenated symbolical MTD 77
Example of MTD with 3 iterations
0 1 2 3 4 5 6
0 1 2 3 4 5 6
6 5 4 3 2 1
T1
v
u
0
0 1 2 3 4 5 6
0 1 2 3 4 5 6
6 5 4 3 2 1
T2
0
0 1 2 3 4 5 6
0 1 2 3 4 5 6
6 5 4 3 2 1
T3
0
The convolutional multithreshold decoder The convolutional multithreshold decoder for a code with R=1/2, d=5 and 3 iterationsfor a code with R=1/2, d=5 and 3 iterations
Concatenated symbolical MTDConcatenated symbolical MTD 88
The block symbolical MTD The block symbolical MTD for a code with R=1/2 and d=5for a code with R=1/2 and d=5
Concatenated symbolical MTDConcatenated symbolical MTD 99
Application of coding in Application of coding in databases necessarily, databases necessarily,
because: because: • 1. Raises fidelity the stored data.1. Raises fidelity the stored data.• 2. Integrity of the digital information is 2. Integrity of the digital information is
guaranteedguaranteed• 3. Increased reliability of storage is provided3. Increased reliability of storage is provided• 4. The fast control of the storage reliability 4. The fast control of the storage reliability
changes is realized.changes is realized.• 5. Work of system of storage is provided 5. Work of system of storage is provided
at high levels of distortions in the data. at high levels of distortions in the data.• 6. It is provided with increased adjusting 6. It is provided with increased adjusting
ability of MTD at the big decoder ability of MTD at the big decoder productivityproductivity
• 7. Non-binary MTD – discovery in symbol 7. Non-binary MTD – discovery in symbol decoding processing! RS codes- are out of decoding processing! RS codes- are out of any competions at all!any competions at all!
Concatenated symbolical MTDConcatenated symbolical MTD 1010
Decoders MPD for the superbig DBDecoders MPD for the superbig DB
• 1. Speeds of soft decoders for usual PC 1. Speeds of soft decoders for usual PC - up to 30 Mbit/s - up to 30 Mbit/s
• 2. A level of error probabilities - 2. A level of error probabilities - up to 1 % - 8 %! up to 1 % - 8 %!
• 3. Code rates R=1/4 - 19/20 - anyone 3. Code rates R=1/4 - 19/20 - anyone and for all levels of error probabilities .and for all levels of error probabilities .
• 4. The decoder price will be quickly 4. The decoder price will be quickly reduced from 30'000 $(development!) reduced from 30'000 $(development!) up to 3000 $ - 10000 $ for small seriesup to 3000 $ - 10000 $ for small series
Concatenated symbolical MTDConcatenated symbolical MTD 1111
Performance of the MTD decoders and Reed-Solomon codes
1,0E-10
1,0E-09
1,0E-08
1,0E-07
1,0E-06
1,0E-05
1,0E-04
1,0E-03
1,0E-02
1,0E-01
1,0E+00
0,3 0,29 0,28 0,27 0,26 0,25 0,24 0,23 0,22 0,21 0,2 0,19 0,18 0,17 0,16 0,15
Symbolic channel error probabilities in QSC
Sym
bol e
rror d
ecod
er
prob
abilit
ies P
b(e)
М400RS256
M4000RS4096
RS65536
M32b1
M32b2
Concatenated symbolical MTDConcatenated symbolical MTD 1212
Characteristics of the symbolical MTD and Read -
Solomon codes, R=7/8
Concatenated symbolical MTDConcatenated symbolical MTD 1313
Characteristics of the symbolical MTD and Read - Solomon codes, R=19/20
Concatenated symbolical MTDConcatenated symbolical MTD 1414
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
Concatenated symbolical MTDConcatenated symbolical MTD 1515
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?)
Concatenated symbolical MTDConcatenated symbolical MTD 1616
ConclusionsConclusions 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 1010 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!
Concatenated symbolical MTDConcatenated symbolical MTD 1717
26.03.20026.03.20088
MNITI, SRI RAS MNITI, SRI RAS ph:. 632-17-34, 333-45-45 - in Moscow!ph:. 632-17-34, 333-45-45 - in Moscow!e-mail: [email protected], [email protected]
mobile.: +7 916 518 86 28mobile.: +7 916 518 86 28
www.mtdbest.iki.rssi.ruwww.mtdbest.iki.rssi.ru