Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

A low complex parallel decoding structure for turbo-codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
2 Author(s)
Zhang Zhongpei ; 12th Dept., Univ. of Electron. Sci. & Technol. of China, Chengdu, China ; Liang, Zhou

The Max-Log-MAP (MLM) algorithm is simple for turbo code decoding. Based on the algorithm a parallel array structure for turbo code decoding is suggested, which is easy to implement by VLSI. In 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 date operation is presented. The structure is proved by simulation

Published in:

Communication Technology Proceedings, 2000. WCC - ICCT 2000. International Conference on  (Volume:1 )

Date of Conference:

2000