This paper analyzes the problem of error amplification in frame-based coding schemes derived from oversampled filter banks. Oversampled filter banks are currently being proposed for robust transmission applications, since added redundancy can be used for error recovery in case of losses. Error amplification is determined by the lower bound of the subframe resulting after losses. Theoretical expressions are derived to characterize such lower bound for different loss statistics. Criteria are derived that can be useful for the design of oversampled filter banks in various applications. The analysis and some application examples demonstrate that filter bank performance strongly depends on how the coefficients are organized into packets
We study the computation of the dual frame for oversampled filter banks (OFBs) by exploiting Grevill...
In this paper we present a new approach to design parity-check polynomial matrices for oversampled D...
Oversampled filter banks have been considered for channel coding, because they introduce redundancy ...
This paper presents a simple method to improve the frame-bounds-ratio of perfect reconstruction (PR)...
This paper examines erasure resilience of oversampled filter bank (OFB) codes, focusing on two fami...
Communication channels are always vulnerable to noise sources. Thereby, any kind of data transmitted...
The authors evaluate error performance limitations in oversampled subband adaptive filter applicatio...
In this letter, we evaluate error performance limitations in oversampled subband adaptive filter app...
This paper studies the frames corresponding to oversampled filter banks (FBs). For this class of FB ...
International audienceThis paper introduces a reconstruction approach for the input signal of an ove...
This paper studies the frames corresponding to stable oversampled filter banks (FBs). For this class...
Perfect reconstruction oversampled filter banks are equivalent to a particular class of frames in t(...
Quantized frame expansions based on block transforms and oversampled filter banks (OFBs) have been ...
Gallager in 1965IEEE Trans. Inform. Theory IT-11, 3) gave an elegant proof of coding theorem and obt...
This paper investigates and solves the problem of frame bound ratio minimization for oversampled per...
We study the computation of the dual frame for oversampled filter banks (OFBs) by exploiting Grevill...
In this paper we present a new approach to design parity-check polynomial matrices for oversampled D...
Oversampled filter banks have been considered for channel coding, because they introduce redundancy ...
This paper presents a simple method to improve the frame-bounds-ratio of perfect reconstruction (PR)...
This paper examines erasure resilience of oversampled filter bank (OFB) codes, focusing on two fami...
Communication channels are always vulnerable to noise sources. Thereby, any kind of data transmitted...
The authors evaluate error performance limitations in oversampled subband adaptive filter applicatio...
In this letter, we evaluate error performance limitations in oversampled subband adaptive filter app...
This paper studies the frames corresponding to oversampled filter banks (FBs). For this class of FB ...
International audienceThis paper introduces a reconstruction approach for the input signal of an ove...
This paper studies the frames corresponding to stable oversampled filter banks (FBs). For this class...
Perfect reconstruction oversampled filter banks are equivalent to a particular class of frames in t(...
Quantized frame expansions based on block transforms and oversampled filter banks (OFBs) have been ...
Gallager in 1965IEEE Trans. Inform. Theory IT-11, 3) gave an elegant proof of coding theorem and obt...
This paper investigates and solves the problem of frame bound ratio minimization for oversampled per...
We study the computation of the dual frame for oversampled filter banks (OFBs) by exploiting Grevill...
In this paper we present a new approach to design parity-check polynomial matrices for oversampled D...
Oversampled filter banks have been considered for channel coding, because they introduce redundancy ...