Academia.eduAcademia.edu

Figure 1 – uploaded by Ungku Azmi

See full PDFdownloadDownload figure
Optimal QPSK STTC with two transmit antennas for slow fading channels based on rank and determinant criteria. Table 1

Table 1 Optimal QPSK STTC with two transmit antennas for slow fading channels based on rank and determinant criteria. Table 1

Related Figures (6)

tively, where gt € {0,1, 2,3}, k=1,2; i=1,2; j =0,1,..., vx. The multiplier outputs are added modulo-4, giving the output as in (i.e., the coding gain). High coding gain is obtained by maximising the minimum determinant which means optimal generator ma- trix G. Thus, an optimal generator matrix G will be the highlight of this paper.
tively, where gt € {0,1, 2,3}, k=1,2; i=1,2; j =0,1,..., vx. The multiplier outputs are added modulo-4, giving the output as in (i.e., the coding gain). High coding gain is obtained by maximising the minimum determinant which means optimal generator ma- trix G. Thus, an optimal generator matrix G will be the highlight of this paper.
Fig. 2. Trellis diagram for a QPSK 4-state STTC for 2 transmit antenna [22]. transmit antennas [1-3,6,8,11,13,15,17,24]. Hence given its popu- larity among other researchers, makes it a more reliable base of comparison.
Fig. 2. Trellis diagram for a QPSK 4-state STTC for 2 transmit antenna [22]. transmit antennas [1-3,6,8,11,13,15,17,24]. Hence given its popu- larity among other researchers, makes it a more reliable base of comparison.
Due to QPSK modulation, there are four transition branches ex- tending for each state node, corresponding to four different input patterns. The first branch, indicated by a purple line corresponds to the current input 0. The second, third and fourth branch, indi- cated by pink, green and blue line respectively, corresponds to the Basically, generator matrix G is used to facilitate the code search procedure (i.e., through RDC) to obtain an optimal STTC (i.e., full diversity and high coding gain). High coding gain is obtained by maximising the minimum determinant. The discussion on the min- imum determinant calculation can be obtained in the next section, which is Section 3. Fig. 3. Continuous path through the trellis that defines the transmitted symbols [22].
Due to QPSK modulation, there are four transition branches ex- tending for each state node, corresponding to four different input patterns. The first branch, indicated by a purple line corresponds to the current input 0. The second, third and fourth branch, indi- cated by pink, green and blue line respectively, corresponds to the Basically, generator matrix G is used to facilitate the code search procedure (i.e., through RDC) to obtain an optimal STTC (i.e., full diversity and high coding gain). High coding gain is obtained by maximising the minimum determinant. The discussion on the min- imum determinant calculation can be obtained in the next section, which is Section 3. Fig. 3. Continuous path through the trellis that defines the transmitted symbols [22].
Fig. 4. State diagram for a generator matrix G by [22]. Defined the parameter: (1) number of antenna, (2) Generator coefficient
Fig. 4. State diagram for a generator matrix G by [22]. Defined the parameter: (1) number of antenna, (2) Generator coefficient
Fig. 5. Flow chart in finding the optimal generator matrix G. produced, then how many distance matrices and minimum de- terminants need to be calculated? In this paper, the minimum determinant calculation can be obtained by implementing an im- proved algorithm which is based on a tree structure representation and a DFS approach [14]. This results in optimal generator matrix G which in turn gives an optimal STTC. The flow chart summaris- ing the whole process in finding an optimal generator matrix G is shown in Fig. 5 and the discussion on the optimal generator ma- trix G is in Section 4.
Fig. 5. Flow chart in finding the optimal generator matrix G. produced, then how many distance matrices and minimum de- terminants need to be calculated? In this paper, the minimum determinant calculation can be obtained by implementing an im- proved algorithm which is based on a tree structure representation and a DFS approach [14]. This results in optimal generator matrix G which in turn gives an optimal STTC. The flow chart summaris- ing the whole process in finding an optimal generator matrix G is shown in Fig. 5 and the discussion on the optimal generator ma- trix G is in Section 4.
Related topics:
Mechanical EngineeringAerospace EngineeringChannel CodingInformation capacityTransmission ErrorCoding Gain
580 California St., Suite 400
San Francisco, CA, 94104
© 2025 Academia. All rights reserved