• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권11호
• /
• pp.5394-5409
• /
• 2019

The paper investigates a novel detector receiver with Kalman channel information estimator and iterative channel response equalization for MIMO (multi-input multi-output) OFDM (orthogonal frequency division multiplexing) communication systems in fast multipath fading environments. The performances of the existing linear equalizers (LE) are not good enough over most fast fading multipath channels. The existing adaptive equalizer with decision feedback structure (ADFE) can improve the performance of LE. But error-propagation effect seriously degrades the system performance of the ADFE, especially when operated in fast multipath fading environments. By considering the Kalman channel impulse response estimation for the fast fading multipath channels based on CE-BEM (complex exponential basis expansion) model, the paper proposes the iterative receiver with soft decision feedback equalization (SDFE) structure in the fast multipath fading environments. The proposed SDFE detector receiver combats the error-propagation effect for fast multipath fading channels and outperform the existing LE and ADFE. We demonstrate several simulations to confirm the ability of the proposed iterative receiver over the existing receivers.

• ETRI Journal
• /
• 제29권2호
• /
• pp.143-152
• /
• 2007

In this paper, we propose a time-varying modified minimum mean-squared error (MMSE) detector for the detection of higher data rate signals in a multirate asynchronous code-division multiple-access (CDMA) system which is signaled in a fast Rayleigh fading channel. The interference viewed by a higher data rate symbol will be periodic due to the presence of a lower data rate symbol which spans multiple higher data rate symbols. The detection is carried out on the basis of a modified MMSE criterion which incorporates differential detection and the ratio of channel coefficients in two consecutive observation intervals inherently compensating the fast variation of the channel due to fading. The numerical results obtained by the MMSE detector with time-varying detection show around 3 dB (M=2) and 6 dB (M=4) performance improvement at a BER of $10^{-3}$ in the AWGN channel, while introducing more computational complexity than the MMSE detector without time-varying detection. At a higher $E_b/N_0$, the proposed scheme can achieve a BER of approximately $10^{-3}$ in the presence of fast channel variation which is an improvement over other schemes.

• Journal of Communications and Networks
• /
• 제11권5호
• /
• pp.473-479
• /
• 2009

Conventional frequency domain equalization (FDE) schemes were originally devised for quasi-static channels. Thus, such equalization schemes could suffer from significant performance degradation in fast-fading channels. This paper proposes a frequency domain equalization algorithm to mitigate the effect of fast time-varying fading. First, a mathematical expression is derived to quantify the total interference resulting from the time variation of the channel. Then, the proposed approach attempts to eliminate the effect of time-variations of the channel. This cancellation allows efficient use of the classical FDE structures in fast time-varying fading environments, although they are built upon the quasi-static channel model. Simulation results of bit-error-rate performance are provided to demonstrate the effectiveness of the proposed algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권6호
• /
• pp.2240-2254
• /
• 2021

We investigate the channel allocation problem in an ultra-dense device-to-device (D2D) enabled cellular network in underlaying mode where multiple D2D users are forced to share the same channel. Two kinds of low complexity solutions, which just require partial channel state information (CSI) exchange, are devised to resolve the combinatorial optimization problem with the quality of service (QoS) guaranteeing. We begin by sorting the cellular users equipment (CUEs) links in sequence in a matric of interference tolerance for ensuring the SINR requirement. Moreover, the interference quota of CUEs is regarded as one kind of communication resource. Multiple D2D candidates compete for the interference quota to establish spectrum sharing links. Then base station calculates the occupation of interference quota by D2D users with partial CSI such as the interference channel gain of D2D users and the channel gain of D2D themselves, and carries out the channel allocation by setting different access priorities distribution. In this paper, we proposed two novel fast matching algorithms utilize partial information rather than global CSI exchanging, which reduce the computation complexity. Numerical results reveal that, our proposed algorithms achieve outstanding performance than the contrast algorithms including Hungarian algorithm in terms of throughput, fairness and access rate. Specifically, the performance of our proposed channel allocation algorithm is more superior in ultra-dense D2D scenarios.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2004년도 학술대회지
• /
• pp.588-591
• /
• 2004

