• 한국통신학회논문지
• /
• 제34권4C호
• /
• pp.460-468
• /
• 2009

OFDM(Orthogonal Frequency Division Multiplexing)이 적용된 MIMO(Multiple-input Multiple-output) 기술은 추가적인 주파수 자원의 할당 없이 채널 용량을 증가시키기 위한 방법으로 주목 받고 있으나, MIMO-OFDM 수신단에서 다른 안테나로부터 동시에 전송된 독립적인 데이터 스트림을 분리할 수 있는 낮은 복잡도의 검출 알고리즘을 개발해야 하는 문제점이 있다. 이 논문에서 제안하는 ULBC QRD-M (Upper-Lower Bounded-Complexity QRD-M) 알고리즘은 최대 복잡도 즉, 복잡도의 상한(upper bound)을 기존의 QRD-M 알고리즘과 동일한 값으로 고정시킴으로써 SD(Sphere Decoding) 알고리즘에서 순시적으로 매우 높은 복잡도를 가지는 문제를 해결하는 동시에, 불필요한 Hypothesis를 제거하여 필요한 계산양을 현저하게 낮출 수 있는 장점이 있다. 분석과 모의실험 결과를 통하여 제안된 알고리즘이 기존의 QRD-M 알고리즘에 비하여 단지 26%의 계산양 만으로도 동일한 BER 성능을 가질 수 있음을 보인다.

• 한국통신학회논문지
• /
• 제30권7A호
• /
• pp.628-638
• /
• 2005

The analysis of maximum diversity order and coding gain for multiple-input multiple-output orthogonal frequency division multiplexing (MIMO-OFDM) systems over time-and frequency-selective (or doubly-selective) channels is addressed in this paper. A novel channel time-space correlation function is developed given the spatially correlated doubly-selective Rayleigh fading channel model. Based on this channel-model assumption, the upper-bound of pairwise error probability (PEP) for MIMO-OFDM systems is derived under the maximum likelihood (ML) detection. For a certain space-frequency code, we quantify the maximum diversity order and deduce the expression of coding gain. In this wort the impact of channel time selectivity is especially studied and a new definition of time diversity is illustrated correspondingly

• ETRI Journal
• /
• 제34권4호
• /
• pp.503-510
• /
• 2012

We analyze the relationship between channel coherence bandwidth and two complexity-reduced lattice reduction aided detection (LRAD) algorithms for multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems in correlated fading channels. In both the adaptive LR algorithm and the fixed interval LR algorithm, we exploit the inherent feature of unimodular transformation matrix P that remains the same for the adjacent highly correlated subcarriers. Complexity simulations demonstrate that the adaptive LR algorithm could eliminate up to approximately 90 percent of the multiplications and 95 percent of the divisions of the brute-force LR algorithm with large coherence bandwidth. The results also show that the adaptive algorithm with both optimum and globally suboptimum initial interval settings could significantly reduce the LR complexity, compared with the brute-force LR and fixed interval LR algorithms, while maintaining the system performance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제2권4호
• /
• pp.194-208
• /
• 2008

In this paper, a multiple-input-multiple-output (MIMO) hybrid-automatic repeat request (HARQ) algorithm with antenna scheduling is proposed. It retransmits the packet using scheduled transmit antennas according to the state of the communication link, instead of retransmitting the packet via the same antennas. As a result, a combination of conventional HARQ systems, viz. chase combining (CC) and incremental redundancy (IR) are used to achieve better performance and lower redundancy. The proposed MIMO-OFDM HARQ system with antenna scheduling is shown to be superior to conventional MIMO HARQ systems, due to its spatial diversity gain.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권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.

• 한국전자파학회논문지
• /
• 제27권1호
• /
• pp.27-32
• /
• 2016

본 논문에서는 다중 입출력 안테나 OFDM 통신시스템에서 가상 기준 신호(virtual pilot signal)를 사용하는 한 연판정 지향 채널 추정 기법을 제안한다. 기준 신호만을 이용하여 채널을 추정하는 기존 방식과 달리 제안하는 기법은 기준 신호와 데이터를 동시에 사용하여 채널을 추정한다. 또한, 제안하는 기법에서 채널을 추정하기 위해 사용할 데이터를 선택하는 알고리즘을 제안한다. 모의실험을 통해 제안하는 기법이 기존 채널 추정에 비해 향상된 성능을 갖는 것을 확인할 수 있다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권10호
• /
• pp.4738-4758
• /
• 2017

