• Title/Summary/Keyword: Zero Forcing(ZF)

Search Result 92, Processing Time 0.026 seconds

Performance of Equalizer Schemes in Power Line Communication Systems for Automatic Metering Reading (자동 원격검침을 위한 전력선 통신 시스템에서의 등화 기법 연구)

  • Kim, Yo-cheol;Bae, Jung-Nam;Kim, Jin-Young
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.11 no.1
    • /
    • pp.29-34
    • /
    • 2011
  • In this paper, we propose and analyze the equalizer schemes, zero-forcing (ZF) and minimum mean square error (MMSE) in power line communication (PLC) system for automatic meter reading (AMR). For efficient implementation of AMR system with PLC, effects of impulsive noise and multipath channel should be mitigated. To overcome these effects, the above equalizer schemes are employed. System performance is evaluated in term of bit error rate. From simulation results, it is confirmed that the equalizer can significantly improve bit error rate (BER) performance in PLC system, and MMSE equalizer provides better performance than ZF scheme. The results of this paper can be applied to AMR system as well as various smart grid services using PLC.

Performance Analysis of DCMP and ZF based on Spatial Channel Response Estimation by ESPRIT (ESPRIT에 의한 공간 채널응답 추정치에 기초를 둔 방향구속 전력 최소화법과 제로포싱 알고리즘의 성능평가)

  • 정중식;임정빈;안영섭
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • 2002.11a
    • /
    • pp.169-174
    • /
    • 2002
  • It has known that the DCMP(Directionally Constrained Minimization of power)and the ZF(Zero Forcing) can improve the SINR performance of an array antenna system by using spatial signature of wireless channel. This paper analyzes performance of DCMP and ZF in multiple scattering environments. To obtain the spatial signature of wireless channel. bothe DOA(Directional of Arrival) and AS(Angular Spread) of the received signals were estimated by using ESPRIT. The performance of the DCMP and the ZF was analyzed theoretically. Through computer simulation, the SINR performance were evaluated.

  • PDF

MIMO 시스템에서 Zero-forcing 검파 결과의 검증 기법에 관한 연구

  • Jeon, Hyeong-Gu
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2007.10a
    • /
    • pp.842-846
    • /
    • 2007
  • Zero Forcing (ZF) 검파 결과는 신호 대 잡음 환경이 양호한 경우 약 80% 이상이 Maximum Likelihood (ML) 검파 결과와 일치한다. 간단한 검증기를 통해 ZF 검파 결과가 ML 검파 결과와 일치하는지 알 수 있다면 검증 결과에 따라 복잡한 ML 검파 과정이나 별도의 검색 과정을 생략할 수 있다. 본 논문에서는 multiple input multiple output (MIMO) 시스템에서 ZF 검파 결과에 대한 검증 방식을 제안하였다. 제안된 검증 방식은 ZF 검파 결과를 이용하여 MIMO 신호를 single input multiple output (SIMO) 신호로 변환한 후 검파를 수행하면 안테나 다이버시티 이득을 얻을 수 있고 잡음 분산이 줄어드는 효과를 이용하였다. 제안된 검증기는 컴퓨터 시뮬레이션 결과 신호 대 잡음이 양호한 경우 80%이상의 정확한 true 판정 확률을 얻었으며 이때 false 판정 확률은 $10^{-4}$이하를 보였다.

  • PDF

Performance Analysis of LR-aided ZF Receiver for MIMO Systems

  • Kim, Sangchoon
    • International journal of advanced smart convergence
    • /
    • v.7 no.3
    • /
    • pp.37-43
    • /
    • 2018
  • Lattice-reduction (LR) techniques have been developed for signal detection in spatial multiplexing multiple input multiple output (MIMO) systems to obtain the largest diversity gain. Thus, an LR-assisted zero-forcing (ZF) receiver can achieve the maximum diversity gain in spatial multiplexing MIMO systems. In this paper, a simplified analysis of the achievable diversity gain is presented by fitting the channel coefficients lattice-reduced by a complex Lenstra-Lenstra-$Lov{\acute{a}}z$ (LLL) algorithm into approximated Gaussian random variables. It will be shown that the maximum diversity gain corresponding to two times the number of receive antennas can be achieved by the LR-based ZF detector. In addition, the approximated bit error rate (BER) expression is also derived. Finally, the analytical BER performance is comparatively studied with the simulated results.

Joint Tx-Rx Optimization in Additive Cyclostationary Noise with Zero Forcing Criterion (가산성 주기정상성 잡음이 있을 때 Zero Forcing 기반에서의 송수신단 동시 최적화)

  • Yun, Yeo-Hun;Cho, Joon-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.7A
    • /
    • pp.724-729
    • /
    • 2007
  • In this paper, we consider a joint optimization of transmitter and receiver in additive cyclostationary noise with zero forcing criterion. We assume that the period of the cyclostationary noise is the same as the inverse of the symbol transmission rate and that the noise has a positive-definite autocorrelation function. The data sequence is modeled as a wide-sense stationary colored random process and the channel is modeled as a linear time-invariant system with a frequency selective impulse response. Under these assumptions and a constraint on the average power of the transmitted signal, we derive the optimum transmitter and receiver waveforms that jointly minimizes the mean square error with no intersymbol interference. The simulation results show that the proposed system has a better BER performance than the systems with receiver only optimization and the systems with no transmitter and receiver optimization.

