Search

Owing to the inherent sparse channel feature in multi-carrier modulation systems, compressed sensing (CS)-based techniques have been used for channel estimation with less pilot subcarriers for orthogonal frequency division multiplexing (OFDM) systems. Because of a sparse multipath channel’s characteristic of fractional delay, the channel measurement matrix that is generated by conventional time-domain sampling approaches cannot perfectly recover the channel impulse response (CIR), especially in the case of two adjacent paths that both have with non-negligible power. In this study, a fractional delay multipath channel model is used to simulate the wireless multipath channel. In addition, a time-domain oversampling based doubly reduced matching pursuit (DRMP) algorithm at the receiver is proposed to improve the estimation accuracy while reducing the computational complexity. Simulation results show that the proposed method can improve both the bit error rate (BER) performance and estimation time compared to conventional methods in an environment with fractional delay. [ABSTRACT FROM AUTHOR]

Compressive sensing based channel estimation has shown its advantage of accurate reconstruction for sparse signal with less pilots for OFDM systems. However, high computational cost requirement of CS method, due to linear programming, significantly restricts its implementation in practical applications. In this paper, we propose a reduced complexity channel estimation scheme of modified orthogonal matching pursuit with sliding windows for ISDB-T (Integrated Services Digital Broadcasting for Terrestrial) system. The proposed scheme can reduce the computational cost by limiting the searching region as well as making effective use of the last estimation result. In addition, adaptive tracking strategy with sliding sampling window can improve the robustness of CS based methods to guarantee its accuracy of channel matrix reconstruction, even for fast time-variant channels. The computer simulation demonstrates its impact on improving bit error rate and computational complexity for ISDB-T system. [ABSTRACT FROM AUTHOR]