• Title/Summary/Keyword: channel gain update

Search Result 6, Processing Time 0.028 seconds

Residual Synchronization Error Elimination in OFDM Baseband Receivers

  • Hu, Xingbo;Huang, Yumei;Hong, Zhiliang
    • ETRI Journal
    • /
    • v.29 no.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.

  • PDF

The Study on Nonlinear Compensation Characteristics of Multi-tap Update Algorithm in Broadband PCS Channel

  • Lee, Seung-Dae
    • Journal of the Korea Computer Industry Society
    • /
    • v.9 no.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.

  • PDF

Advanced Channel Estimation Method for IEEE 802.11p/WAVE System

  • Jang, DongSeon;Ko, Kyunbyoung
    • International Journal of Contents
    • /
    • v.15 no.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.

Performance of Iterative Soft Decision Feedback Equalizers for Single-Carrier Transmission

  • Jeon, Taehyun;Yoon, Seokhyun;Kim, Kyungho
    • Journal of Electrical Engineering and Technology
    • /
    • v.12 no.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.

Efficient Power Allocation Algorithm for Wireless Networks (무선망의 효율적 전력 할당 알고리즘)

  • Ahn, Hong-Young
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.16 no.1
    • /
    • pp.103-108
    • /
    • 2016
  • In communication systems the solution of the problem of maximizing the mutual information between the input and output of a channel composed of several subchannels under total power constraint has a waterfilling structure. OFDM and MIMO can be decomposed into parallel subchannels with CSI. Waterfilling solves the problem of optimal power allocation to these subchannels to achieve the rate approaching the channel capacity under total power constraint. In waterfilling, more power is alloted to good channels(high SNR) and less or no power to bad channels to increase the rate of good channels, resulting in channel capacity. Waterfilling finds the exact water level satisfying the power constraint employing an iterative algorithm to estimate and update the water level. In this process computation of partial sums of inverse of square of subchannel gain is repeatedly required. In this paper we reduced the computation time of waterfilling algorithm by replacing the partial sum computation with reference to an array which contains the precomputed partial sums in initialization phase.

Multiple Node Flip Fast-SSC Decoding Algorithm for Polar Codes Based on Node Reliability

  • Rui, Guo;Pei, Yang;Na, Ying;Lixin, Wang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.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).