Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

Parallel decoding of turbo codes using soft output T-algorithms

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.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Dasgupta, U. ; DSP R&D Center, Texas Instrum. Inc., Dallas, TX, USA ; Narayanan, K.R.

Turbo codes need to be used with reasonably long blocks of data which invariably lead to considerable decoding delay. In fact, for a data block of size N, the decoding delay is O(N). Recently it was shown that if the hardware complexity of W processors was acceptable, then the decoding delay could be reduced to O(N/W) without much performance degradation, by decoding the turbo code in a parallel fashion. In this paper we have shown that the decoding delay could be further reduced if the component decoders use parallel versions of soft output T-algorithms instead of parallel versions of the MAP algorithm. Unlike the MAP algorithm which could be used with parallel and pipelined structures to reduce the decoding delay to the same extent, the soft output T-algorithms must be used with a parallel structure in order to reduce the decoding delay. This reduction in decoding delay is obtained without any appreciable degradation in performance

Published in:

Vehicular Technology Conference, 2000. IEEE-VTS Fall VTC 2000. 52nd  (Volume:3 )

Date of Conference:

2000