http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Pham, Van-Su,Le, Minh-Tuan,Mai, Linh,Kabir, S.M.Humayun,Yoon, Gi-Wan The Korea Institute of Information and Commucation 2008 Journal of information and communication convergen Vol.6 No.2
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 possible 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 significantly decrease in system spectral efficiency. This work presents an approach to resolve the aforementioned issue by introducing a new method for constructing transmitted information symbols, in which transmitting information symbols drawn form different modulation constellations. Therefore, the ambiguity can be easily eliminated. In addition, computer simulation is implemented to verify the performance of the proposed approach.
A New Multiuser Receiver for the Application Of Space-time Coded OFDM Systems
Pham, Van-Su,Le, Minh-Tuan,Mai, Linh,Lee, Jae-Young,Yoon, Gi-Wan The Korea Institute of Information and Commucation 2006 Journal of information and communication convergen Vol.4 No.4
In this work, a novel optimal multiuser detection (MUD) approach, which not only achieves the optimal maximum-likelihood (ML)-like performance but also has reasonably low computational complexity, for Space-time coded OFDM (ST-OFDM) systems is presented. In the proposed detection scheme, the signal model is firstly re-expressed into linearly equivalent one. Then, with the linearly equivalent signal model, a new jointly MUD algorithm is proposed to detect signals. The ML-like bit-error-rate (BER) performance and reasonably low complexity of the proposed detection are verified by computer simulations.
Optimization of Channel Capacity in MIMO Systems
Pham Van-Su,Le Minh Tuan,Yoon Giwan The Korea Institute of Information and Commucation 2005 Journal of information and communication convergen Vol.3 No.4
In this paper, a new method to get the optimum channel capacity of a Multiple-Input MultipleOutput (MIMO) system is presented. The proposed method exploits the diagonal structure of channel matrix to maximize the channel capacity. The diagonal format of the channel matrix is formed by multiplying the transmitted signal with the pre-compensated channel PCC) matrix. Numerical simulations show that the proposed method exploiting the diagonal structure of channel matrix could significantly increase the system capacity compared with the system without applying the diagonal structure of channel matrix.
A Simplified Efficient Algorithm for Blind Detection of Orthogonal Space-Time Block Codes
Pham, Van Su,Mai, Linh,Lee, Jae-Young,Yoon, Gi-Wan The Korea Institute of Information and Commucation 2008 Journal of information and communication convergen Vol.6 No.3
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.
Complexity Reduction for Space-Time Block Codes Decoder in MIMO OFDM Systems
Pham Van-Su,Le Minh-Tuan,Mai Linh,Yoon Giwan The Korea Institute of Information and Commucation 2005 Journal of information and communication convergen Vol.3 No.2
In this work, we first present our study on the decoding schemes for space-time block code as well as our comments on their complexity. Then, we propose a new modified complex sphere decoding scheme, which has lower computational load than that of conventional complex sphere decoders. In the proposed scheme, the boundary for searching is aided with the intersection of approximate polygon of searching circle and disk of constellation. Therefore, the proposed scheme can reduce the searching boundary while can avoid missing searching points. The performance of the proposed scheme is verified by computer simulation that consolidates our scheme.
QRD-based Blind Detection for Orthogonal Space-Time Block Codes
Van-Su Pham,Minh-Tuan Le,Linh Mai,Jae-young Lee,S.M. Humayun Kabir,Giwan Yoon 대한전자공학회 2007 ITC-CSCC :International Technical Conference on Ci Vol.2007 No.7
This work presents a simplified QR decomposition based (QRD-based) blind decoding for Orthogonal Space-Time Block Codes (OSTBCs) with M-ary Phase Shift Keying (M-PSK) modulation constellation. By applying the proposed matrix partition, the blind detection problem becomes simpler. In addition, with the aid of QRD, the proposed detection requires a remarkably low complexity while maintaining a reasonable low Bit-error-rate (BER).
Pham Van-Su,Le Minh-Tuan,Mai Linh,Yoon Gi-Wan The Korea Institute of Information and Commucation 2006 Journal of information and communication convergen Vol.4 No.2
This work presents a low complexity maximum-likelihood decoder for signal detection in VBLAST-STBC system, which employs non-square O-STBC code rate 3/4. Stacking received symbols from different symbol duration and applying QR decomposition result in the special format of upper triangular matrix R so that the proposed decoder is able to provide not only ML-like BER performance but also very low computational load. The low computational load and ML-like BER performance properties of the proposed decoder are verified by computer simulations.