This paper describes a new approach to Internet host mobility. We argue that local mobility, the performance of existing mobile host protocol can be significantly improved. It proposes Fast Moving Detection scheme that based on neighbor AP channel information and moving detection table. And, it composes Local Area Clustering Path (LACP) domain that collected in AP's channel information and MN interface information. It stored the roaming table to include channel information and moving detection. Those which use the proposal scheme will need to put LACP information into the beacon or probe frame. Each AP uses scheme to inform available channel information to MN. From the simulation result, we show that the proposed scheme is advantageous over the legacy schemes in terms of the burst blocking probability and the link utilization.

• 방송공학회논문지
• /
• 제21권4호
• /
• pp.552-561
• /
• 2016

OFDM 시스템에서 심벌의 주파수 영역 반송파는 일반적으로 데이터 반송파와 분산 파일럿 반송파로 구성되고 수신기는 여러 심벌의 분산 파일럿 반송파를 시간축으로 보간하여 채널을 추정한다. 그러나 수신기가 고속으로 이동하는 경우에는 시간축 보간은 채널의 급속한 변화를 따라가지 못한다. 한편 시간축 보간을 하지 않고 매 심벌 채널 추정을 하면 고속 채널 추정은 가능하나 파일럿 반송파 개수가 충분하지 않아 다중 경로 지연이 큰 SFN 채널에서 채널 추정이 어렵다. 본 논문에서는 SFN 채널에서도 고속 채널 추정이 가능한 방법을 제안하고 이를 DVB-T 수신기에 적용하여 SFN 채널에서 도플러 이동 수신 성능이 향상되는 것을 보인다.

• Journal of information and communication convergence engineering
• /
• 제2권4호
• /
• pp.214-218
• /
• 2004

In this paper, we have analyzed TCP performance over wireless correlated fading links with and without Snoop protocol. For a given value of the packet error rate, TCP performance without Snoop protocol is degraded as the fading is getting fast (i.e. the user moves fast). When Snoop protocol is introduced in the base station, TCP performance is enhanced in most wireless environments. Especially the performance enhancement derived from using Snoop protocol is large in fast fading channel. This is because packet errors become random and sporadic in fast fading channel and these random packet errors (mostly single packet errors) can be compensated efficiently by Snoop protocol's local packet retransmissions. But Snoop protocol can't give a large performance improvement in slow fading environments where long bursts of packet errors occur. Concerning to packet error rate, Snoop protocol results in the highest performance enhancement in the channel with mid-high values of packet error rate. This means Snoop protocol cannot fully fulfill its ability under too low or too high packet error rate environments.

• 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.

• 한국통신학회논문지
• /
• 제37권1A호
• /
• pp.43-50
• /
• 2012

잡음이 존재하는 채널을 통하여 디지털 통신을 하는 경우 잡음으로 인한 오류를 검출, 정정하기 위하여 채널 부호화 기법이 사용된다. 채널 부호화 된 신호가 전송이 되었을 때 수신 측에서 채널 부호화 기법의 종류와 생성 파라미터를 알지 못한다면 신호의 복호는 어렵게 된다. 본 논문에서는 FHT(Fast Hadamard Transform)를 사용한 RM(Reed-Muller) 부호 파라미터 인식 알고리즘을 제안한다. 제안된 알고리즘은 FHT 결과 값의 특성을 이용하여 RM 부호를 판별하고 생성 파라미터를 추정한 후 복호를 수행한다. 또한 제안된 알고리즘을 AWGN 채널 환경에서 시뮬레이션을 통하여 검증한다.

• 한국통신학회논문지
• /
• 제25권8B호
• /
• pp.1383-1390
• /
• 2000

파일롯 심불 동기검파는 CDMA 시스템에서 사용자의 용량을 증대시키기 위해 사용된다 따라서 효과적인 검파를 위해서는 파일롯 심볼을 이용한 채널 추정 값으로 데이터 신호를 보상하여야 한다 이와 관련된 여러 가지 채널 추정 알고리즘들에 대해 많은연구가 이루어졌다 그러나 대부분의 채널 추정 알고리즘들은 여러 개의 타임슬롯을 이용 함으로서 고속 페이딩에 대해 성능열화를 가져온다. 본 논문에서는 고속 페이딩에 적합하고 저속 페이딩에서도 성능열화를 크게 일으키지 않는 채널 추정 알고리즘을 제시하였다 모의실험을 통해 본 논문에서 제시한 채널 추정 알고리즈은 고속 페이디에서 효율적이며 도플러 주파수 변화에 대한 성능의 민감도에 대해서도 강인성을 가지고 있음을 알 수 있었다.