• 제목/요약/키워드: iterative channel estimation algorithm

검색결과 25건 처리시간 0.027초

MIMO 통신 시스템에서 항재밍을 위한 반복적인 채널 추정 알고리즘 (Iterative Channel Estimation Algorithm for Anti-jamming in MIMO Communication Systems)

  • 정준희;황유민;차경현;이재생;신요안;김진영
    • 한국위성정보통신학회논문지
    • /
    • 제11권3호
    • /
    • pp.32-36
    • /
    • 2016
  • 무선 통신 시스템에서 재밍 공격은 통신 성능을 심각하게 저하시킬 수 있는 치명적 위협이다. 특히 반응 재밍은 송신기와 수신기가 통신할 때만 재밍할 수 있기 때문에 반응 재밍을 통해 공격 효율을 극대화할 수 있다. 본 논문에서 반응 재밍의 공격 효과를 저감시키기 위해 multi-input multi-output (MIMO) 기반의 orthogonal frequency-division multiplexing (OFDM) 통신 기술의 특징을 활용하고, 이에 기반한 반복적 채널 추정 알고리즘을 제안하였다. 실험 결과를 통해 본 논문에서 제안한 알고리즘과 기존 항재밍 알고리즘을 비교하였으며, 반응 재밍 공격이 있는 MIMO-OFDM 통신 시스템에서 제안한 알고리즘의 우수성을 입증한다.

Iterative Channel Estimation for MIMO-OFDM System in Fast Time-Varying Channels

  • Yang, Lihua;Yang, Longxiang;Liang, Yan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권9호
    • /
    • pp.4240-4258
    • /
    • 2016
  • A practical iterative channel estimation technique is proposed for the multiple-input-multiple-output orthogonal frequency division multiplexing (MIMO-OFDM) system in the high-speed mobile environment, such as high speed railway scenario. In the iterative algorithm, the Kalman filter and data detection are jointed to estimate the time-varying channel, where the detection error is considered as part of the noise in the Kalman recursion in each iteration to reduce the effect of the detection error propagation. Moreover, the employed Kalman filter is from the canonical state space model, which does not include the parameters of the autoregressive (AR) model, so the proposed method does not need to estimate the parameters of AR model, whose accuracy affects the convergence speed. Simulation results show that the proposed method is robust to the fast time-varying channel, and it can obtain more gains compared with the available methods.

Expectation-Maximization 기반의 새로운 OFDM 채널 추정 방식 (A Novel Expectation-Maximization based Channel Estimation for OFDM Systems)

  • 김남겸;손인수;신재호
    • 한국통신학회논문지
    • /
    • 제34권4C호
    • /
    • pp.397-402
    • /
    • 2009
  • 대용량의 데이터 전송을 위해 최근에 많이 사용되고 있는 OFDM 시스템은 다중경로페이딩에는 유리하지만 시간 선택성 페이딩에서는 자유롭지 못하고 이를 위해 채널추정이 필요하게 된다. 이를 위해 본 논문에서는 기존의 EM 알고리즘의 성능을 향상시키기 위해 LPC 알고리즘을 접목시킨 EM-LPC 알고리즘을 제안했다. 이 알고리즘은 기존의 EM 알고리즘의 M-Step 다음에 LPC 알고리즘을 사용하여 미리 다음 pilot 데이터를 추정할 수 있게된다. 또한 interpolation을 통한 데이터 수정도 가능하게 된다. 살펴본 결과 EM-LPC 알고리즘이 기존의 LS 알고리즘과 EM 알고리즘보다 좋은 성능을 내는 것을 볼 수 있었다. 또한 EM 루프의 반복도 역시 줄어드는 것을 볼 수 있었다.