On the Performance of Zero-Forcing Beamforming with Semi-orthogonal User Selection in Clustered Cell Coordinated Transmission (제로 포싱 (zero-forcing) 빔 형성과 반직교 기반 사용자 선정을 이용한 클러스터 (cluster) 기반 셀 협력 전송 방식의 성능에 대한 연구)

  • Yang, Jang-Hoon;Jang, Seung-Hun;Kim, Dong-Ku
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.45 no.10
    • /
    • pp.1-9
    • /
    • 2008
  • In this paper, a simple and efficient three cell based clustered-cell coordination is proposed with well hewn zero-forcing beamforming (ZF-BF) with a semi-orthogonal user selection (SUS) as transmission and scheduling scheme. For a modified Wyner's channel model with two classes of user groups for a hexagonal cellular system, the upper bound of asymptotic sum rate scaling of ZF-BF in a proposed coordination is shown to be proportional to the number of transmit antennas and double logarithms of the number of users. The numerical results verify the efficiency of the proposed cell coordination. It is also numerically shown that ZF-BF with the SUS in CCCT actually achieves the upper bound of asymptotic sum rate sum rate scaling.

An MCS Level Adaptive Linear Receiver (MCS 레벨에 따른 적응 선형 수신기)

  • Lee, Kyuhee;Kim, Jaekwon;Yun, Sangkyun
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.2 no.1
    • /
    • pp.59-64
    • /
    • 2009
  • In this paper, a novel low complexity linear receiver is proposed that is used at the receiver of MIMO systems. Zero-forcing (ZF) and minimum mean squared error (MMSE) receivers are common linear receivers. ZF receiver is simpler than MMSE receiver from the hardware implementation perspective, howerver, MMSE shows better performance than ZF. In general, MCS level changes according to channel condition. This paper shows the benefit of choosing between MMSE and ZF according to the selected MCS level. We implement the MCS-adaptive linear receiver as hardware, and show that its complexity is comparable to the conventional MMSE receiver.

  • PDF

Prior Maximum Likelihood Detection Verifier Design in MIMO Receivers (MIMO 수신기에서 사전 Maximum Likelihood 검파 검증기 설계)

  • Jeon, Hyoung-Goo;Bae, Jin-Ho;Lee, Dong-Hoon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.11A
    • /
    • pp.1063-1071
    • /
    • 2008
  • This paper proposes a prior maximum likelihood (ML) detection verifier which has an ability to verify if the zero forcing (ZF) detection results are identical to the ML detection results. Since more than 90% of ZF detection results are identical to ML detection results, the proposed verifier makes it possible to omit the computationally complex ML detection in 90% cases of MIMO signal detections. The proposed verifier is designed by using the diversity gain obtained from converting MIMO signal into single input multiple output (SIMO) signals. In the proposed method, single input multiple output (SIMO) signals for each transmit antenna are separated from MIMO signals after the MIMO signals are detected by ZF method. Computer simulations show that the true alarm probability of the proposed verifier is more than 80% and the false alarm probability is less than $10^{-4}$.

Recursive Nullspace Calculation for Multiuser MIMO Systems (다중 사용자 MIMO 시스템을 위한 순차적 영공간 계산)

  • Joung, Jin-Gon;Lee, Yong-Hoon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.12A
    • /
    • pp.1238-1243
    • /
    • 2007
  • The computational complexity for the zero-forcing (ZF)-based multiuser (MU) multiple-input multiple-output(MIMO) preprocessing matrices can be immoderately large as the number of transmit antennas or users increases. In this paper, we show that the span of singular vector space of a matrix can be obtained from the singular vectors of the parted rows of that matrix with computational saving and propose a computationally efficient recursive-algorithm for achieving the ZF-based preprocessing matrices. Analysis about the complexities shows that a new recursive-algorithm can lighten the computational load.

Two New Types of Candidate Symbol Sorting Schemes for Complexity Reduction of a Sphere Decoder

  • Jeon, Eun-Sung;Kim, Yo-Han;Kim, Dong-Ku
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.9C
    • /
    • pp.888-894
    • /
    • 2007
  • The computational complexity of a sphere decoder (SD) is conventionally reduced by decoding order scheme which sorts candidate symbols in the ascending order of the Euclidean distance from the output of a zero-forcing (ZF) receiver. However, since the ZF output may not be a reliable sorting reference, we propose two types of sorting schemes to allow faster decoding. The first is to use the newly found lattice points in the previous search round instead of the ZF output (Type I). Since these lattice points are closer to the received signal than the ZF output, they can serve as a more reliable sorting reference for finding the maximum likelihood (ML) solution. The second sorting scheme is to sort candidate symbols in descending order according to the number of candidate symbols in the following layer, which are called child symbols (Type II). These two proposed sorting schemes can be combined with layer sorting for more complexity reduction. Through simulation, the Type I and Type II sorting schemes were found to provide 12% and 20% complexity reduction respectively over conventional sorting schemes. When they are combined with layer sorting, Type I and Type II provide an additional 10-15% complexity reduction while maintaining detection performance.