This paper describes two new matrix transform algorithms for the max-log-map decoding of turbo codes. In the proposed algorithms, the successive decoding procedures carried out in the conventional max-log-map algorith...
详细信息
ISBN:
(纸本)0780370805
This paper describes two new matrix transform algorithms for the max-log-map decoding of turbo codes. In the proposed algorithms, the successive decoding procedures carried out in the conventional max-log-map algorithm are performed in parallel, and well formulated into a set of simple and regular matrix operations, which can therefore considerably speed up the decoding operations and reduce the computational complexity. The matrix max-log-map algorithms also maintain the advantage of the general logarithmic map like algorithms in avoiding complex numerical representation problems. They particularly facilitate the implementations of the logarithmic map like algorithms in special-purpose parallel processing VLSI hardware architectures. The matrix algorithms also allow simple implementations by using shift registers. The proposed implementation architectures for the matrix max-log-map decoding can effectively reduce the memory capacity and simplify the data accesses and transfers required by the conventional max-log-map as well as mapalgorithms.
The max-log-map(MLM) algorithm is simple for Turbo-codes' decoding, based on the algorithm a structure of parallel array for Turbo-codes decoding is suggested,which is easy to implement by *** this structure,flow ...
详细信息
ISBN:
(纸本)0780363949
The max-log-map(MLM) algorithm is simple for Turbo-codes' decoding, based on the algorithm a structure of parallel array for Turbo-codes decoding is suggested,which is easy to implement by *** this structure,flow direction of dates and computation process of the algorithm are obtained,the relation of nodes and date frames are analyzed,and the simple time sequencing of dates operation is *** structure is proved by simulation.
暂无评论