• Title/Summary/Keyword: Time-varying Channel

Search Result 280, Processing Time 0.025 seconds

Performance analysis of packet transmission for a Signal Flow Graph based time-varying channel over a Wireless Network (무선 네트워크 time-varying 채널 상에서 Signal Flow Graph를 이용한 패킷 전송 성능 분석)

  • Kim, Sang-Yang;Park, Hong-Seong
    • Proceedings of the KIEE Conference
    • /
    • 2004.05a
    • /
    • pp.65-67
    • /
    • 2004
  • Change of state of Channel between two wireless terminals which is caused by noise and multiple environmental conditions for happens frequently from the Wireles Network. So, When it is like that planning a wireless network protocol or performance analysis, it follows to change of state of time-varying channel and packet the analysis against a transmission efficiency is necessary. In this paper, analyzes transmission time of a packet and a packet in a time-varying and packet based Wireless Network. To reflecte the feature of the time-varying channel, we use a Signal Flow Graph model. From the model the mean of transmission time and the mean of queue length of the packet are analyzed in terms of the packet distribution function, the packet transmission service time, and the PER of the time-varying channel.

  • PDF

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.

Sum rate and Energy Efficiency of Massive MIMO Downlink with Channel Aging in Time Varying Ricean Fading Channel

  • Yang, Lihua;Yang, Longxiang;Zhu, Hongbo;Liang, Yan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.3
    • /
    • pp.1098-1112
    • /
    • 2018
  • Achievable sum rate and energy efficiency (EE) are investigated for the massive multiple-input multiple-output (Massive MIMO) downlink with channel aging in the time varying Ricean fading channel. Specifically, the expression of the achievable sum rate of the system for the maximum ratio transmission (MRT) precoder with aged channel state information (CSI) in the time varying Ricean fading channel is first presented. Based on the expression, the effect of both channel aging and the Ricean factor on the power scaling law are studied. It is found that the transmit power of base station (BS) is scaled down by $1/{\sqrt{M}}$(where M is the number of the BS antennas) when the Ricean factor K is equal to zero (i.e., time varying Rayleigh fading channel), indicating that aged CSI does not affect the power scaling law. However, the transmit power of the BS is scaled down by 1/M for the time varying Ricean fading channel (where $K{\neq}0$) indicating that the Ricean factor affects the power scaling law and sum rate, and channel aging only leads to a reduction of the sum rate. Second, the EE of the system is analyzed based on the general power consumption model. Both the theoretical analysis and the simulations show that the channel aging could degrade the sum rate and the EE of the system, and it does not affect the power scaling law.

Optimal Packet Scheduling for Energy Harvesting Sources on Time Varying Wireless Channels

  • Kashef, Mohamed;Ephremides, Anthony
    • Journal of Communications and Networks
    • /
    • v.14 no.2
    • /
    • pp.121-129
    • /
    • 2012
  • In this paper, we consider a source node that operates over a time varying channel with energy harvesting capability. The goal of the source is to maximize the average number of successfully delivered packets per time slot. The source is able to choose whether to transmit a packet or defer the transmission in each time slot. The decision which is chosen by the source depends on the channel information available and the length of the energy queue. We formulate the problem of finding the optimal policy as a Markovian decision problem. We show some properties of the value function that represents the discounted number of successfully delivered packets per time slot. We prove that the optimal policy is a threshold type policy depending on the state of the channel and the length of the energy queue. We also derive an upper bound for the average number of packets per time slots successfully received by the destination. We show using numerical results that this bound is a tight bound on the performance of the optimal policy. And we consider the case of time varying channel but without channel state information (CSI). Then, we study the impact of channel time varying nature and the availability of CSI. In this case, we show that the optimal policy is a greedy policy. The performance of this greedy policy is also calculated.

A Time-Varying Modified MMSE Detector for Multirate CDMA Signals in Fast Rayleigh Fading Channels

  • Jeong, Kil-Soo;Yokoyama, Mitsuo;Uehara, Hideyuki
    • ETRI Journal
    • /
    • v.29 no.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.

  • PDF

Performance analysis of packet transmission for a Signal Flow Graph based time-varying channel over a Wireless Network (무선 네트워크 시변(time-varying) 채널에서 SFG (Signal Flow Graph)를 이용한 패킷 전송 성능 분석)

  • Kim Sang Yong;Park Hong Seong;Oh Hoon;LI Vitaly
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.42 no.2 s.332
    • /
    • pp.23-38
    • /
    • 2005
  • The state of channel between two or more wireless terminals is changed frequently due to noise or multiple environmental conditions in wireless network. In this paper, we analyze packet transmission time and queue length in a time-varying channel of packet based Wireless Networks. To reflect the feature of the time-varying channel, we model the channel as two-state Markov model and three-state Markov model Which are transformed to SFG(Signal Flow Graph) model, and then the distribution of the packet transmission can be modeled as Gaussian distribution. If the packet is arrived with Poisson distribution, then the packet transmission system is modeled as M/G/1. The average transmission time and the average queue length are analyzed in the time-varying channel, and are verified with some simulations.

Pilot Symbol Assisted Low Complexity LS Channel Estimation for OFDM in Fast Time Varying Channels (고속 시변 채널 OFDM을 위한 파일럿 심볼을 이용한 저복잡도 LS 채널 예측)

  • Lim, Dong-Min
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.48 no.11
    • /
    • pp.17-21
    • /
    • 2011
  • In this paper, we propose a pilot symbol assisted low complexity LS channel estimation method for OFDM in fast time varying channels. The proposed method shows low complexity characteristics in terms of memory space and processing time compared with conventional BEM channel model LS estimation methods.

An Equalization Technique for OFDM and MC-CDMA in a Slowly Time-Varying Multipath Fading Channel (시변 다중 경로 페이딩 채널에서 OFDM, MC-CDMA의 등화 기법)

  • 최종호;조용수
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 1996.06a
    • /
    • pp.3-7
    • /
    • 1996
  • In this paper, the performances of OFDM and MC-CDMA systems in a slowly-varying multipath fading environment is investigated. Time variation of the multipath channel leads to both a change of an optimal coefficient in one-tap equalizer and a loss of subchannel orthogornality, resulting in significant performance loss. A new simple one-tap equalizer which can reduce the effect of slowly time-varying multipath channel is proposed by taking into account time-variation of multipath profile and modifying the previous equalization techniques. It is demonstrated by computer simulation that the performances of OFDM and MC-CDMA systems can be improved by using the proposed one-tap equalizers when the multipath channel is slowly varying.

  • PDF

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.

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)
    • /
    • v.10 no.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.