Frequency Domain Channel Estimation for MIMO SC-FDMA Systems with CDM Pilots

  • Kim, Hyun-Myung;Kim, Dongsik;Kim, Tae-Kyoung;Im, Gi-Hong
    • Journal of Communications and Networks
    • /
    • 제16권4호
    • /
    • pp.447-457
    • /
    • 2014
  • In this paper, we investigate the frequency domain channel estimation for multiple-input multiple-output (MIMO) single-carrier frequency-division multiple-access (SC-FDMA) systems. In MIMO SC-FDMA, code-division multiplexed (CDM) pilots such as cyclic-shifted Zadoff-Chu sequences have been adopted for channel estimation. However, most frequency domain channel estimation schemes were developed based on frequency-division multiplexing of pilots. We first develop a channel estimation error model by using CDM pilots, and then analyze the mean-square error (MSE) of various minimum MSE (MMSE) frequency domain channel estimation techniques. We show that the cascaded one-dimensional robust MMSE (C1D-RMMSE) technique is complexity-efficient, but it suffers from performance degradation due to the channel correlation mismatch when compared to the two-dimensional MMSE (2D-MMSE) technique. To improve the performance of C1D-RMMSE, we design a robust iterative channel estimation (RITCE) with a frequency replacement (FR) algorithm. After deriving the MSE of iterative channel estimation, we optimize the FR algorithm in terms of the MSE. Then, a low-complexity adaptation method is proposed for practical MIMO SC-FDMA systems, wherein FR is performed according to the reliability of the data estimates. Simulation results show that the proposed RITCE technique effectively improves the performance of C1D-RMMSE, thus providing a better performance-complexity tradeoff than 2D-MMSE.

Iterative Channel Estimation for Higher Order Modulated STBC-OFDM Systems with Reduced Complexity

  • Basturk, Ilhan;Ozbek, Berna
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권6호
    • /
    • pp.2446-2462
    • /
    • 2016
  • In this paper, a frequency domain Expectation-Maximization (EM)-based channel estimation algorithm for Space Time Block Coded-Orthogonal Frequency Division Multiplexing (STBC-OFDM) systems is investigated to support higher data rate applications in wireless communications. The computational complexity of the frequency domain EM-based channel estimation is increased when higher order constellations are used because of the ascending size of the search set space. Thus, a search set reduction algorithm is proposed to decrease the complexity without sacrificing the system performance. The performance results of the proposed algorithm is obtained in terms of Bit Error Rate (BER) and Mean Square Error (MSE) for 16QAM and 64QAM modulation schemes.

Majorization-Minimization-Based Sparse Signal Recovery Method Using Prior Support and Amplitude Information for the Estimation of Time-varying Sparse Channels

  • Wang, Chen;Fang, Yong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제12권10호
    • /
    • pp.4835-4855
    • /
    • 2018
  • In this paper, we study the sparse signal recovery that uses information of both support and amplitude of the sparse signal. A convergent iterative algorithm for sparse signal recovery is developed using Majorization-Minimization-based Non-convex Optimization (MM-NcO). Furthermore, it is shown that, typically, the sparse signals that are recovered using the proposed iterative algorithm are not globally optimal and the performance of the iterative algorithm depends on the initial point. Therefore, a modified MM-NcO-based iterative algorithm is developed that uses prior information of both support and amplitude of the sparse signal to enhance recovery performance. Finally, the modified MM-NcO-based iterative algorithm is used to estimate the time-varying sparse wireless channels with temporal correlation. The numerical results show that the new algorithm performs better than related algorithms.

Receiver Techniques for Ultra-wide-band Multiuser Systems over Fading Multipath Channels

  • Zhou, Xiaobo;Wang, Xiaodong
    • Journal of Communications and Networks
    • /
    • 제5권2호
    • /
    • pp.167-173
    • /
    • 2003
  • We treat the problem of channel estimation and interference cancellation in multiuser ultra-wide-band (UWB) communication systems over multipath fading channels. The UWB system under consideration employs a random time-hopping impulse radio format. We develop a channel estimation method based on linear weighted algorithm. An iterative channel estimation and interference cancellation scheme is proposed to successively improve the receiver performance. We also consider systems employing multiple transmit and/or receive antennas. For systems with multiple receive antennas, we develop a diversity receiver for the wellseparated antennas. For systems with multiple transmit antennas, we propose to make use of Alamouti’s space-time transmission scheme, and develop the corresponding channel estimation and interference cancellation receiver techniques. Simulation results are provided to demonstrate the performance of various UWB receiver techniques developed in this paper.

