• 대한전자공학회논문지TC
• /
• 제45권12호
• /
• pp.34-41
• /
• 2008

본 논문에서는 신호 대 잡음 비의 관점에서 Zero-Forcing 기반의 BLAST(Bell Labs Layered Space-Time) 구조의 채널 capacity를 점근적으로 분석하고자 한다. MIMO 채널 capacity에 관한 새로운 관계를 소개하고, ZF에 기반한 간섭 무효화를 수행할 때 DBLAST(Diagonal BLAST)에 의해 MIMO 채널의 하한값에 이름을 증명한다. 채널 capacity의 확률 밀도 함수의 정확한 최종식을 분석하고, 각 계층의 채널 capacity의 점근적 현상에 기반한 점근적 ergodic capacity의 최종식을 BLAST에서 유도한다. 본 논문에서 다뤄진 분석에 의해 MIMO 채널의 capacity 현상에 대한 통찰할 수 있다. 모의 실험의 결과를 통해서, 본 논문에서 다뤄진 광범위한 안테나 배열 사이즈에 대한 분석의 타당성과 정확성을 보여주고자 한다.

• 한국통신학회논문지
• /
• 제32권7A호
• /
• pp.724-729
• /
• 2007

가산성 주기정상성 잡음이 있을 때 zero forcing (ZF) 기반에서의 송수신단 동시 최적화를 고려한다. 주기정상성 잡음의 주기는 심볼 전송율의 역수라고 가정하고 자기 상관함수는 양의 정부호로 가정한다. 전송되는 데이터 수열은 광의의정상성(WSS: wide-sense stationary)을 가지는 유색 확률과정으로 모델링 하고 채널은 주파수 선택적 충격 응답을 가지는 선형 시불변 시스템으로 모델링 한다. ZF와 송신 전력 제약 아래 평균제곱오차 (MSE: mean square error)를 최소화하는 최적 송수신 파형을 유도하고 모의 실험 결과를 통해 수신파형만 최적화 한 경우와 가산성 주기정상성 잡음을 정상성 잡음으로 간주한 경우 보다 성능이 더 좋아짐을 보인다.

• Journal of information and communication convergence engineering
• /
• 제10권3호
• /
• pp.215-219
• /
• 2012

This paper applies transmit antenna selection algorithms to spatial-temporal combining-based spatial multiplexing (SM) ultra-wideband (UWB) systems. The employed criterion is based on the largest minimum output signal-to-noise ratio of the multiplexed streams. It is shown via simulations that the bit error rate (BER) performance of the SM UWB systems based on the two-dimensional Rake receiver is significantly improved by antenna diversity through transmit antenna selection on a log-normal multipath fading channel. When the transmit antenna diversity through antenna selection is exploited in the SM UWB systems, the BER performance of the spatial-temporal combining-based zero-forcing (ZF) receiver is also compared with that of the ZF detector followed by the Rake receiver.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권12호
• /
• pp.2326-2339
• /
• 2011

To reduce the implementation complexity of the Vertical Bell Labs layered space-time (V-BLAST) systems with respect to the zero-forcing (ZF) criterion, a computationally efficient recursive algorithm is proposed. A fast implementation of the proposed algorithm is developed and its complexity is analyzed in detail. The proposed algorithm matches the ZF-OSIC detection well, and its three significant advantages can be demonstrated by analyses and simulations. Firstly, its speedups over the conventional ZF-OSIC with norm-based ordering, the original fast recursive algorithm (FRA) and the fastest known algorithm (FKA) in the number of flops are 1.58, 2.33 and 1.22, respectively. Secondly, a much simpler implementation than FRA and FKA can be expected. Finally, the storage requirements are lower than those of FRA and FKA. These advantages make the proposed algorithm more efficient and practical.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권3호
• /
• pp.494-507
• /
• 2011

In this paper, we propose two schemes to reduce the complexity of fixed-complexity sphere decoder (FSD) algorithm in the ordering and tree-search stages, respectively, while achieving quasi-ML performance. In the ordering stage, we propose a QR-decomposition-based FSD signal ordering based on the zero-forcing criterion (FSD-ZF-SQRD) that requires only a few number of additional complex flops compared to the unsorted QRD. Also, the proposed ordering algorithm is extended using the minimum mean square error (MMSE) criterion to achieve better performance. In the tree-search stage, we introduce a threshold-based complexity reduction approach for the FSD depending on the reliability of the signal with the largest noise amplification. Numerical results show that in 8 ${\times}$ 8 MIMO system, the proposed FSD-ZF-SQRD and FSD-MMSE-SQRD only require 19.5% and 26.3% of the computational efforts required by Hassibi's scheme, respectively. Moreover, a third threshold vector is outlined which can be used for high order modulation schemes. In 4 ${\times}$ 4 MIMO system using 16-QAM and 64-QAM, simulation results show that when the proposed threshold-based approach is employed, FSD requires only 62.86% and 53.67% of its full complexity, respectively.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권2호
• /
• pp.330-343
• /
• 2011

In this paper, we propose two schemes to reduce the complexity of fixed-complexity sphere decoder (FSD) algorithm in the ordering and tree-search stages, respectively, while achieving quasi-ML performance. In the ordering stage, we propose a QR-decomposition-based FSD signal ordering based on the zero-forcing criterion (FSD-ZF-SQRD) that requires only a few number of additional complex flops compared to the unsorted QRD. Also, the proposed ordering algorithm is extended using the minimum mean square error (MMSE) criterion to achieve better performance. In the tree-search stage, we introduce a threshold-based complexity reduction approach for the FSD depending on the reliability of the signal with the largest noise amplification. Numerical results show that in $8{\times}8$ MIMO system, the proposed FSD-ZF-SQRD and FSD-MMSE-SQRD only require 19.5% and 26.3% of the computational efforts required by Hassibi’s scheme, respectively. Moreover, a third threshold vector is outlined which can be used for high order modulation schemes. In $4{\times}4$ MIMO system using 16-QAM and 64-QAM, simulation results show that when the proposed threshold-based approach is employed, FSD requires only 62.86% and 53.67% of its full complexity, respectively.

• 한국통신학회논문지
• /
• 제35권8A호
• /
• pp.768-776
• /
• 2010

본 논문에서는 다중 안테나를 사용하는 인지무선 시스템과 허가된 사용자(주사용자)가 공존하는 환경을 고려한다. 여기에서 부사용자 송신기는 직교 시공간 부호(OSTBC)를 사용하고 수신기는 Maximum Likelihood(ML) 검출 방식을 사용한다. Flat 페이딩 채널에서 ML 검출기를 사용할 경우, 최적의 precoder는 고유 빔포밍 방법이다. 본 논문에서는 벡터의 유사성에 기반한 가중치를 적용하여 간섭을 최소화하는 선형 precoding 알고리즘을 제안한다. 시뮬레이션 결과를 통해 제안된 알고리즘이 기존의 ZF(Zero-forcing) 빔포밍보다 최소 2~8dB 우수한 간섭억압 능력을 보여 우수한 SER 성능과 최대 8bps/Hz의 Capacity 증가를 보이는 것으로 나타났다.