Resource allocation plays a crucial role in multiuser multiple input multiple output orthogonal frequency division multiplexing (MIMO-OFDM) systems to improve overall system performance. While previously proposed resource allocation algorithms are mainly designed from the point of view of the information-theoretic, we formulate the resource allocation problem as an average bit error rate (BER) minimization problem subject to a total power constraint when considering employing realistic MIMO detection techniques. Subsequently, we derive the optimal subcarrier and power allocation algorithms for three types of well-known MIMO detectors, including the maximum likelihood (ML) detector, linear detectors, and successive interference cancellation (SIC) detectors. To reduce the complexity, we also propose a two-step suboptimal algorithm that separates subcarrier and power allocation for each detector. We also analyze the diversity gain of the proposed suboptimal algorithms for various MIMO detectors. Simulation results confirm that the proposed suboptimal algorithm for each detector can achieve a comparable performance with the optimal allocation with a much lower complexity. Moreover, it is shown that the suboptimal algorithms perform better than the conventional algorithms that are known in the literature.

• 한국통신학회논문지
• /
• 제30권4A호
• /
• pp.296-303
• /
• 2005

본 논문에서는 기존의 한 개의 안테나를 가진 사용자에 $시\cdot공간$ 부호화된 두 개의 안테나를 가진 사용자가 추가되어 동일 채널을 공유할 경우 신호를 효과적으로 분리 및 검출할 수 있는 방법을 제안하고, 시스템 성능을 분석한다. 간섭 제거 방법을 적용하여 사용자를 구분하고 최대우도 방법을 통해 각 사용자 신호를 얻는 기법을 제안한다. 기존의 안테나 수가 같은 다중 사용자를 위한 신호 검출 방법인 최소평균제곱오차 방식이 안테나 수가 다른 MIMO 사용자의 경우 효과적으로 적용될 수 없는 단점을 설명하고 모의실험을 통해 확인한다. 또한 제안된 기법에 OFDM을 적용하여 시스템의 성능을 평가한다. 모의실험 결과 제안된 시스템의 단일 안테나 사용자는 기존의 단일 송수신 안테나를 가진 사용자의 성능과 유사하고 두 개의 안테나를 가진 MIMO 사용자의 경우 성능이 향상됨을 확인한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권6호
• /
• pp.2908-2924
• /
• 2019

Multiple input multiple output orthogonal frequency division multiplexing (MIMO-OFDM) is widely applied in wireless communication by virtue of its excellent properties in data transmission rate and transmission accuracy. However, as a major drawback of MIMO-OFDM systems, the high peak-to-average power ratio (PAPR) complicates the design of the power amplifier at the receiver end. Some available PAPR reduction methods such as selective mapping (SLM) suffer from high computational complexity. In this paper, a low-complexity SLM method based on active constellation extension (ACE) and joint space-time selective mapping (AST-SLM) for reducing PAPR in Alamouti STBC MIMO-OFDM systems is proposed. In SLM scheme, two IFFT operations are required for obtaining each transmission sequence pair, and the selected phase vector is transmitted as side information(SI). However, in the proposed AST-SLM method, only a few IFFT operations are required for generating all the transmission sequence pairs. The complexity of AST-SLM is at least 86% less than SLM. In addition, the SI needed in AST-SLM is at least 92.1% less than SLM by using the presented blind detection scheme to estimate SI. We show, analytically and with simulations, that AST-SLM can achieve significant performance of PAPR reduction and close performance of bit error rate (BER) compared to SLM scheme.

• ETRI Journal
• /
• 제35권3호
• /
• pp.371-377
• /
• 2013

An effective signal detection algorithm with low complexity is presented for multiple-input multiple-output orthogonal frequency division multiplexing systems. The proposed technique, QR-MLD, combines the conventional maximum likelihood detection (MLD) algorithm and the QR algorithm, resulting in much lower complexity compared to MLD. The proposed technique is compared with a similar algorithm, showing that the complexity of the proposed technique with T=1 is a 95% improvement over that of MLD, at the expense of about a 2-dB signal-to-noise-ratio (SNR) degradation for a bit error rate (BER) of $10^{-3}$. Additionally, with T=2, the proposed technique reduces the complexity by 73% for multiplications and 80% for additions and enhances the SNR performance about 1 dB for a BER of $10^{-3}$.