By Topic

Turbo Decoding Complexity Reduction by Symbol Selection and Partial Iterations

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
$33 $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

3 Author(s)
Jinhong Wu ; George Washington Univ., Washington ; Branimir R. Vojcic ; Zhengdao Wang

Based on an analysis on the recursive computation of the iterative maximum a posteriori (MAP) algorithm for turbo decoding, this paper considers a modified MAP scheme with reduced block lengths for symbols with unreliable detection after some initial iterations. Applying symbol selection based on cross-entropy measurement for parallel concatenated convolutional codes, we develop partial, windowed iterations for selected symbols. By omitting computations for symbols with reliable detection results, this approach significantly reduces complexity but well maintains the performance by complete iterations.

Published in:

IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference

Date of Conference:

26-30 Nov. 2007