• The Journal of the Acoustical Society of Korea
• /
• 제21권3E호
• /
• pp.140-145
• /
• 2002

This paper introduces the downlink Eigen-beamformer with Space-Time Block Code (STBC)[1,2] employed on the MISO (Multiple Input Multiple Output) systems. The proposed scheme is acquired both transmit diversity gain from STBC and beamforming gain from Eigen-beamformer. In general, it is well described that the diversity gain be maximized when channel parameters associated to fingers are mutually independent. Major role of utilizing Eigen-beamformer is to enforce channel parameters being uncorrelated. According to this, the proposed STBC combined with Eigen-beamformer on the downlink significantly improves its performance under the spatially correlated channel. Simulation results are accomplished under three distinct channels conditioned with varying the degree of their correlations. The result indicates that our proposed scheme is good performance in spatially correlated channel.

• Journal of Communications and Networks
• /
• 제16권3호
• /
• pp.293-300
• /
• 2014

As energy harvesting communication systems emerge, there is a need for transmission schemes that dynamically adapt to the energy harvesting process. In this paper, after exhibiting a finite-horizon online throughput-maximizing scheduling problem formulation and the structure of its optimal solution within a dynamic programming formulation, a low complexity online scheduling policy is proposed. The policy exploits the existence of thresholds for choosing rate and power levels as a function of stored energy, harvest state and time until the end of the horizon. The policy, which is based on computing an expected threshold, performs close to optimal on a wide range of example energy harvest patterns. Moreover, it achieves higher throughput values for a given delay, than throughput-optimal online policies developed based on infinite-horizon formulations in recent literature. The solution is extended to include ergodic time-varying (fading) channels, and a corresponding low complexity policy is proposed and evaluated for this case as well.

• 한국통신학회논문지
• /
• 제23권6호
• /
• pp.1583-1591
• /
• 1998

이 논문에서는 시간을 따라 바뀌는 비동기 채널에서 안테나 배열을 쓸 때 유사 최대우도 검파기를 생각했다. 제안한 유사 최대우도 검파기는 먼저 빔을 만든 뒤 상관을 없앤다. 채널 매개변수를 추정하도록 역 여파 신호의 상관행렬 고유분해를 바탕으로 한 방법을 제안하였다. 제안한 알고리듬이 나쁜 전파환경에서도 적은 손실 안에서 채널벡터를 잘 추정하는 것을 모의실험으로 보였다.

• 제어로봇시스템학회논문지
• /
• 제18권8호
• /
• pp.768-773
• /
• 2012

Packet loss compensation techniques are increasingly important to stable remote control over wireless communication in WNCS (Wireless Networked Control Systems). Its time varying channels, limited bandwidth, interference, and poor signal not only leads to packet loss or latency, but also can negatively affect performance and system stability. This paper presents a compensation technique exploiting an EWMA (Exponentially Weighed Moving Average)-based value estimator to clarify the influence of packet loss on the overall WNCS behavior. As an example of actuator to be remotely controlled, a rotary-type inverted pendulum has been considered, and modeled. Performance evaluation results through Matlab/Simulink and Truetime co-simulation confirm the superiority of the proposed value estimation method over previous approaches.

• 융합신호처리학회 학술대회논문집
• /
• 한국신호처리시스템학회 2000년도 하계종합학술대회논문집
• /
• pp.69-72
• /
• 2000

Multilevel modulation schemes are known to be highly bandwidth efficient. By varying modulation level adaptively according to channel conditions (i.e. adaptive QAM schemes or AQAM), high bandwidth efficiency can be achieved. This paper considers the effect of time delay on the adaptive QAM schemes in dispersive fading channels. In order to undertake investigations effectively, a simulator has been developed. The simulation results show that the BER performance obtained for the wideband channel with a delay spread of 0.75 $\mu$sec is better than 10$^{-4}$ with a SNR value of 40 ㏈ and ABPS is found to be approximately 5.5.

• 한국통신학회논문지
• /
• 제32권3C호
• /
• pp.338-347
• /
• 2007

본 논문에서는 순환 보호 구긴(cyclic-prefix)을 사용하는 시공간 블록 부호 (STBC: Space-Time Block-Coding) 단일 반송파 시스템에서 향상된 채널 성능을 위한 가중된 블록 적응형 주파수 영역 채널 추정기를 제안한다. 제안된 채널 추정기 구조는 필터 입력 신호에 대해 STBC로 구성된 블록을 형성하며, 이후 형성된 입력 블록에 대해 사후 오차 (a posteriori error)를 이용하는 가중된 LS (least-square) 규준을 적용하여 알고리즘을 유도한다. 또한 정적 채널에서 steady-state EMSE (excess mean-square error) 분석을 통해 블록 길이가 늘어남에 따라 EMSE를 분석한다. 전산 모의실험에서는 시변 TU (typical urban) 채널에서 블록 길이를 증가시킬수록 제안한 채널 추정기는 기존 NLMS와 RLS 채널 추정기들 보다 우수한 성능을 나타냄을 확인 할 수 있다.

