• Title/Summary/Keyword: Time-varying Channels

Search Result 136, Processing Time 0.031 seconds

A Frequency Domain Equalization Algorithm for Fast Time-Varying Fading Channels

  • Tran, Le-Nam;Hong, Een-Kee;Liu, Huaping
    • Journal of Communications and Networks
    • /
    • v.11 no.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.

Independent Component Analysis Based MIMO Transceiver With Improved Performance In Time Varying Wireless Channels

  • Uddin, Zahoor;Ahmad, Ayaz;Iqbal, Muhammad;Shah, Nadir
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.7
    • /
    • pp.2435-2453
    • /
    • 2015
  • Independent component analysis (ICA) is a signal processing technique used for un-mixing of the mixed recorded signals. In wireless communication, ICA is mainly used in multiple input multiple output (MIMO) systems. Most of the existing work regarding the ICA applications in MIMO systems assumed static or quasi static wireless channels. Performance of the ICA algorithms degrades in case of time varying wireless channels and is further degraded if the data block lengths are reduced to get the quasi stationarity. In this paper, we propose an ICA based MIMO transceiver that performs well in time varying wireless channels, even for smaller data blocks. Simulation is performed over quadrature amplitude modulated (QAM) signals. Results show that the proposed transceiver system outperforms the existing MIMO system utilizing the FastICA and the OBAICA algorithms in both the transceiver systems for time varying wireless channels. Performance improvement is observed for different data blocks lengths and signal to noise ratios (SNRs).

Beamforming for Downlink Multiuser MIMO Time-Varying Channels Based on Generalized Eigenvector Perturbation

  • Yu, Heejung;Lee, Sok-Kyu
    • ETRI Journal
    • /
    • v.34 no.6
    • /
    • pp.869-878
    • /
    • 2012
  • A beam design method based on signal-to-leakage-plus-noise ratio (SLNR) has been recently proposed as an effective scheme for multiuser multiple-input multiple-output downlink channels. It is shown that its solution, which maximizes the SLNR at a transmitter, can be simply obtained by the generalized eigenvectors corresponding to the dominant generalized eigenvalues of a pair of covariance matrices of a desired signal and interference leakage plus noise. Under time-varying channels, however, generalized eigendecomposition is required at each time step to design the optimal beam, and its level of complexity is too high to implement in practical systems. To overcome this problem, a predictive beam design method updating the beams according to channel variation is proposed. To this end, the perturbed generalized eigenvectors, which can be obtained by a perturbation theory without any iteration, are used. The performance of the method in terms of SLNR is analyzed and verified using numerical results.

Analysis on the Performance of $2{\times}1$ Alamouti Scheme in Time-varying and Spatially Correlated Channels (시변 및 공간 상관 채널 환경에서 $2{\times}1$ 알라마우티 구조 (Alamouti Scheme)의 성능 분석)

  • Lee, Eun-Ju;Park, Jae-Don;Yoon, Gi-Wan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2011.05a
    • /
    • pp.539-542
    • /
    • 2011
  • In this paper, we have implemented a performance analysis of $2{\times}1$ Alamouti scheme suggested by Alamouti, composed of the transmit space-time code and the simple linear decoding processing, in perfectly time-varying and spatially correlated channels. In addition, we derived the closed-form probability density function (PDF) of the output signal-to-noise ratio (SNR) and the outage probability of the Alamouti scheme as a function of the spatial correlation coefficient in the consideration of no correlation in time. As a result, it was found that the performance of the Alamouti scheme could be significantly degraded particularly in the case that the channels are time-varying and spatially correlated.

  • PDF

Channel Estimation and Detection Techniques for OFDM Systems in Time Varying Channels (OFDM 시스템에서의 시변 채널 추정 및 신호 검출)

  • 김형중;박정호;박병준;김지형;강창언;홍대식
    • Proceedings of the IEEK Conference
    • /
    • 2003.07a
    • /
    • pp.418-421
    • /
    • 2003
  • In this thesis, a new channel estimation technique is proposed for orthogonal frequency division multiplexing (OFDM) over time varying channels. The channel estimation algorithm exploits the fact that the estimated channel impulse response (CIR) by using pilot signal is the average value of the CIR variation within an OFDM symbol period. With this fact, the CIR variation is simply estimated through lowpass interpolation of the CIRs of the adjacent OFDM symbols. For signal detection, a time domain equalizer is used in this thesis. Simulation results show that the proposed system improves the bit error rate (BER) over time varying channels.

  • PDF

