The Experts below are selected from a list of 12570 Experts worldwide ranked by ideXlab platform
Sundar B. Rajan - One of the best experts on this subject based on the ideXlab platform.
-
Construction of Block Orthogonal STBCs and Reducing Their Sphere Decoding Complexity
IEEE Transactions on Wireless Communications, 2014Co-Authors: G. R. Jithamithra, Sundar B. RajanAbstract:A new class of Space Time Block Codes (STBCs) known as block orthogonal STBCs (BOSTBCs) was recently presented by Ren et al., which could be exploited by a QR decomposition decoder with M paths (QRDM decoder) to achieve significant Decoding Complexity reduction without performance loss. The block orthogonal property of the codes constructed, was however only shown via simulations. In this paper, we give analytical proofs for the block orthogonal structure of various existing codes in literature including codes formed as the sum of Clifford Unitary Weight Designs (CUWDs). We also show that, construction methods from Coordinate Interleaved Orthogonal Designs (CIODs), Cyclic Division Algebras (CDAs) and Crossed-Product Algebras (CPAs) can lead to BOSTBCs. In addition, we show that the block orthogonal STBCs offer a reduced Decoding Complexity when used in tandem with a fast sphere decoder using a depth first search approach. Simulation results involving Decoding Complexity show a 30% reduction in the number of floating point operations (FLOPS) of BOSTBCs as compared to STBCs without the block orthogonal structure.
-
Construction of block orthogonal STBCs and reducing their sphere Decoding Complexity
2013 IEEE Wireless Communications and Networking Conference (WCNC), 2013Co-Authors: G. R. Jithamithra, Sundar B. RajanAbstract:Construction of high rate Space Time Block Codes (STBCs) with low Decoding Complexity has been studied widely using techniques such as sphere Decoding and non Maximum-Likelihood (ML) decoders such as the QR decomposition decoder with M paths (QRDM decoder). Recently Ren et al., presented a new class of STBCs known as the block orthogonal STBCs (BOSTBCs), which could be exploited by the QRDM decoders to achieve significant Decoding Complexity reduction without performance loss. The block orthogonal property of the codes constructed was however only shown via simulations. In this paper, we give analytical proofs for the block orthogonal structure of various existing codes in literature including the codes constructed in the paper by Ren et al. We show that codes formed as the sum of Clifford Unitary Weight Designs (CUWDs) or Coordinate Interleaved Orthogonal Designs (CIODs) exhibit block orthogonal structure. We also provide new construction of block orthogonal codes from Cyclic Division Algebras (CDAs) and Crossed-Product Algebras (CPAs). In addition, we show how the block orthogonal property of the STBCs can be exploited to reduce the Decoding Complexity of a sphere decoder using a depth first search approach. Simulation results of the Decoding Complexity show a 30% reduction in the number of floating point operations (FLOPS) of BOSTBCs as compared to STBCs without the block orthogonal structure.
-
On the sphere Decoding Complexity of high rate multigroup ML decodable STBCs
2012 IEEE International Symposium on Information Theory Proceedings, 2012Co-Authors: Lakshmi Prasad Natarajan, Pavan K. Srinath, Sundar B. RajanAbstract:A Space-Time Block Code (STBC) is said to be multigroup ML decodable if the information symbols encoded by it can be partitioned into two or more groups, such that each group of symbols can be ML decoded independently of the other symbol groups. In this paper, we show that the upper triangular matrix R encountered during the sphere Decoding of a linear dispersion STBC can be rank-deficient even when the rate of the code is less than the minimum of the number of transmit and receive antennas. We then show that all known families of high rate (rate greater than 1) multigroup ML decodable codes have rank-deficient R matrix, even when the rate is less than the number of transmit and receive antennas, and this rank-deficiency problem arises only when the number of receive antennas is strictly less than the number of transmit antennas. Unlike the codes with full-rank R matrix, the average sphere Decoding Complexity of the STBCs whose R matrix is rank-deficient is polynomial in the constellation size, and hence is high. We derive the sphere Decoding Complexity of most of the known high rate multigroup ML decodable codes, and show that for each code, the Complexity is a decreasing function of the number of receive antennas.
-
Low ML Decoding Complexity STBCs via Codes Over the Klein Group
IEEE Transactions on Information Theory, 2011Co-Authors: Lakshmi Prasad Natarajan, Sundar B. RajanAbstract:In this paper, we give a new framework for constructing low ML Decoding Complexity space-time block codes (STBCs) using codes over the Klein group K. Almost all known low ML Decoding Complexity STBCs can be obtained via this approach. New full-diversity STBCs with low ML Decoding Complexity and cubic shaping property are constructed, via codes over K, for number of transmit antennas N=2m, m ≥ 1, and rates R >; 1 complex symbols per channel use. When R=N , the new STBCs are information-lossless as well. The new class of STBCs have the least known ML Decoding Complexity among all the codes available in the literature for a large set of (N,R) pairs.
-
Reduced ML-Decoding Complexity, full-rate STBCs for 4 transmit antenna systems
2010 IEEE International Symposium on Information Theory, 2010Co-Authors: Pavan K. Srinath, Sundar B. RajanAbstract:For an nt transmit, nr receive antenna system (nt × nr system), a full-rate space time block code (STBC) transmits min (nt, nr) complex symbols per channel use. In this paper, a scheme to obtain a full-rate STBC for 4 transmit antennas and any nr, with reduced ML-Decoding Complexity is presented. The weight matrices of the proposed STBC are obtained from the unitary matrix representations of a Clifford Algebra. By puncturing the symbols of the STBC, full rate designs can be obtained for nr
B. Sundar Rajan - One of the best experts on this subject based on the ideXlab platform.
-
WCNC - Construction of block orthogonal STBCs and reducing their sphere Decoding Complexity
2013 IEEE Wireless Communications and Networking Conference (WCNC), 2013Co-Authors: G. R. Jithamithra, B. Sundar RajanAbstract:Construction of high rate Space Time Block Codes (STBCs) with low Decoding Complexity has been studied widely using techniques such as sphere Decoding and non Maximum-Likelihood (ML) decoders such as the QR decomposition decoder with M paths (QRDM decoder). Recently Ren et al., presented a new class of STBCs known as the block orthogonal STBCs (BOSTBCs), which could be exploited by the QRDM decoders to achieve significant Decoding Complexity reduction without performance loss. The block orthogonal property of the codes constructed was however only shown via simulations. In this paper, we give analytical proofs for the block orthogonal structure of various existing codes in literature including the codes constructed in the paper by Ren et al. We show that codes formed as the sum of Clifford Unitary Weight Designs (CUWDs) or Coordinate Interleaved Orthogonal Designs (CIODs) exhibit block orthogonal structure. We also provide new construction of block orthogonal codes from Cyclic Division Algebras (CDAs) and Crossed-Product Algebras (CPAs). In addition, we show how the block orthogonal property of the STBCs can be exploited to reduce the Decoding Complexity of a sphere decoder using a depth first search approach. Simulation results of the Decoding Complexity show a 30% reduction in the number of floating point operations (FLOPS) of BOSTBCs as compared to STBCs without the block orthogonal structure.
-
ISIT - On the sphere Decoding Complexity of high rate multigroup ML decodable STBCs
2012 IEEE International Symposium on Information Theory Proceedings, 2012Co-Authors: Lakshmi Natarajan, K. Pavan Srinath, B. Sundar RajanAbstract:A Space-Time Block Code (STBC) is said to be multigroup ML decodable if the information symbols encoded by it can be partitioned into two or more groups, such that each group of symbols can be ML decoded independently of the other symbol groups. In this paper, we show that the upper triangular matrix R encountered during the sphere Decoding of a linear dispersion STBC can be rank-deficient even when the rate of the code is less than the minimum of the number of transmit and receive antennas. We then show that all known families of high rate (rate greater than 1) multigroup ML decodable codes have rank-deficient R matrix, even when the rate is less than the number of transmit and receive antennas, and this rank-deficiency problem arises only when the number of receive antennas is strictly less than the number of transmit antennas. Unlike the codes with full-rank R matrix, the average sphere Decoding Complexity of the STBCs whose R matrix is rank-deficient is polynomial in the constellation size, and hence is high. We derive the sphere Decoding Complexity of most of the known high rate multigroup ML decodable codes, and show that for each code, the Complexity is a decreasing function of the number of receive antennas.
-
On the Sphere Decoding Complexity of STBCs for Asymmetric MIMO Systems
arXiv: Information Theory, 2011Co-Authors: Lakshmi Natarajan, K. Pavan Srinath, B. Sundar RajanAbstract:In the landmark paper by Hassibi and Hochwald, it is claimed without proof that the upper triangular matrix R encountered during the sphere Decoding of any linear dispersion code is full-ranked whenever the rate of the code is less than the minimum of the number of transmit and receive antennas. In this paper, we show that this claim is true only when the number of receive antennas is at least as much as the number of transmit antennas. We also show that all known families of high rate (rate greater than 1 complex symbol per channel use) multigroup ML decodable codes have rank-deficient R matrix even when the criterion on rate is satisfied, and that this rank-deficiency problem arises only in asymmetric MIMO with number of receive antennas less than the number of transmit antennas. Unlike the codes with full-rank R matrix, the average sphere Decoding Complexity of the STBCs whose R matrix is rank-deficient is polynomial in the constellation size. We derive the sphere Decoding Complexity of most of the known high rate multigroup ML decodable codes, and show that for each code, the Complexity is a decreasing function of the number of receive antennas.
-
A Low ML-Decoding Complexity, Full-diversity, Full-rate MIMO Precoder
arXiv: Information Theory, 2011Co-Authors: K. Pavan Srinath, B. Sundar RajanAbstract:Precoding for multiple-input, multiple-output (MIMO) antenna systems is considered with perfect channel knowledge available at both the transmitter and the receiver. For 2 transmit antennas and QAM constellations, an approximately optimal (with respect to the minimum Euclidean distance between points in the received signal space) real-valued precoder based on the singular value decomposition (SVD) of the channel is proposed, and it is shown to offer a maximum-likelihood (ML)-Decoding Complexity of $\mathcal{O}(\sqrt{M})$ for square $M$-QAM. The proposed precoder is obtainable easily for arbitrary QAM constellations, unlike the known complex-valued optimal precoder by Collin et al. for 2 transmit antennas, which is in existence for 4-QAM alone with an ML-Decoding Complexity of $\mathcal{O}(M\sqrt{M})$ (M=4) and is extremely hard to obtain for larger QAM constellations. The proposed precoder's loss in error performance for 4-QAM in comparison with the complex-valued optimal precoder is only marginal. Our precoding scheme is extended to higher number of transmit antennas on the lines of the E-$d_{min}$ precoder for 4-QAM by Vrigneau et al. which is an extension of the complex-valued optimal precoder for 4-QAM. Compared with the recently proposed $X-$ and $Y-$precoders, the error performance of our precoder is significantly better. It is shown that our precoder provides full-diversity for QAM constellations and this is supported by simulation plots of the word error probability for $2\times2$, $4\times4$ and $8\times8$ systems.
-
GLOBECOM - Reduced ML-Decoding Complexity, Full-Rate STBCs for 2a Transmit Antenna Systems
2010 IEEE Global Telecommunications Conference GLOBECOM 2010, 2010Co-Authors: K. Pavan Srinath, B. Sundar RajanAbstract:For an $n_t$ transmit, $n_r$ receive antenna system ($n_t \times n_r$ system), a {\it{full-rate}} space time block code (STBC) transmits $n_{min} = min(n_t,n_r)$ complex symbols per channel use and in general, has an ML-Decoding Complexity of the order of $M^{n_tn_{min}}$ (considering square designs), where $M$ is the constellation size. In this paper, a scheme to obtain a full-rate STBC for $2^a$ transmit antennas and any $n_r$, with reduced ML-Decoding Complexity of the order of $M^{n_t(n_{min}-\frac{3}{4})-0.5}$, is presented. The well known Silver code for 2 transmit antennas is a special case of the proposed scheme. Further, it is shown that the codes constructed using the scheme have higher ergodic capacity than the well known punctured Perfect codes for $n_r < n_t$. Simulation results of the symbol error rates are shown for $8 \times 2$ systems, where the comparison of the proposed code is with the punctured Perfect code for 8 transmit antennas. The proposed code matches the punctured Perfect code in error performance, while having reduced ML-Decoding Complexity and higher ergodic capacity.
Pavan K. Srinath - One of the best experts on this subject based on the ideXlab platform.
-
On the sphere Decoding Complexity of high rate multigroup ML decodable STBCs
2012 IEEE International Symposium on Information Theory Proceedings, 2012Co-Authors: Lakshmi Prasad Natarajan, Pavan K. Srinath, Sundar B. RajanAbstract:A Space-Time Block Code (STBC) is said to be multigroup ML decodable if the information symbols encoded by it can be partitioned into two or more groups, such that each group of symbols can be ML decoded independently of the other symbol groups. In this paper, we show that the upper triangular matrix R encountered during the sphere Decoding of a linear dispersion STBC can be rank-deficient even when the rate of the code is less than the minimum of the number of transmit and receive antennas. We then show that all known families of high rate (rate greater than 1) multigroup ML decodable codes have rank-deficient R matrix, even when the rate is less than the number of transmit and receive antennas, and this rank-deficiency problem arises only when the number of receive antennas is strictly less than the number of transmit antennas. Unlike the codes with full-rank R matrix, the average sphere Decoding Complexity of the STBCs whose R matrix is rank-deficient is polynomial in the constellation size, and hence is high. We derive the sphere Decoding Complexity of most of the known high rate multigroup ML decodable codes, and show that for each code, the Complexity is a decreasing function of the number of receive antennas.
-
Reduced ML-Decoding Complexity, full-rate STBCs for 4 transmit antenna systems
2010 IEEE International Symposium on Information Theory, 2010Co-Authors: Pavan K. Srinath, Sundar B. RajanAbstract:For an nt transmit, nr receive antenna system (nt × nr system), a full-rate space time block code (STBC) transmits min (nt, nr) complex symbols per channel use. In this paper, a scheme to obtain a full-rate STBC for 4 transmit antennas and any nr, with reduced ML-Decoding Complexity is presented. The weight matrices of the proposed STBC are obtained from the unitary matrix representations of a Clifford Algebra. By puncturing the symbols of the STBC, full rate designs can be obtained for nr
-
Reduced ML-Decoding Complexity, Full-Rate STBCs for 2a Transmit Antenna Systems
2010 IEEE Global Telecommunications Conference GLOBECOM 2010, 2010Co-Authors: Pavan K. Srinath, Sundar B. RajanAbstract:For an nt transmit, nr receive antenna system (nt × nr system), a fall-rate space time block code (STBC) transmits nmin = min(nt, nr) complex symbols per channel use and in general, has an ML-Decoding Complexity of the order of Mntnmin (considering square designs), where M is the constellation size. In this paper, a scheme to obtain a fullrate STBC for 2a transmit antennas and any nτ, with reduced ML-Decoding Complexity of the order of Mnt(nmin-3/4)-0.5, is presented. The well known Silver code for 2 transmit antennas is a special case of the proposed scheme. Further, it is shown that the codes constructed using the scheme have higher ergodic capacity than the well known punctured Perfect codes for nr
-
Low ML-Decoding Complexity, Large Coding Gain, Full-Rate, Full-Diversity STBCs for 2 $\times$ 2 and 4 $\times$ 2 MIMO Systems
IEEE Journal of Selected Topics in Signal Processing, 2009Co-Authors: Pavan K. Srinath, Sundar B. RajanAbstract:This paper deals with low maximum-likelihood (ML)-Decoding Complexity, full-rate and full-diversity space-time block codes (STBCs), which also offer large coding gain, for the 2 transmit antenna, 2 receive antenna (2 × 2) and the 4 transmit antenna, 2 receive antenna (4 × 2) MIMO systems. Presently, the best known STBC for the 2 × 2 system is the Golden code and that for the 4 × 2 system is the DjABBA code. Following the approach by Biglieri, Hong, and Viterbo, a new STBC is presented in this paper for the 2 × 2 system. This code matches the Golden code in performance and ML-Decoding Complexity for square QAM constellations while it has lower ML-Decoding Complexity with the same performance for non-rectangular QAM constellations. This code is also shown to be information-lossless and diversity-multiplexing gain (DMG) tradeoff optimal. This design procedure is then extended to the 4 × 2 system and a code, which outperforms the DjABBA code for QAM constellations with lower ML-Decoding Complexity, is presented. So far, the Golden code has been reported to have an ML-Decoding Complexity of the order of M 4 for square QAM of size M. In this paper, a scheme that reduces its ML-Decoding Complexity to M 2¿(M) is presented.
Yong Liang Guan - One of the best experts on this subject based on the ideXlab platform.
-
block orthogonal space time code structure and its impact on qrdm Decoding Complexity reduction
IEEE Journal of Selected Topics in Signal Processing, 2011Co-Authors: Yong Liang Guan, Chau Yuen, Er Yang ZhangAbstract:Full-rate space time codes (STCs) with rate number of transmit antennas have high multiplexing gain, but high Decoding Complexity even when decoded using reduced-Complexity decoders such as sphere or QRDM decoders. In this paper, we introduce a new code property of STC called block-orthogonal property, which can be exploited by QR-decomposition-based decoders to achieve significant Decoding Complexity reduction without performance loss. We show that such Complexity reduction principle can benefit the existing algebraic codes such as Perfect and DjABBA codes due to their inherent (but previously undiscovered) block-orthogonal property. In addition, we construct and optimize new full-rate block-orthogonal STC (BOSTC) that further maximize the QRDM Complexity reduction potential. Simulation results of bit error rate (BER) performance against Decoding Complexity show that the new BOSTC outperforms all previously known codes as long as the QRDM decoder operates in reduced-Complexity mode, and the code exhibits a desirable Complexity saturation property.
-
Block-Orthogonal Space–Time Code Structure and Its Impact on QRDM Decoding Complexity Reduction
IEEE Journal of Selected Topics in Signal Processing, 2011Co-Authors: Yong Liang Guan, Chau Yuen, Er Yang ZhangAbstract:Full-rate space time codes (STCs) with rate number of transmit antennas have high multiplexing gain, but high Decoding Complexity even when decoded using reduced-Complexity decoders such as sphere or QRDM decoders. In this paper, we introduce a new code property of STC called block-orthogonal property, which can be exploited by QR-decomposition-based decoders to achieve significant Decoding Complexity reduction without performance loss. We show that such Complexity reduction principle can benefit the existing algebraic codes such as Perfect and DjABBA codes due to their inherent (but previously undiscovered) block-orthogonal property. In addition, we construct and optimize new full-rate block-orthogonal STC (BOSTC) that further maximize the QRDM Complexity reduction potential. Simulation results of bit error rate (BER) performance against Decoding Complexity show that the new BOSTC outperforms all previously known codes as long as the QRDM decoder operates in reduced-Complexity mode, and the code exhibits a desirable Complexity saturation property.
-
Block-orthogonal space-time codes with Decoding Complexity reduction
2010 IEEE 11th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC), 2010Co-Authors: Yong Liang Guan, Chau Yuen, Er Yang ZhangAbstract:Conventional approaches to high-rate space-time codes (STC) design focus on achieving maximum diversity and spatial multiplexing gains, hence they always have high Decoding Complexity. In this paper, we propose and construct a new class of STC, called block-orthogonal STC (BOSTC), which has a simplified ML (maximum likelihood) or near-ML Decoding structure. We demonstrate the tradeoff between Decoding Complexity and Decoding performance. Results show that due to the Decoding Complexity reduction, our proposed BOSTC can outperform the previously known codes when keeping the Decoding Complexity to be the same.
-
Quasi-orthogonal STBC with minimum Decoding Complexity: further results
IEEE Wireless Communications and Networking Conference 2005, 2005Co-Authors: Chau Yuen, Yong Liang Guan, Tjeng Thiang TjhungAbstract:A new class of quasi-orthogonal space-time block code (QO-STBC) namely minimum-Decoding-Complexity QO-STBC (MDC-QOSTBC) has recently been proposed in the literature. In this paper, we analyze some of its essential code parameters and code properties. Specifically we derive its maximum achievable code rate expression for any number of transmit antennas. We also derive the closed form expression of its diversity product and use it to obtain the optimum constellation rotation in order to achieve optimum Decoding performance. Other performance benefits of MDC-QOSTBC, such as low Decoding Complexity, good coding gain and power distribution property, flexibility in supporting any constellation and number of transmit antennas, are also presented and discussed.
-
WCNC - Quasi-orthogonal STBC with minimum Decoding Complexity: further results
IEEE Wireless Communications and Networking Conference 2005, 2005Co-Authors: Chau Yuen, Yong Liang Guan, Tjeng Thiang TjhungAbstract:A new class of quasi-orthogonal space-time block code (QO-STBC) namely minimum-Decoding-Complexity QO-STBC (MDC-QOSTBC) has recently been proposed in the literature. In this paper, we analyze some of its essential code parameters and code properties. Specifically we derive its maximum achievable code rate expression for any number of transmit antennas. We also derive the closed form expression of its diversity product and use it to obtain the optimum constellation rotation in order to achieve optimum Decoding performance. Other performance benefits of MDC-QOSTBC, such as low Decoding Complexity, good coding gain and power distribution property, flexibility in supporting any constellation and number of transmit antennas, are also presented and discussed.
Chau Yuen - One of the best experts on this subject based on the ideXlab platform.
-
block orthogonal space time code structure and its impact on qrdm Decoding Complexity reduction
IEEE Journal of Selected Topics in Signal Processing, 2011Co-Authors: Yong Liang Guan, Chau Yuen, Er Yang ZhangAbstract:Full-rate space time codes (STCs) with rate number of transmit antennas have high multiplexing gain, but high Decoding Complexity even when decoded using reduced-Complexity decoders such as sphere or QRDM decoders. In this paper, we introduce a new code property of STC called block-orthogonal property, which can be exploited by QR-decomposition-based decoders to achieve significant Decoding Complexity reduction without performance loss. We show that such Complexity reduction principle can benefit the existing algebraic codes such as Perfect and DjABBA codes due to their inherent (but previously undiscovered) block-orthogonal property. In addition, we construct and optimize new full-rate block-orthogonal STC (BOSTC) that further maximize the QRDM Complexity reduction potential. Simulation results of bit error rate (BER) performance against Decoding Complexity show that the new BOSTC outperforms all previously known codes as long as the QRDM decoder operates in reduced-Complexity mode, and the code exhibits a desirable Complexity saturation property.
-
Block-Orthogonal Space–Time Code Structure and Its Impact on QRDM Decoding Complexity Reduction
IEEE Journal of Selected Topics in Signal Processing, 2011Co-Authors: Yong Liang Guan, Chau Yuen, Er Yang ZhangAbstract:Full-rate space time codes (STCs) with rate number of transmit antennas have high multiplexing gain, but high Decoding Complexity even when decoded using reduced-Complexity decoders such as sphere or QRDM decoders. In this paper, we introduce a new code property of STC called block-orthogonal property, which can be exploited by QR-decomposition-based decoders to achieve significant Decoding Complexity reduction without performance loss. We show that such Complexity reduction principle can benefit the existing algebraic codes such as Perfect and DjABBA codes due to their inherent (but previously undiscovered) block-orthogonal property. In addition, we construct and optimize new full-rate block-orthogonal STC (BOSTC) that further maximize the QRDM Complexity reduction potential. Simulation results of bit error rate (BER) performance against Decoding Complexity show that the new BOSTC outperforms all previously known codes as long as the QRDM decoder operates in reduced-Complexity mode, and the code exhibits a desirable Complexity saturation property.
-
Block-orthogonal space-time codes with Decoding Complexity reduction
2010 IEEE 11th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC), 2010Co-Authors: Yong Liang Guan, Chau Yuen, Er Yang ZhangAbstract:Conventional approaches to high-rate space-time codes (STC) design focus on achieving maximum diversity and spatial multiplexing gains, hence they always have high Decoding Complexity. In this paper, we propose and construct a new class of STC, called block-orthogonal STC (BOSTC), which has a simplified ML (maximum likelihood) or near-ML Decoding structure. We demonstrate the tradeoff between Decoding Complexity and Decoding performance. Results show that due to the Decoding Complexity reduction, our proposed BOSTC can outperform the previously known codes when keeping the Decoding Complexity to be the same.
-
Quasi-orthogonal STBC with minimum Decoding Complexity: further results
IEEE Wireless Communications and Networking Conference 2005, 2005Co-Authors: Chau Yuen, Yong Liang Guan, Tjeng Thiang TjhungAbstract:A new class of quasi-orthogonal space-time block code (QO-STBC) namely minimum-Decoding-Complexity QO-STBC (MDC-QOSTBC) has recently been proposed in the literature. In this paper, we analyze some of its essential code parameters and code properties. Specifically we derive its maximum achievable code rate expression for any number of transmit antennas. We also derive the closed form expression of its diversity product and use it to obtain the optimum constellation rotation in order to achieve optimum Decoding performance. Other performance benefits of MDC-QOSTBC, such as low Decoding Complexity, good coding gain and power distribution property, flexibility in supporting any constellation and number of transmit antennas, are also presented and discussed.
-
WCNC - Quasi-orthogonal STBC with minimum Decoding Complexity: further results
IEEE Wireless Communications and Networking Conference 2005, 2005Co-Authors: Chau Yuen, Yong Liang Guan, Tjeng Thiang TjhungAbstract:A new class of quasi-orthogonal space-time block code (QO-STBC) namely minimum-Decoding-Complexity QO-STBC (MDC-QOSTBC) has recently been proposed in the literature. In this paper, we analyze some of its essential code parameters and code properties. Specifically we derive its maximum achievable code rate expression for any number of transmit antennas. We also derive the closed form expression of its diversity product and use it to obtain the optimum constellation rotation in order to achieve optimum Decoding performance. Other performance benefits of MDC-QOSTBC, such as low Decoding Complexity, good coding gain and power distribution property, flexibility in supporting any constellation and number of transmit antennas, are also presented and discussed.
