dc.contributor.author |
Baltă, Horia |
|
dc.contributor.author |
Kovaci, Maria |
|
dc.date.accessioned |
2021-12-07T14:22:32Z |
|
dc.date.available |
2021-12-07T14:22:32Z |
|
dc.date.issued |
2004 |
|
dc.identifier.citation |
Baltă, Horia. A study on turbo decoding iterative algorithms. Timişoara: Editura Politehnica, 2004 |
en_US |
dc.identifier.uri |
http://primo.upt.ro:1701/primo-explore/fulldisplay?docid=40TUT000137747&context=L&vid=40TUT_V1&lang=ro_RO&search_scope=40TUT&adaptor=Local%20Search%20Engine&tab=default_tab&query=any,contains,A%20study%20on%20turbo%20decoding%20iterative%20algorithms&sortby=rank&offset=0 Link Primo |
|
dc.description.abstract |
In the paper, a study of some turbo decoding iterative algorithms: MAP, MaxLogMAP, LogMAP, is presented. For the correction of the approximation used in the MAxLogMAP algorithm two methods are proposed obtaining two LogMAP algorithm variants. All algorithms variants have been simulated to make possible a comparison from the bit error rate (BER) point of view, in order to provide an optimization for each algorithm. The simulations were made for AWGN channel. Two component codes with generator matrix: G₁ =[1, 5/7] and two interleaver types: pseudo-random [1] and S-interleaver (S=29) are used. The interleaving length is N=1784. The number of emitted blocks in one simulation depends of signal to noise ration, SNR, to obtain a good precision of resulted curve. |
en_US |
dc.language.iso |
en |
en_US |
dc.publisher |
Timişoara : Editura Politehnica |
en_US |
dc.relation.ispartofseries |
Buletinul ştiinţific al Universităţii „Politehnica” din Timişoara, România. Seria electronică şi telecomunicaţii, Tom 49(63), fasc. 2 (2004), p. 33-37 |
|
dc.subject |
Turbo codes |
en_US |
dc.subject |
MAP algorithm |
en_US |
dc.subject |
Trellis |
en_US |
dc.title |
A study on turbo decoding iterative algorithms [articol] |
en_US |
dc.type |
Article |
en_US |