Energy-Efficient Scheduling with Delay Constraints in Time-Varying Uplink Channels

  • Kwon, Ho-Joong;Lee, Byeong-Gi
    • Journal of Communications and Networks
    • /
    • v.10 no.1
    • /
    • pp.28-37
    • /
    • 2008
  • In this paper, we investigate the problem of minimizing the average transmission power of users while guaranteeing the average delay constraints in time-varying uplink channels. We design a scheduler that selects a user for transmission and determines the transmission rate of the selected user based on the channel and backlog information of users. Since it requires prohibitively high computation complexity to determine an optimal scheduler for multi-user systems, we propose a low-complexity scheduling scheme that can achieve near-optimal performance. In this scheme, we reduce the complexity by decomposing the multiuser problem into multiple individual user problems. We arrange the probability of selecting each user such that it can be determined only by the information of the corresponding user and then optimize the transmission rate of each user independently. We solve the user problem by using a dynamic programming approach and analyze the upper and lower bounds of average transmission power and average delay, respectively. In addition, we investigate the effects of the user selection algorithm on the performance for different channel models. We show that a channel-adaptive user selection algorithm can improve the energy efficiency under uncorrelated channels but the gain is obtainable only for loose delay requirements in the case of correlated channels. Based on this, we propose a user selection algorithm that adapts itself to both the channel condition and the backlog level, which turns out to be energy-efficient over wide range of delay requirement regardless of the channel model.

Soft-Decision for Differential Amplify-and-Forward over Time-Varying Relaying Channel

  • Gao, Fengyue;Kong, Lei;Dong, Feihong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.3
    • /
    • pp.1131-1143
    • /
    • 2016
  • Differential detection schemes do not require any channel estimation, which can be employed under user mobility with low computational complexity. In this work, a soft-input soft-output (SISO) differential detection algorithm is proposed for amplify-and-forward (AF) over time-varying relaying channels based cooperative communications system. Furthermore, maximum-likelihood (ML) detector for M-ary differential Phase-shift keying (DPSK) is derived to calculate a posteriori probabilities (APP) of information bits. In addition, when the SISO is exploited in conjunction with channel decoding, iterative detection and decoding approach by exchanging extrinsic information with outer code is obtained. Finally, simulation results show that the proposed non-coherent approach improves detection performance significantly. In particular, the system can obtain greater performance gain under fast-fading channels.

Regularized LS Signal Detection for OFDM in Fast Time Varying Channels (고속 시변 채널 OFDM을 위한 안정화된 LS 신호검출)

  • Lim, Dongmin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.1
    • /
    • pp.83-85
    • /
    • 2016
  • The OFDM with LS signal detection performs worse in fast time varying channels as the channel matrix has higher chance of becoming ill-conditioned. Various regularization methods are applied to avoid performance degradation in LS signal detection. In this paper, we proposed a CGLS method with the stopping criteria imposed by the characteristics of the modulation method, which shows performance comparable to that of the optimal LMMSE.

On the Starvation Period of CDF-Based Scheduling over Markov Time-Varying Channels

  • Kim, Yoora
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.8
    • /
    • pp.924-927
    • /
    • 2016
  • In this paper, we consider a cumulative distribution function (CDF)-based opportunistic scheduling for downlink transmission in a cellular network consisting of a base station and multiple mobile stations. We present a closed-form formula for the average starvation period of each mobile station (i.e., the length of the time interval between two successive scheduling points of a mobile station) over Markov time-varying channels. Based on our formula, we investigate the starvation period of the CDF-based scheduling for various system parameters.

Optimal Power Allocation for Channel Estimation of OFDM Uplinks in Time-Varying Channels

  • Yao, Rugui;Liu, Yinsheng;Li, Geng;Xu, Juan
    • ETRI Journal
    • /
    • v.37 no.1
    • /
    • pp.11-20
    • /
    • 2015
  • This paper deals with optimal power allocation for channel estimation of orthogonal frequency-division multiplexing uplinks in time-varying channels. In the existing literature, the estimation of time-varying channel response in an uplink environment can be accomplished by estimating the corresponding channel parameters. Accordingly, the optimal power allocation studied in the literature has been in terms of minimizing the mean square error of the channel estimation. However, the final goal for channel estimation is to enable the application of coherent detection, which usually means high spectral efficiency. Therefore, it is more meaningful to optimize the power allocation in terms of capacity. In this paper, we investigate capacity with imperfect channel estimation. By exploiting the derived capacity expression, an optimal power allocation strategy is developed. With this developed power allocation strategy, improved performance can be observed, as demonstrated by the numerical results.