수중 음향 채널에서 터보 복호기의 채널 신뢰도 추정에 관한 연구 (A study on channel reliability estimation of turbo decoder for underwater acoustic channel)

  • 정현우;정지원;김인수
    • 한국음향학회지
    • /
    • 제41권4호
    • /
    • pp.410-418
    • /
    • 2022
  • 터보 부호화 같은 반복 부호에서 채널 신뢰도 추정은 시변하는 수중 음향 채널에서 성능 향상을 위한 중요한 요소로서, 부정확한 채널 신뢰도 추정은 오히려 성능을 더욱 악화시킨다. 따라서 본 논문에서는 시변 수중 음향 채널에서 부호화율 1/3을 가지는 터보 부호화된 Frequency Shift Keying(FSK) 신호의 최적의 채널 신뢰도 추정 방식을 분석하였다. 추정(Estimation Bit Error Rate, E-BER) 알고리즘은 복호된 데이터를 재부호화시켜 수신된 신호와의 차이를 산정하는 방식이며, 채널 신뢰도의 변화에 따른 E-BER을 구하여 최적의 채널 신뢰도를 결정할 수 있다. 성능 분석을 위해 문경의 호수에서 거리 300 m ~ 500 m의 이동성 실험을 하였으며, 데이터를 복호하지 못하는 패킷에 대해 최적의 채널 신뢰도를 추정하여 적용한 결과, 모두 복호하였음을 확인하였다.

MIMO-OFDM 시스템을 위한 가상 기준 신호를 이용한 채널 추정 기법 (Channel Estimation Using Virtual Pilot Signal for MIMO-OFDM Systems)

  • 서희진;박선호;김진홍;심병효
    • 한국전자파학회논문지
    • /
    • 제27권1호
    • /
    • pp.27-32
    • /
    • 2016
  • 본 논문에서는 다중 입출력 안테나 OFDM 통신시스템에서 가상 기준 신호(virtual pilot signal)를 사용하는 한 연판정 지향 채널 추정 기법을 제안한다. 기준 신호만을 이용하여 채널을 추정하는 기존 방식과 달리 제안하는 기법은 기준 신호와 데이터를 동시에 사용하여 채널을 추정한다. 또한, 제안하는 기법에서 채널을 추정하기 위해 사용할 데이터를 선택하는 알고리즘을 제안한다. 모의실험을 통해 제안하는 기법이 기존 채널 추정에 비해 향상된 성능을 갖는 것을 확인할 수 있다.

Joint Blind Parameter Estimation of Non-cooperative High-Order Modulated PCMA Signals

  • Guo, Yiming;Peng, Hua;Fu, Jun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제12권10호
    • /
    • pp.4873-4888
    • /
    • 2018
  • A joint blind parameter estimation algorithm based on minimum channel stability function aimed at the non-cooperative high-order modulated paired carrier multiple access (PCMA) signals is proposed. The method, which uses hierarchical search to estimate time delay, amplitude and frequency offset and the estimation of phase offset, including finite ambiguity, is presented simultaneously based on the derivation of the channel stability function. In this work, the structure of hierarchical iterative processing is used to enhance the performance of the algorithm, and the improved algorithm is used to reduce complexity. Compared with existing data-aided algorithms, this algorithm does not require a priori information. Therefore, it has significant advantage in solving the problem of blind parameter estimation of non-cooperative high-order modulated PCMA signals. Simulation results show the performance of the proposed algorithm is similar to the modified Cramer-Rao bound (MCRB) when the signal-to-noise ratio is larger than 16 dB. The simulation results also verify the practicality of the proposed algorithm.