• ETRI Journal
• /
• 제29권5호
• /
• pp.596-606
• /
• 2007

It is well known that an OFDM receiver is vulnerable to synchronization errors. Despite fine estimations used in the initial acquisition, there are still residual synchronization errors. Though these errors are very small, they severely degrade the bit error rate (BER) performance. In this paper, we propose a residual error elimination scheme for the digital OFDM baseband receiver aiming to improve the overall BER performance. Three improvements on existing schemes are made: a pilot-aided recursive algorithm for joint estimation of the residual carrier frequency and sampling time offsets; a delay-based timing error correction technique, which smoothly adjusts the incoming data stream without resampling disturbance; and a decision-directed channel gain update algorithm based on recursive least-squares criterion, which offers faster convergence and smaller error than the least-mean-squares algorithms. Simulation results show that the proposed scheme works well in the multipath channel, and its performance is close to that of an OFDM system with perfect synchronization parameters.

• 한국컴퓨터산업학회논문지
• /
• 제9권2호
• /
• pp.77-82
• /
• 2008

The diversity reception and the equal gain combining technique are applied to the compensation of the distortion of channel, which occurs in transmission of data at rapid speed. DSSS BPSK system which has the receiving structure with the compensation algorithm is formed on the diversity branch, and the characteristics of the system are evaluated at the view point of the average bit error rate due to the SNR. In addition, the multi-tap update algorithm which is superior for the data compensation is suggested. Moreover, using the American Joint Technical Committee PCS RF channel characterization and system deployment model standard, the suggested multi-tap update algorithm is compared and analyzed with the view-point of the average bit error rate and convergence speed for evaluating the realistic efficiency of the system.

• International Journal of Contents
• /
• 제15권4호
• /
• pp.27-35
• /
• 2019

In this paper, we propose an advanced Minimum Mean Square Error (MMSE) channel estimation method for IEEE 802.11p/Wireless Access in Vehicular Environments (WAVE) systems. To improve the performance of MMSE method, we apply the Weighted Sum using Update Matrix (WSUM) scheme to the step of calculating the instantaneously estimated channel and then, a time domain selectively averaging method is applied after the WSUM scheme. Based on that, the accuracy of instantaneously estimated channel increases and then, the accuracy of auto covariance matrix also increases. Consequently, we can achieve the performance gain over the conventional MMSE method. Through simulations based on the IEEE 802.11p standard, it is confirmed that the proposed scheme can outperform the existing channel estimation schemes.

• Journal of Electrical Engineering and Technology
• /
• 제12권3호
• /
• pp.1280-1285
• /
• 2017

In this paper, we consider iterative soft-decision feedback equalizers (sDFE), a.k.a. turbo equalizers for single-carrier transmission. Turbo equalizer takes log-likelihood ratio (LLR) feedback from channel decoder and convert the LLR into symbol estimates and variances to be used for the LLR update at the sDFE. Specifically, we consider both time domain and frequency-domain sDFE and compare their performances. The results shows that frequency-domain sDFE performs better than time-domain one and also that considerable gain can be obtained especially when the channel has deep nulls.

• 한국인터넷방송통신학회논문지
• /
• 제16권1호
• /
• pp.103-108
• /
• 2016

통신 시스템에서 제한된 총 전력으로 여러개의 부채널로 이루어진 채널의 입력과 출력 사이의 상호정보를 최대화하는 문제의 해는 Waterfilling 구조를 가진다. 채널 상태 정보(CSI)를 알고 있을 때 OFDM이나 MIMO는 병렬의 독립된 부채널들로 분해 될 수 있다. 제한된 전력 하에 채널용량에 접근하는 전송속도를 위한 최적의 부채널 전력할당 문제의 해는 Waterfilling 으로 구할 수 있다. Waterfilling은 상태가 좋은(SNR이 높은) 부채널에 더 많은 전력을 할당하고 상태가 나쁜 채널들은 적은 전력이나 전력을 할당하지 않음으로서 상태가 좋은 부채널들의 전송속도를 높이고 결과적으로 전체 전송속도를 채널용량에 접근하게 한다. Waterfilling은 총 전력 제한을 만족하는 정확한 수면 높이를 찾는데 일반적으로 수면 높이를 추정하고 갱신해 나가는 반복적 알고리즘이 사용된다. 이 과정에서 부채널들에 대한 채널이득 제곱의 역수들의 부분합($\sum\limits_{n=1}^{Last}{\frac{N_0}{{\mid}h_n{\mid}^2}}$) 계산이 반복적으로 필요하다. 본 논문에서는 이런 부분합들을 초기화 단계에서 미리 계산하여 배열을 만들고 임의의 부분합 계산을 배열 참조로 대치함으로서 Waterfilling 알고리즘의 계산 시간을 줄였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권2호
• /
• pp.658-675
• /
• 2022

This paper presents a fast-simplified successive cancellation (SC) flipping (Fast-SSC-Flip) decoding algorithm for polar code. Firstly, by researching the probability distribution of the number of error bits in a node caused by channel noise in simplified-SC (SSC) decoder, a measurement criterion of node reliability is proposed. Under the guidance of the criterion, the most unreliable nodes are firstly located, then the unreliable bits are selected for flipping, so as to realize Fast-SSC-Flip decoding algorithm based on node reliability (NR-Fast-SSC-Flip). Secondly, we extended the proposed NR-Fast-SSC-Flip to multiple node (NR-Fast-SSC-Flip-ω) by considering dynamic update to measure node reliability, where ω is the order of flip-nodes set. The extended algorithm can correct the error bits in multiple nodes, and get good performance at medium and high signal-to-noise (SNR) region. Simulation results show that the proposed NR-Fast-SSC-Flip decoder can obtain 0.27dB and 0.17dB gains, respectively, compared with the traditional Fast-SSC-Flip [14] and the newly proposed two-bit-flipping Fast-SSC (Fast-SSC-2Flip-E2) [18] under the same conditions. Compared with the newly proposed partitioned Fast-SSC-Flip (PA-Fast-SSC-Flip) (s=4) [18], the proposed NR-Fast-SSC-Flip-ω (ω=2) decoder can obtain about 0.21dB gain, and the FER performance exceeds the cyclic-redundancy-check (CRC) aided SC-list (CRC-SCL) decoder (L=4).