• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.12
• /
• pp.34-41
• /
• 2008

In this paper, we present an asymptotical analysis of channel capacity of Bell labs layered space-time (BLAST) architectures based on a zero-forcing (ZF) criterion in the sense of signal-to-noise ratio (SNR). We begin by introducing a new relationship related to multi-input multi-output (MIMO) channel capacity. We prove that Diagonal Bell Labs Space-Time (DBLAST) attains the lower bound for MIMO channels when interference nulling is carried out based on the ZF-criterion. An exact closed-form expression for the probability density function of the channel capacity is analyzed. Based on the asymptotic behavior of the channel capacity of each layer, closed-form expressions for the asymptotic ergodic capacity are derived for BLAST. Based on the analysis presented in this paper, we gain an insight on the channel capacity behavior for a MIMO channel. Computer simulation results have verified the validity and accuracy of the proposed analysis for a wide range of antenna array sizes.

• 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.

• Journal of information and communication convergence engineering
• /
• v.10 no.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)
• /
• v.5 no.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)
• /
• v.5 no.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)
• /
• v.5 no.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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.8A
• /
• pp.768-776
• /
• 2010

In this paper, we consider a linear precoding for the effective spectrum sharing in multiple-input multiple-output (MIMO) cognitive radio system where a secondary user coexists with primary users. The secondary user employs the orthogonal space time block coding (OSTBC) at the transmitter. Assuming a flat fading channel and a maximum-likelihood receiver, the optimum precoder forces transmission referred to as eigen-beamforming. In this paper, to eliminate the interference, ZF criterion based eigen-beamforming is not only used but also the precoding weight is chosen to cancel the remaining interference. This weight is computed by vector's likelihood. Simulation results show stronger interference suppression capability, better SER performance, and higher capacity than the algorithm in [4].