By Topic

Improved tight performance bounds on concatenated 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.

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)
Herzog, R. ; Inst. for Commun. Eng., Munich Univ. of Technol., Germany ; Weiss, C.

We derive new approximate upper bounds on the error probability of linear codes with maximum likelihood decoding by applying an appropriate transformation of decision variables. The new bounds are simple to calculate and based on the standard union bound but give tight results in some range below the channel cutoff rate R0. In applying the bound to iterative decodable codes, such as turbo codes, we use the concept of uniform interleavers and determine the average distance spectrum. A comparison of our bounds to simulated error rates shows a significantly improved tightness similar to the tangential sphere bound of Poltyrev (1994), which is the best rigorous upper bound known up to now.

Published in:

Global Telecommunications Conference, 1999. GLOBECOM '99  (Volume:5 )

Date of Conference:

1999