Erasure resilience of oversampled filter bank codes based on cosine modulated filter banks
This paper examines erasure resilience of oversampled filter bank (OFB) codes focusing on two families of codes based on cosine modulated filter banks (CMFB). We discuss frame properties of the CMFB based OFB codes and prove perfect reconstruction (PR) for erasure patterns for which PR depends only on the general structure of the code and not on the prototype filter coefficients. For some of these erasure patterns the expression for the mean square reconstruction error is also independent of filter coefficients and can be expressed in terms of the number of erasures, and of parameters such as number of channels and oversampling ratio. We further take an image coding system as an example and verify the performance of a particular OCMFB code for all possible erasure patterns by simulation.