• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.12A
• /
• pp.1198-1204
• /
• 2006

In this paper, we extend SVR-MMSE detection scheme which is proposed in MIMO system to MIMO-OFDM system, and evaluate performance of the system in frequency selective fading channel. First of all, we explain about typical MIMO-OFDM system and detection scheme of constant modulus signals in this system. And compare proposed SVR-MMSE with Zero Forcing, Minimum Mean Square Error which is conventional detection scheme. we identify that the performance of the proposed system is shown different by varying doppler frequency in frequency selective fading channel using jakes channel model. The result of detection performance by the proposed SVR-MMSE in this simulation, it shows that proposed algorithm have a good performance in MIMO-OFDM systems.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.11
• /
• pp.2405-2411
• /
• 2009

MMSE, ZF and ML are the decoding mechanisms for V-BLAST system, and ML shows the best performance decoding the original signal among them. However, it has a problem that the computation complexity is increased exponentially according to the number of transmit antennas and transmit degrees. In this paper, we propose a low complexity linear ML detection algorithm having low computation complexity, then analyze the system performance in BER and computation complexity comparing with other algorithms. In the simulation, the BER performance of the proposed algorithm is superior than ZF and MMSE detection algorithms, and similar to ML detection algorithm. However, its computation complexity was 50% less than ML algorithm. From the results, we confirm that the proposed algorithm is superior than other ML detection algorithms.

• Journal of Communications and Networks
• /
• v.14 no.4
• /
• pp.352-363
• /
• 2012

In this paper, we study the role of cooperative relays to provide and improve secure communication rates through decodeand-forward (DF) strategies in a full-duplex multiple relay network with an eavesdropper. We consider the DF scheme as a basis for cooperation and propose several strategies that implement different versions of this scheme suited for cooperation with multiple relays. Our goal is to give an efficient cooperation paradigm based on the DF scheme to provide and improve secrecy in a multiple relay network. We first study the DF strategy for secrecy in a single relay network. We propose a suboptimal DF with zero forcing (DF/ZF) strategy for which we obtain the optimal power control policy. Next, we consider the multiple relay problem. We propose three different strategies based on DF/ZF and obtain their achievable secrecy rates. The first strategy is a single hop strategy whereas the other two strategies are multiple hop strategies. In the first strategy, we show that it is possible to eliminate all the relays' signals from the eavesdropper's observation (full ZF), however, the achievable secrecy rate is limited by the worst source-relay channel. Our second strategy overcomes the drawback of the first strategy, however, with the disadvantage of enabling partial ZF only. Our third strategy provides a reasonable compromise between the first two strategies. That is, in this strategy, full ZF is possible and the rate achieved does not suffer from the drawback of the first strategy. We conclude our study by a set of numerical results to illustrate the performance of each of the proposed strategies in terms of the achievable rates in different practical scenarios.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.6A
• /
• pp.577-582
• /
• 2008

In this paper, we present a scheme to overcome the worst case complexity of the sphere decoder. If the number of visited nodes reaches the threshold, the detected symbol vector is determined between two candidate symbol vectors. One candidate symbol vector is obtained from the demodulated output of ZF receiver which is initial stage of the sphere decoder. The other candidate symbol vector consists of two sub-symbol vectors. The first sub-symbol vector consists of lately visited nodes running from the most upper layer. The second one contains corresponding demodulated outputs of ZF receiver. Between these two candidate symbol vectors, the one with smaller euclidean distance to the received symbol vector is chosen as detected symbol vector. In addition, we show the upper bound of symbol error rate performance for the sphere decoder using the proposed scheme. In the simulation, the proposed scheme shows the significant reduction of the worst case complexity while having negligible SER performance degradation.

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

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.7A
• /
• pp.623-631
• /
• 2010

In this paper, various of pilot-assisted channel estimation techniques for 3GPP LTE downlink are tested under multipath Rayleigh fading channel. At first, the conventional channel estimation techniques are applied with linear zero-forcing (ZF) equalizer, such as one dimensional least square (1-D LS) linear interpolation, two dimensional (2-D) wiener filter, the time and frequency dimension separate wiener filter and maximum likelihood estimator (MLE). Considering the practical implementation, we proposed two channel estimation techniques by combining time-dimension wiener filter and MLE in two manners, which showed a good tradeoff between system performance and complexity when comparing with conventional techniques. The nonlinear decision feedback equalizer (DFE) which can show a better performance than linear ZF equalizer is also implemented for mitigating inter-carrier interference (ICI) in our system. The complexity of these algorithms are calculated in terms of the number of complex multiplications (CMs) and the performances are evaluated by showing the bit error rate (BER).

• 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.10 no.11
• /
• pp.5513-5529
• /
• 2016

Doppler Effect is a prominent obstacle in vehicular networks, which dramatically increase the Bit-Error-Rate (BER). This problem is accompanied with the presence of the Orthogonal Frequency Division Multiplexing (OFDM) systems in which the Doppler shift interrupts the subcarriers orthogonality. Additionally, Inter-Symbol Interference (ISI) and high Peak-to-Average Power Ratio (PAPR) are likely to occur which corrupt the received signal. In this paper, the single-carrier combined with the frequency domain equalizer (SC-FDE) is utilized as an alternative to the OFDM over the IEEE 802.11p uplink vehicular channels. The Minimum Mean Squared Error (MMSE) and Zero-Forcing (ZF) are employed in order to study the impact of these equalization techniques along with the SC-FDE on the propagation medium. In addition, we aim to enhance the BER, improve the transmitted signal quality and achieve ISI and PAPR mitigation. The proposed schemes are investigated and we found that the MMSE outperforms the ZF equalization under different Doppler shift effects and modulations.

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

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.18 no.2
• /
• pp.27-37
• /
• 2022

In this paper, we presents a Multiple User Multiple Input Multiple Output (MU-MIMO) test-bed system for Time Division Duplex (TDD) Long Term Evolution-Advanced (LTE-A). Using two parameters, the condition number of the channel matrix and the path gain, the MU-MIMO system could switch pre-coder to maintain target Bit Error Rate (BER) level. This paper also introduces a calibration procedure for compensating error of Radio Frequency (RF) paths of the antennas and RF transceivers. From experimental measurements, dynamic pre-coding scheme could maintain target BER, set to 10^-3, with the pre-coder set configured with Zero Forcing (ZF), Tomlinson Harashima Pre-coding (THP), Lattice Reduction (LR). The simplest pre-coder ZF is adopted in stable channel, and when path gain become less than 0.25, LR is adopted. Lastly, when condition number of channel matrix become larger than 7, THP is adopted.