Turbo Quantization of Oversampled Signals

We present a new iterative quantization procedure for oversampled frames with guaranteed convergence and stability. The procedure uses similar concepts to that of turbo decoding in the context of error control coding. The quantization process is modeled as a quadratic integer-programming problem. A...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on information theory Vol. 62; no. 2; pp. 713 - 723
Main Author Mansour, Mohamed F.
Format Journal Article
LanguageEnglish
Published New York IEEE 01.02.2016
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Coding theory
Context
Convergence
Decoding
Error correction & detection
Exchanging
Frames
Hilbert space
Integer programming
Iterative decoding
Iterative methods
Linear programming
Noise shaping
Optimization
oversampling
Quantization
Quantization (signal)
Stability
Quantization
integer programming
frames
analog to digital conversion
optimization
oversampling
Online AccessGet full text

Cover

More Information
Summary:We present a new iterative quantization procedure for oversampled frames with guaranteed convergence and stability. The procedure uses similar concepts to that of turbo decoding in the context of error control coding. The quantization process is modeled as a quadratic integer-programming problem. A trellis structure is introduced to solve the problem, where the quantized coefficients represent a path through the trellis diagram. The quantization metric is iteratively improved through turbo iterations by exchanging quantization extrinsic information. The proposed procedure is shown to provide significant improvement over prior art in quantization and integer programming.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2015.2508563