• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.12
• /
• pp.103-110
• /
• 2005

The performance of maximum likelihood(ML) detection for the given channel is analyzed in spatially multiplexed MIMO system. In order to obtain the vector symbol error rate, we define error vectors which represent the geometrical relation between lattice points. The properties of error vectors are analyzed to show that all lattice points in infinite lattice almost surely have four nearest neighbors after random channel transformation. Using this information and minimum distance obtained by the modified sphere decoding algorithm, we formulate the analytical performance of vector symbol error over the given channel. To verify the result, we simulate ML performance over various random channel which are classified into three categories: unitary channel, dense channel, and sparse channel. From the simulation results, it is verified that the derived analytical result gives a good approximation about the performance of ML detector over the all random MIMO channels.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.3
• /
• pp.167-167
• /
• 2004

The system combined layered space-time processing and space-time trellis codes (STTC) provide high transmission rate as well as diversity and coding gain without bandwidth expansion. In this paper, two layered receiver structures are proposed. One is the LSTT-MMSE in which received bit streams are decoupled by interference nulling and then decoded by separate STTC decoders. The decoded outputs are cancelled from the received signal before advancing to the next layer detection. The other is LSTT-Whitening employing whitening rather than nulling. The receiver employing whitening process shows several advantages on diversity gain and the required number of receive antennas compare to the convolutional coded space-time processing. The proposed receivers use different decoding order scheme according to each interference suwression. The (4, 3) LSTT-Whitening receiver still achieves 1㏈ gain over the (4, 4) LSTT-MMSE and the (4, 4) coded layered space-time processing.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.3
• /
• pp.9-14
• /
• 2004

The system combined layered space-time processing and space-time trellis codes (STTC) provide high transmission rate as well as diversity and coding gain without bandwidth expansion. In this paper, two layered receiver structures are proposed. One is the LSTT-MMSE in which received bit streams are decoupled by interference nulling and then decoded by separate STTC decoders. The decoded outputs are cancelled from the received signal before advancing to the next layer detection. The other is LSTT-Whitening employing whitening rather than nulling. The receiver employing whitening process shows several advantages on diversity gain and the required number of receive antennas compare to the convolutional coded space-time processing. The proposed receivers use different decoding order scheme according to each interference suwression. The (4, 3) LSTT-Whitening receiver still achieves 1㏈ gain over the (4, 4) LSTT-MMSE and the (4, 4) coded layered space-time processing.

• Journal of information and communication convergence engineering
• /
• v.4 no.2
• /
• pp.79-83
• /
• 2006

We present two techniques based on lookup tables to reduce complexity of the well-known Schnorr-Euchner (SE) sphere decoder (SD) without introducing performance degradation. By the aid of lookup tables, the computational loads caused by the SE enumeration and decision feedback are reduced at the cost of higher storage capacity. Simulation results are provided to verify performance and complexity of the proposed decoders.

• Journal of Communications and Networks
• /
• v.12 no.3
• /
• pp.240-245
• /
• 2010

Jacket matrices, motivated by the complex Hadamard matrix, have played important roles in signal processing, communications, image compression, cryptography, etc. In this paper, we suggest a novel approach to design a simple class of space-time block codes (STBCs) to reduce its peak-to-average power ratio. The proposed code provides coding gain due to the characteristics of the complex Hadamard matrix, which is a special case of Jacket matrices. Also, it can achieve full rate and full diversity with the simple decoding. Simulations show the good performance of the proposed codes in terms of symbol error rate. For generality, a kind of quasi-orthogonal STBC may be similarly designed with the improved performance.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.120-124
• /
• 2006

We present two techniques based on lookup tables to reduce complexity of the well-known Schnorr-Euchner (SE) sphere decoder (SD) without introducing performance degradation. By the aid of lookup tables, the computational loads caused by the SE enumeration and decision feedback are reduced at the cost of higher storage capacity. Simulation results are provided to verify performance and complexity of the proposed decoders.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.6
• /
• pp.69-78
• /
• 2017

Shannon of the 5G smartphone and Fourier of the signal processing meet in the sampling theorem (2 times the highest frequency 1). In this paper, the initial Shannon Theorem finds the Shannon capacity at the point-to-point, but the 5G shows on the Relay channel that the technology has evolved into Multi Point MIMO. Fourier transforms are signal processing with fixed parameters. We analyzed the performance by proposing a 2N-1 multivariate Fourier-Jacket transform in the multimedia age. In this study, the authors tackle this signal processing complexity issue by proposing a Jacket-based fast method for reducing the precoding/decoding complexity in terms of time computation. Jacket transforms have shown to find applications in signal processing and coding theory. Jacket transforms are defined to be $n{\times}n$ matrices $A=(a_{jk})$ over a field F with the property $AA^{\dot{+}}=nl_n$, where $A^{\dot{+}}$ is the transpose matrix of the element-wise inverse of A, that is, $A^{\dot{+}}=(a^{-1}_{kj})$, which generalise Hadamard transforms and centre weighted Hadamard transforms. In particular, exploiting the Jacket transform properties, the authors propose a new eigenvalue decomposition (EVD) method with application in precoding and decoding of distributive multi-input multi-output channels in relay-based DF cooperative wireless networks in which the transmission is based on using single-symbol decodable space-time block codes. The authors show that the proposed Jacket-based method of EVD has significant reduction in its computational time as compared to the conventional-based EVD method. Performance in terms of computational time reduction is evaluated quantitatively through mathematical analysis and numerical results.

• Journal of Internet Computing and Services
• /
• v.8 no.4
• /
• pp.61-70
• /
• 2007

In this paper, we propose and observe the Adaptive Modulation system with optimal Turbo Coded V-BLAST(Vertical-Bell-lab Layered Space-Time) technique that is applied the extrinsic information from MAP Decoder in decoding Algorithm of V-BLAST: ordering and slicing. And comparing the proposed system with the Adaptive Modulation system using conventional Turbo Coded V-BLAST technique that is simply combined V-BLAST with Turbo Coding scheme, we observe how much throughput performance and SNR has been improved. In addition, we show that the proposed system using STD(Selection Transmit Diversity) scheme results in on improved result, By using simulation and comparing to conventional Turbo Coded V-BLAST technique with the Adaptive Modulation systems, the optimal Turbo Coded V-BLAST technique with the Adaptive Modulation systems has SNR gain over all SNR range and better throughput gain that is about 350Kbps in 11dB SNR range. Also, comparing with the conventional Turbo Coded V-BLAST technique using 2 transmit and 2 receive antennas, the proposed system with STD scheme show that the improvement of maximum throughput is about 1.77Mbps in the same SNR range and the SNR gain is about 5.88dB to satisfy 4Mbps throughput performance.

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

In this paper, we propose a bit-interleaved coded modulation (BICM) a lied to improved super-orthogonal space-time block code(SOSTBC). The proposed system achieves a greater diversity gain than that of super-orthogonal space-time trellis code (SOSTTC) with similar decoding complexity. Since, using the improved SOSTBC, the bit diversity carl be full diversity of SOSTBC. In contrast, BICM applied to Jafarkhani's SOSTBC is difficult to achieve a greater diversity gain than that of SOSTTC, because every bit diversity of the system is 1.

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