Error Localization of Complex DFT Codes

In this paper we consider the problem of error localization of complex DFT codes and the reconstruction of message. A propagator-based subspace algorithm is proposed for error localization of quantized DFT codes. The propagator method requires only linear operations and does not require any eigendecomposition of syndrome covariance matrix as in conventional subspace method such as MUSIC etc. The performance of the proposed method is compared with MUSIC algorithm. Simulation results show that the proposed method performs equal to the MUSIC algorithm with less computational complexity.