• Journal of Communications and Networks
• /
• 제6권1호
• /
• pp.9-18
• /
• 2004

Self-encoded multiple access (SEMA) is a unique realization of random spread spectrum. As the term implies, the spreading code is obtained from the random digital information source instead of the traditional pseudo noise (PN) code generators. The time-varying random codes can provide additional security in wireless communications. Multi-rate transmissions or multi-level grade of services are also easily implementable in SEMA. In this paper, we analyze the performance of SEMA in additive white Gaussian noise (AWGN) channels and Rayleigh fading channels. Differential encoding eliminates the BER effect of error propagations due to receiver detection errors. The performance of SEMA approaches the random spread spectrum discussed in literature at high signal to noise ratios. For performance improvement, we employ multiuser detection and Turbo coding. We consider a downlink synchronous system such as base station to mobile communication though the analysis can be extended to uplink communications.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권3호
• /
• pp.1416-1428
• /
• 2016

In this paper, we address the channel zapping time problem of video streaming services based on HTTP Live Streaming (HLS) on smart Over-The-Top Set-Top Boxes (OTT STBs). Experimental analysis of the channel zapping time, show that smart OTT STBs inevitably suffer from the accumulated zapping time through channel change request, Internet Group Management Protocol (IGMP) leave/join, synchronization delay, video buffer delay, and STB processing delay when providing HLS services. As a practical solution for the zapping time reduction, an adaptive buffering method is proposed. The proposed method exploits two adaptive buffers added to the basic HLS player. These two adaptive buffers are responsible for constantly buffering previous and next channels relative to the current channel. Implementation and test results show that a stable zapping time less than one second can be achieved even under diverse video bitrate changes and varying network conditions by the proposed adaptive buffering method.

• ETRI Journal
• /
• 제28권5호
• /
• pp.684-687
• /
• 2006

In this letter, we evaluate the system performance of a space-time block coded (STBC) multicarrier (MC) DS-CDMA system over a time selective fading channel, with imperfect channel knowledge. The average bit error rate impairment due to imperfect channel information is investigated by taking into account the effect of the STBC position. We consider two schemes: STBC after spreading and STBC before spreading in the MC DS-CDMA system. In the scheme with STBC after spreading, STBC is performed at the chip level; in the scheme with STBC before spreading, STBC is performed at the symbol level. We found that these two schemes have various channel estimation errors, and that the system with STBC before spreading is more sensitive to channel estimation than the system with STBC after spreading. Furthermore, derived results prove that a high spreading factor (SF) in the MC DS-CDMA system with STBC before spreading leads to high channel estimation error, whereas for a system with STBC after spreading this statement is not true.

• 한국통신학회논문지
• /
• 제35권6C호
• /
• pp.523-529
• /
• 2010

본 논문에서는 페이딩 채널의 시간 상관성을 이용한 Lattice Reduction(LR)기반 MIMO 수신기의 계산량을 효과적으로 감소시키는 새로운 기법을 제안한다. 시변 페이딩 채널 환경에서는 채널의 시간 상관 특성으로 인하여 LR을 통해 얻어진 P 행렬이 시간에 따라 크게 바뀌지 않는다. 이러한 특성을 이용하여 제안된 기법에서는 채널이 바뀔 때 마다 LR을 수행하는 것이 아니라 수신단에서 K개의 채널 프레임을 저장하여 K번째 채널, 즉 nK번째 (n=1,2,3..) 채널에서만 LR을 수행하여 P 행렬을 구한 후 (n-1)K번째 P 행렬과 비교한다. 두 개의 P 행렬이 동일한 경우 K-1개의 채널 프레임에서는 LR을 수행하지 않고 K번째 채널 프레임의 P 행렬을 그대로 사용하여 불필요한 계산량을 감소시켰다. 반대로 두 개의 P 행렬이 다른 경우 나머지 K-1개 채널 프레임의 P 행렬을 이전 채널 프레임에서 구한 P 행렬을 초기조건으로 하여 LR을 수행함으로써 계산량을 감소시킨다. 제안된 기법은 기존 LR 기법과 같은 성능을 유지하면서 계산량을 확연히 감소시킨다.