貝蘇章臺灣大學:電信工程學研究所陳明揚Chen, Ming-YangMing-YangChen2007-11-272018-07-052007-11-272018-07-052005http://ntur.lib.ntu.edu.tw//handle/246246/58911The designing potential of using quaternionic numbers to identify a 4 × 4 real orthogonal space-time block code has been exploited in various communication articles. Although it has been shown that orthogonal codes in full rate exist only for 2 Tx-antennas in complex constellations, a series of complex quasi-orthogonal codes for 4 Tx-antennas is still proposed to have good performance recently. This quasi-orthogonal scheme enables the codes reach the optimal non-orthogonality, which can be measured by taking the expectation over all transmitted signals of the ratios between the powers of the off-diagonal and diagonal components. In Chapter 1 of this thesis, we extend the quaternionic identification to the above encoding methods. Based upon tensor product for giving the quaternionic space a linear extension, a complete necessary and sufficient condition of identifying any given complex quasi-orthogonal code with the extended space is generalized by considering every possible 2-dimensional R-algebra. In Chapter 2, a new set of quasi-orthogonal space-time block codes for 4 Txantennas derived by a group-theoretic methodology on the generalized quaternion group of order 16 is presented. We show that these new codes achieve full diversity whenever a square lattice constellation is adopted. From the simulation results, the new designs perform very closely to quasi-orthogonal codes with constellation rotations and admit high coding gains (in fact we prove their coding gains are optimal among those codes whose diagonal entries are all within z1, z1†, or multiples of them by a uni-power coefficient). Without a search of the optimal rotation angle and any constellation expansion, our new codes yield an advantageous transmission scheme for QPSK and 16-QAM modulations.Acknowledgements v Abstract vi 1 Algebraic Identification for QOSTBCs 1 1.1 Introduction . . . . . . . . . . . 1 1.2 Mathematical Principles . . . . . .5 1.2.1 Tensor Product . . . . . . . . . 6 1.2.2 R-algebras . . . . . . . . . . . 7 1.3 QOSTBCs and Quaternions . . . . . 8 1.4 Conclusions and FutureWork . . . .22 2 New QOSTBCs 24 2.1 Introduction . . . .. . . . . . . 24 2.2 SystemModel and Design Criteria . 27 2.3 New Full-Diversity QOSTBCs . . . .29 2.3.1 Code Construction . . . . . . . 34 2.3.2 Full Diversity on Square Lattice Constellations . . . . . . . . . . . .38 2.4 Simulation Results and Discussions . . . . . . . . . . . . . 43 2.5 Conclusions . . . . . . . . . . . 46 Bibliography 47en-US群表現時空編碼Representations of Finite GroupsSpace-Time Block CodesGeneralized Quaternion Groups有限群表現理論在複數時空編碼上之設計及應用Designing Complex Space-Time Block Codes via Representation Theory on Finite Groupsthesis