Full-Diversity Space-Time-Frequency Coding with Very Low Complexity for the ML Decoder

On the coding advantages of the quasi‐orthogonal space–frequency block codes

“…Therefore, if DPPs are known to the transmitter, we can find γ SD so as to maximise the CA of the P‐QOSFBCs. On the other hand, if DPPs are unknown to the transmitter, we optimise the CA of the P‐QOSFBC based on the artificial DPPs (ADPPs) that we have introduced in [5]. In short, we could formulate the problem of finding the optimum positive integer to maximise the CA of the P‐QOSFBCs as It is worthwhile to mention that clearly the optimisation process is the calculation of (((⌊ N /Γ⌋)/2) − 2) determinants of matrices of size Γ M t × Γ M t , which imposes a very low computational complexity on the transmitter compared with the typical optimisation processes.…”

“…Several space–frequency block codes (SFBC) have been proposed as an efficient method for implementing MIMO‐OFDM systems, see [2–5] and references therein. Quasi‐orthogonal SFBCs (QOSFBCs) are one of the most prosperous proposed SFBCs in the literature.…”

Coding advantage decomposition inequality for the space–frequency block codes

“…When the DPPs are accessible, simply the matrix R can be constructed and then using (32), can be calculated. If there are no prior knowledge of the DPPs at the transmitter, the artificial DPPs (ADPPs) proposed in [14] are used to construct the correlation matrix and then calculating by (32). In the next section, we presented simulation results for both scenarios.…”

“…The design criteria for STFBCs are discussed in [7–9]. STFBCs and SFBCs proposed in [10–14] are just some examples of research study currently being pursued in this area. In [12], linear transform based full‐diversity SFBCs and STFBCs are proposed which feature the best performance to the best of our knowledge.…”

New Full-Diversity Space-Frequency Block Codes Based on the OSTBCs

“…In [9] and [10], authors presented a new class of full-diversity STFBCs and SFBCs based on the generalized block-diagonal quasi-orthogonal space-time block codes. In [11], STFBCs are proposed which feature a very simple decoder complexity for the maximum likelihood (ML) receiver.…”