Transcript Многопороговые алгоритмы, реализованны

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
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!
Performance OD at MTD basis
2
Convolutional Multithreshold Decoder for
Code with R=1/2, d=5 and 3 Iterations
uˆ
vˆ
0
1
2
3
4
5
6
0
1
2
3
4
5
6
0
1
2
3
4
5
6
0
1
2
3
4
5
6
0
1
2
3
4
5
6
0
1
2
3
4
5
6
6
5
4
3
2
1
0
6
5
4
3
2
1
0
6
5
4
3
2
1
0
T1
T2
T3
MTD Sample
Performance OD at MTD basis
3
Chipset MTD
at PLIS Xilinx
Performance OD at MTD basis
4
Decoders MTD at PLIS Xilinx, Altera
• 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!
• 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
Performance OD at MTD basis
5
Performance MTD, VA and turbo codes at R=1/2
1,E+00
C=1/2
1,E-01
MTDNEC
BER
Pb(e)
1,E-02
MTD-L
MTDmd2
VA+RS
MTD-Х
1,E-03
VA К=7
1,E-04
1,E-05
MTD+C
C2
Turbo
1,E-06
MTD+CC3
1,E-07
0
0,5
1
1,5
2
2,5
3
3,5
4
Ratio Eb/N0
Performance OD at MTD basis
6
Guests of specialized bilingual web-site SRI RAS
www.mtdbest.iki.rssi.ru
in December 2006. More than 200
infoblocks!
Statistics for 2006, December
USA
Russia
More than
guests of our
Свыше
80008000
посетителей
нашего
web-site from
countries
have
веб-сайта
из 4650
стран
переписали
written
more than
5 Gbytes data
более
2 Гбайт
данных
MTD algorithms
at 2006.
обabout
алгоритмах
МПД в 2006
г.
Performance OD at MTD basis
7
« 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 «Hot Line - Telecom», 2004.
Performance OD at MTD basis
8
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
Performance OD at MTD basis
9
Conclusions
1. Iterative MTD algorithms were open 35 years ago.
2. Complexity of soft МПД is an absolute minimum of calculations
known now.
3. A difference with a turbo codes on number of operations
~ 100 times!
4. Hard MTD are more quick than a turbo of codes
5.
~1000 times!
MTD decisions quickly converges to the optimum decoder
(OD) decisions .
6. MTD - is the leader among all algorithms by criteria "complexity efficiency".
7. We are absolute leaders among other algorithms!
8. WE SUGGEST TO WORK TOGETHER!
Performance OD at MTD basis
10
MNITI, SRI RAS
Ph.+7-(495)-333-45-45
E-mail: [email protected]
mob.: +7-916-518-86-28
www.mtdbest.iki.rssi.ru
28.03.2007
Performance OD at MTD basis
11