• Journal of Communications and Networks
• /
• v.7 no.3
• /
• pp.307-312
• /
• 2005

In this work, we study the performance of a serial concatenated scheme comprising a convolutional code (CC) and an orthogonal space-time block code (STBC) separated by an inter-leaver. Specifically, we derive performance bounds for this concatenated scheme, clearly quantify the impact of using a CC in conjunction with a STBC, and compare that to using a STBC code only. Furthermore, we examine the impact of performing antenna selection at the receiver on the diversity order and coding gain of the system. In performing antenna selection, we adopt a selection criterion that is based on maximizing the instantaneous signal-to­noise ratio (SNR) at the receiver. That is, we select a subset of the available receive antennas that maximizes the received SNR. Two channel models are considered in this study: Fast fading and quasi-static fading. For both cases, our analyses show that substantial coding gains can be achieved, which is confirmed through Monte-Carlo simulations. We demonstrate that the spatial diversity is maintained for all cases, whereas the coding gain deteriorates by no more than $10\;log_{10}$ (M / L) dB, all relative to the full complexity multiple-input multiple-output (MIMO) system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.8C
• /
• pp.771-776
• /
• 2006

We present a suboptimum decoding method for space-time trellis codes, which include maximum $likelihood(ML)^{[1]}$ and principal ratio $combining(PRC)^{[2]}$, over quasi-static flat fading channels. In the proposed scheme, the receive antennas are divided into K groups and the PRC is applied to each group, showing a flexible performances between ML and PRC. When K is determined, we also propose the optimum grouping rules and performance index(PI), which simply anticipate the relative performances. Moreover the performances are also evaluated when receive antennas are correlated. Finally, Computer simulations corroborate those theoretical results.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.83-86
• /
• 2007

In the blind Maximum-likelihood (ML) detection for Orthogonal Space-Time Block Codes (OSTBC), the problem of ambiguity in determining the symbols has been a great concern. A solution to this problem is to apply semi-blind ML detection, i.e., the blind ML decoding with pilot symbols or training sequence. In order to increase the performance, the number of pilot symbols or length of training sequence should be increased. Unfortunately, this leads to a significant decrease in system spectral efficiency. This work presents an approach to resolve the aforementioned issue by introducing a new method for constructing transmitted information symbol. Thus, by transmitting information symbols drawn from different modulation constellation, the ambiguity can be easily eliminated in blind detection. Also, computer simulations are implemented to verify the performance of the proposed approach.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.9 no.1
• /
• pp.34-41
• /
• 2010

In this paper, we analyze and simulate co-channel interference (CCI) mitigation method for cooperative communication systems employing decode-and-forward relays. In co-channel interference mitigation method, A source transmits signals that are encoded by orthogonal code. Then, the receiver can distinguish its own signals form the received signals by using the orthogonal code which is already known to the receiver. The orthogonal codes applied to this paper are orthogonal Gold codes. However, we can employ other codes, which have orthogonality, as the orthogonal code. In addition, we utilize a space time block coding (STBC) scheme for enhancing the system performance by obtaining additional array gain.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.567-571
• /
• 2008

In this paper, an overview on the ordering sphere decoder (SD) class for space-time codes (STC) will be presented. In SDs, the ordering techniques are considered as promising methods for reducing complexity by exploiting a sorted list of candidates, thus decreasing the number of tested points. First, we will present the current state of art of SD with their advantages and disadvantages. Then, the overview of simply geometrical approaches for ordering is presented to address the question to overcome the disadvantages. The computer simulation results shown that, thanks to the aid of ordering, the ordering SDs can achieve optimal bit-error-rate (BER) performance while requiring the very low complexity, which is comparable to that of linear sub-optimal decoders.

• Journal of information and communication convergence engineering
• /
• v.6 no.3
• /
• pp.261-265
• /
• 2008

This work presents a simplified efficient blind detection algorithm for orthogonal space-time codes(OSTBC). First, the proposed decoder exploits a proper decomposition approach of the upper triangular matrix R, which resulted from Cholesky-factorization of the composition channel matrix, to form an easy-to-solve blind detection equation. Secondly, in order to avoid suffering from the high computational load, the proposed decoder applies a sub-optimal QR-based decoder. Computer simulation results verify that the proposed decoder allows to significantly reduce computational complexity while still satisfying the bit-error-rate(BER) performance.

• Journal of IKEEE
• /
• v.11 no.4
• /
• pp.340-347
• /
• 2007

This paper proposes a new class of Space-Time Block Codes, which is manipulated from the existing transmit diversity schemes. We analyze the performance and the receiver complexity of the proposed scheme and confirm that the new diversity scheme can yield performance gain over other existing four-transmit antenna cases. By relaxing the diversity criterion on code designs, the proposed space-time code provides a full transmission rate for four-transmit antennas and makes it possible to approach the open-loop Shannon channel capacity. Outage capacity and simulation results are used to show that substantial improvements in performance while maintaining a simple linear processing receiver structure are obtained in frequency selective channels.

• Journal of Communications and Networks
• /
• v.13 no.3
• /
• pp.257-265
• /
• 2011

In this paper, a cooperative relaying protocol called soft-decision-and-forward (SDF) with multiple antennas in each node is introduced. SDF protocol exploits the soft decision source symbol values from the received signal at the relay node. For orthogonal transmission (OT), orthogonal codes including Alamouti code are used and for non-orthogonal transmission (NT), distributed space-time codes are designed by using a quasi-orthogonal space-time block code. The optimal maximum likelihood (ML) decoders for the proposed protocol with low decoding complexity are proposed. For OT, the ML decoders are derived as symbolwise decoders while for NT, the ML decoders are derived as pairwise decoders. It can be seen through simulations that SDF protocol outperforms AF protocol for both OT and NT.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.2A
• /
• pp.100-107
• /
• 2011

Algorithms based on the QR decomposition of the equivalent space-time channel matrix have been proved useful in the detection of V-BLAST systems. Especially, the parallel detection (PD) algorithm offers ML approaching performance up to 4 transmit antennas with reasonable complexity. We show that when directly applied to STBCs, the PD algorithm may suffer a rather significant SNR degradation over ML detection, especially at high SNRs. However, simply extending the PD algorithm to allow p ${\geq}$ 2 candidate layers, i.e. p-PD, regains almost all the loss but only at a significant increase in complexity. Here, we propose a simplification to the p-PD algorithm specific to STBCs without a corresponding sacrifice in performance. The proposed algorithm results in significant complexity reductions for moderate to high order modulations.

• ETRI Journal
• /
• v.26 no.5
• /
• pp.443-451
• /
• 2004

Since the publication of Alamouti's famous space-time block code, various quasi-orthogonal space-time block codes (QSTBC) for multi-input multi-output (MIMO) fading channels for more than two transmit antennas have been proposed. It has been shown that these codes cannot achieve full diversity at full rate. In this paper, we present a simple feedback scheme for rich scattering (flat Rayleigh fading) MIMO channels that improves the coding gain and diversity of a QSTBC for 2$^n$ (n=3, 4, ${\cdots}$) transmit antennas. The relevant channel state information is sent back from the receiver to the transmitter quantized to one or two bits per code block. In this way, signal transmission with an improved coding gain and diversity near to the maximum diversity order is achieved. Such high diversity can be exploited with either a maximum-likelihood receiver or low-complexity zero-forcing receiver.