By Topic

Decoding real block codes: activity detection Wiener estimation

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

1 Author(s)
Redinbo, G.R. ; Dept. of Electr. & Comput. Eng., California Univ., Davis, CA, USA

New decoding procedures for real-number block codes which are constructed by imposing constraints in the discrete Fourier transform (DFT) domain are examined. The codewords are corrupted by small levels of roundoff noise and possibly occasionally by a few large excursions of random disturbances. The error-correcting procedure is separated into two parts, large activity detection followed by error value estimation, particularly the larger errors. The first part determines if large excursions are present, roughly identifying their locations, while the second part is a Wiener minimum mean-squared error estimation technique providing a stochastic correction to the corrupted components. The activity-detecting part determines locations for large increases in the Wiener estimator's gain. A computationally intensive Bayes hypothesis testing approach is shown to be very effective at locating large activity positions, but a more efficient modified Berlekamp-Massey (1969) algorithm is developed which leads to excellent mean-squared error performance. Extensive simulations demonstrate individual codeword corrective actions and compare the average mean-squared error performance between coded and unprotected data. The error level improvement ranges from three to four orders of magnitude

Published in:

Information Theory, IEEE Transactions on  (Volume:46 ,  Issue: 2 )