ETRFI Based Iterative Channel Estimation Scheme and Its Optimal Number of Iterations to Enhance PER performance in WAVE Communication Systems

• Published in: International JOURNAL OF CONTENTS Vol. 19; no. 2; pp. 39 - 47
• Main Authors: Park, Sung-Hyun, Lim, Sungmook
• Format: Journal Article
• Language: English
• Published: 한국콘텐츠학회(IJOC) 30.06.2023; 한국콘텐츠학회
• Subjects: 컴퓨터학; Iterative Channel Estimation; ETRFI; PER Performance; WAVE Communication Systems
• ISSN: 1738-6764; 2093-7504
• DOI: 10.5392/IJoC.2023.19.2.039

This paper proposed a new channel estimation scheme to enhance packet error rate (PER) performance in WAVE communication systems. The proposed scheme was based on conventional enhanced time domain reliable test frequency domain interpolation (ETRFI). PER performance was maximized by iteratively estimating and updating channel coefficients. In the proposed scheme, channel coefficients were initially estimated by the ETRFI scheme. Information bits were then decoded based on estimated channel values. After data symbols were reconstructed with a receiver using decoded information bits, channel coefficients were updated using reconstructed data symbols as pilot symbols. Data symbols reconstructed from decoded information bits showed very high accuracy. Its PER performance was better than performances of conventional schemes. Moreover, as the number of iterations increased, PER performance was further improved. The optimal number of iterations to maximize the PER performance was dependent on channel fluctuation. Therefore, as the channel varied rapidly in time and frequency domains, the optimal number of iterations also increased. Numerical results showed that the PER performance of the proposed scheme was better than those of conventional schemes. In addition, the optimal number of iterations was 2 in the channel environment of Cross Non-line-of-sight (NLOS) with 126km/h. On the other hand, it was 3 in Highway NLOS with 252 km/h which varied more rapidly than Cross NLOS in the time domain. KCI Citation Count: 0