Frame-theoretic analysis of DFT codes with erasures

Authors:
G. Rath;C. Guillemot
Affiliations:
IRISA/INRIA, France;-
Venue:
IEEE Transactions on Signal Processing
Year:
2004

Citing 0
Cited 7

Improving the stability of DFT error recovery codes by using sparse oversampling patterns

Signal Processing
Multiple description coding with redundant expansions and application to image communications

Journal on Image and Video Processing
Joint source-channel coding based on cosine-modulated filter banks for erasure-resilient signal transmission

EURASIP Journal on Applied Signal Processing
Joint source-channel coding by means of an oversampled filter bank code

EURASIP Journal on Applied Signal Processing
An Introduction to Frames

Foundations and Trends in Signal Processing
Frame-theoretic analysis of robust filter bank frames to quantization and erasures

IEEE Transactions on Signal Processing
Impulse Noise Correction in OFDM Systems

Journal of Signal Processing Systems

Quantified Score

Hi-index	35.69

Visualization

Abstract

Discrete Fourier transform (DFT) codes have been used as joint source-channel codes in order to provide robustness against channel errors and erasures. This paper presents a frame-theoretic analysis of lowpass DFT codes with erasures. First, it is shown that such codes make a special class of frames. Then, the message reconstructions by the frame-theoretic signal space projection and coding-theoretic syndrome decoding of erasures are analyzed, and their equivalence is proved. The error performance of lowpass DFT codes is analyzed using the frame theory. The analysis helps in classifying the subframes of a DFT frame into several classes. This classification leads to the development of packetization criteria in order to guarantee minimum mean square reconstruction error and, thus, to minimize the effect of the quantization error. Simulation results substantiate the presented theory and the proposed packetization schemes.