Extended subspace error localization for rate-adaptive distributed source coding

Abstract

Abstract-A subspace-based approach for rate-adaptive distributed source coding (DSC) based on discrete Fourier transform (DFT) codes is developed. Punctured DFT codes can be used to implement rate-adaptive source coding, however they perform poorly after even moderate puncturing since the performance of the subspace error localization degrades severely. The proposed subspace-based error localization extends and improves the existing one, based on additional syndrome, and is naturally suitable for rate-adaptive distributed source coding architecture.

Low-delay joint source-channel coding with side information at the decoder

“…This results in two sets of vectors corresponding to two orthogonal subspaces, namely, the error subspace and noise subspace. The first set of vectors, which is composed of the ν eigenvectors corresponding to the ν largest eigenvalues of R, forms a spanning basis for the error subspace [16], [21]. Hence, the noise subspace is spanned by the remaining m − ν eigenvectors.…”