A subspace algorithm for error localization with overcomplete frame expansions and its application to image transmission

In this paper, we propose a subspace algorithm for error localization with quantized frame expansion. The algorithm is similar to the MUSIC algorithm for direction of arrival (DOA) estimation in the array signal processing. The frames considered are a class of error-correcting frames characterized by the BCH-like property of the parity check matrices of the associated complex block codes. In particular, we consider low-pass DFT, DCT and DST frames. Simulation results show that the subspace algorithm outperforms the error locator polynomial approach in localization efficiency. For a G-M source, the DFT frame is seen to have the best performance, however, when applied to an image, the DCT and DST frames are seen to perform somewhat better than the DFT frame especially at higher channel bit error rates.