### Citations

1132 | Diversity and multiplexing: a fundamental tradeoff in multiple antenna channels
- Zheng, Tse
- 2003
(Show Context)
Citation Context ...O systems 1In this paper, the term “spatial multiplexing” is used to describe the number of spatial subchannels, as in [1]. Note that the term is different from “spatial multiplexing gain” defined in =-=[2]-=-. 3with two transmit and two receive antennas [19], [20], has been incorporated into the 802.16e Worldwide Interoperability for Microwave Access (WiMAX) standard [21]. In our previous work [22], Perfe... |

680 |
Introduction to Space-Time Wireless Communications
- Paulraj, Nabar, et al.
- 2003
(Show Context)
Citation Context ...advantages of PSTBCs, the Golden Code (GC), which is the best known PSTBC for MIMO systems 1In this paper, the term “spatial multiplexing” is used to describe the number of spatial subchannels, as in =-=[1]-=-. Note that the term is different from “spatial multiplexing gain” defined in [2]. 3with two transmit and two receive antennas [19], [20], has been incorporated into the 802.16e Worldwide Interoperabi... |

664 |
Error Control Coding: Fundamentals and Applications
- LIN, COSTELLO
- 1983
(Show Context)
Citation Context ...n X∈η (m,n),j c k′ ‖Yk −ΛM{X}‖2, (3) where η(m,n),jck′ is defined as η (m,n),j b = {X : x(u,v)=(m,n) ∈ χjb, and x(u,v)6=(m.n) ∈ χ}. Finally, the ML decoder, which uses the soft-input Viterbi decoding =-=[25]-=- to find a codeword with the minimum sum weight, makes decisions according to the rule given by [26] as ĉ = argmin c ∑ k′ Γ(m,n),j(Yk, ck′). (4) III. DIVERSITY ANALYSIS Based on the bit metrics in (3... |

545 |
Bit-interleaved coded modulation
- Caire, Taricco, et al.
- 1998
(Show Context)
Citation Context ... ∈ χjb, and x(u,v)6=(m.n) ∈ χ}. Finally, the ML decoder, which uses the soft-input Viterbi decoding [25] to find a codeword with the minimum sum weight, makes decisions according to the rule given by =-=[26]-=- as ĉ = argmin c ∑ k′ Γ(m,n),j(Yk, ck′). (4) III. DIVERSITY ANALYSIS Based on the bit metrics in (3), the instantaneous Pairwise Error Probability (PEP) between the transmitted codeword c and the dec... |

149 | On the complexity of the sphere decoding in digital communications
- Jalden, Ottersten
- 2005
(Show Context)
Citation Context ...o calculate 1 2 MD points by exhaustive search for one bit metric. Hence, the complexity is proportional to MD, denoted by O(MD). Sphere Decoding (SD) is an alternative for ML with reduced complexity =-=[28]-=-, which reduces the average complexity and provides the worst-case complexity of O(MD). Moreover, if an efficient implementation of a slicer [29] is applied, the worst-case complexity is then O(MD − 1... |

145 | The golden code: a 2 × 2 full-rate space-time code with nonvanishing determinants
- Belfiore, Rekaya, et al.
- 2005
(Show Context)
Citation Context ...plexing” is used to describe the number of spatial subchannels, as in [1]. Note that the term is different from “spatial multiplexing gain” defined in [2]. 3with two transmit and two receive antennas =-=[19]-=-, [20], has been incorporated into the 802.16e Worldwide Interoperability for Microwave Access (WiMAX) standard [21]. In our previous work [22], Perfect Coded Multiple Beamforming (PCMB) was proposed.... |

133 |
Space-Time Coding: Theory and Practice
- Jafarkhani
- 2005
(Show Context)
Citation Context ...ting Singular Value Decomposition (SVD) are applied in a Multiple-Input MultipleOutput (MIMO) system to achieve spatial multiplexing1 and thereby increase the data rate, or to enhance the performance =-=[3]-=-. However, spatial multiplexing without channel coding results in the loss of the full diversity order [4]. To overcome the diversity degradation, Bit-Interleaved Coded Multiple Beamforming (BICMB), w... |

97 | Perfect space-time block codes
- Oggier, Rekaya, et al.
- 2006
(Show Context)
Citation Context ...oding (BICMB-PP) could also achieve both full diversity and full multiplexing with the properly designed combination of the convolutional code, the bit interleaver, and the constellation precoder. In =-=[16]-=-, the Perfect Space-Time Block Code (PSTBC) was introduced for dimensions 2, 3, 4, and 6. PSTBCs have the full rate, full diversity, nonvanishing minimum determinant for increasing spectral efficiency... |

88 |
Efficient modulation for band-limited channels
- Forney, Gallager, et al.
- 1984
(Show Context)
Citation Context ...e punctured code, generates the bit codeword c from the information bits. Then, a random bit-interleaver is applied to generate the interleaved bit sequence, which is then modulated by M-QAM or M-HEX =-=[24]-=- and mapped by Gray encoding. Then D2 consecutive complex-valued scalar symbols are encoded into one PSTBC codeword, where D ∈ {2, 3, 4, 6} is the system dimension. Hence, the kth PSTBC codeword Zk is... |

72 | An optimal two transmit antenna spacetime code and its stacked extensions
- Dayal, Varanasi
- 2003
(Show Context)
Citation Context ...g” is used to describe the number of spatial subchannels, as in [1]. Note that the term is different from “spatial multiplexing gain” defined in [2]. 3with two transmit and two receive antennas [19], =-=[20]-=-, has been incorporated into the 802.16e Worldwide Interoperability for Microwave Access (WiMAX) standard [21]. In our previous work [22], Perfect Coded Multiple Beamforming (PCMB) was proposed. PCMB ... |

55 | High-rate punctured convolutional codes for Viterbi and sequential decoding - Haccoun, Bégin - 1989 |

33 |
Diversity analysis of single and multiple beamforming
- Sengul, Akay, et al.
- 2006
(Show Context)
Citation Context ...hieve spatial multiplexing1 and thereby increase the data rate, or to enhance the performance [3]. However, spatial multiplexing without channel coding results in the loss of the full diversity order =-=[4]-=-. To overcome the diversity degradation, Bit-Interleaved Coded Multiple Beamforming (BICMB), which interleaves the codewords through the multiple subchannels with different diversity orders, was propo... |

25 | P.V.: Perfect Space-Time Codes with Minimum and Non-Minimum Delay for Any Number of Antennas
- Elia, Sethuraman, et al.
(Show Context)
Citation Context ... rate, full diversity, nonvanishing minimum determinant for increasing spectral efficiency, uniform average transmitted energy per antenna, good shaping of the constellation, and high coding gain. In =-=[17]-=-, PSTBCs were generalized to any dimension. However, it was proved in [18] that particular PSTBCs, yielding increased coding gain, only exist in dimensions 2, 3, 4, and 6. Due to the advantages of PST... |

22 | Bit interleaved coded multiple beamforming
- Akay, Sengul, et al.
- 2007
(Show Context)
Citation Context ... overcome the diversity degradation, Bit-Interleaved Coded Multiple Beamforming (BICMB), which interleaves the codewords through the multiple subchannels with different diversity orders, was proposed =-=[5]-=-, [6]. BICMB can achieve both full diversity and full multiplexing as long as the code rate Rc and the number of employed subchannels S satisfy the condition RcS ≤ 1 [7], [8]. In [9], [10], X-Codes an... |

11 | Diversity analysis of bit-interleaved coded multiple beamforming
- Park, Ayanoglu
- 2009
(Show Context)
Citation Context ...diversity orders, was proposed [5], [6]. BICMB can achieve both full diversity and full multiplexing as long as the code rate Rc and the number of employed subchannels S satisfy the condition RcS ≤ 1 =-=[7]-=-, [8]. In [9], [10], X-Codes and Y-Codes were introduced to increase the diversity of multiple beamforming which transmits multiple streams. These techniques do not guarantee full diversity when the n... |

7 |
Constellation Precoded Beamforming
- Park, Ayanoglu
- 2009
(Show Context)
Citation Context ...ich transmits multiple streams. These techniques do not guarantee full diversity when the number of transmit or receive antennas is larger than 2, and require relatively high precoding complexity. In =-=[11]-=-, [12], [13], [14], it was shown that by employing the constellation precoding technique, which has very low precoding complexity, full diversity and full multiplexing can be achieved simultaneously f... |

7 |
On the Existence of Perfect Space-Time Codes
- Berhuy, Oggier
- 2009
(Show Context)
Citation Context ...ctral efficiency, uniform average transmitted energy per antenna, good shaping of the constellation, and high coding gain. In [17], PSTBCs were generalized to any dimension. However, it was proved in =-=[18]-=- that particular PSTBCs, yielding increased coding gain, only exist in dimensions 2, 3, 4, and 6. Due to the advantages of PSTBCs, the Golden Code (GC), which is the best known PSTBC for MIMO systems ... |

6 | Precoding by Pairing Subchannels to Increase MIMO Capacity with Discrete Input Alphabets
- Mohammed, Viterbo, et al.
- 2011
(Show Context)
Citation Context ...ers, was proposed [5], [6]. BICMB can achieve both full diversity and full multiplexing as long as the code rate Rc and the number of employed subchannels S satisfy the condition RcS ≤ 1 [7], [8]. In =-=[9]-=-, [10], X-Codes and Y-Codes were introduced to increase the diversity of multiple beamforming which transmits multiple streams. These techniques do not guarantee full diversity when the number of tran... |

6 | Multiple beamforming with constellation precoding: Diversity analysis and sphere decoding
- Park, Li, et al.
- 2010
(Show Context)
Citation Context ...s multiple streams. These techniques do not guarantee full diversity when the number of transmit or receive antennas is larger than 2, and require relatively high precoding complexity. In [11], [12], =-=[13]-=-, [14], it was shown that by employing the constellation precoding technique, which has very low precoding complexity, full diversity and full multiplexing can be achieved simultaneously for both unco... |

5 |
coded multiple beamforming with constellation precoding
- “Bit-interleaved
- 2010
(Show Context)
Citation Context ...ansmits multiple streams. These techniques do not guarantee full diversity when the number of transmit or receive antennas is larger than 2, and require relatively high precoding complexity. In [11], =-=[12]-=-, [13], [14], it was shown that by employing the constellation precoding technique, which has very low precoding complexity, full diversity and full multiplexing can be achieved simultaneously for bot... |

5 | An upper bound to the marginal PDF of the ordered eigenvalues of Wishart matrices and its application to MIMO diversity analysis
- Park, Ayanoglu
- 2010
(Show Context)
Citation Context ...1 λ 2 uρu,k 4N0 )] = E [ 1 2 exp ( − ∑D u=1 λ 2 u ∑ k′,dH ρu,k 4N0 )] , (13) where ρu,k = D∑ v=1 |gTu (xv,k − x̂v,k)|2. (14) The upper bound in (13) can be further bounded by employing a theorem from =-=[27]-=- which is given below. Theorem. Consider the largest S ≤ min(Nt, Nr) eigenvalues µs of the uncorrelated central Nr × Nt Wishart matrix that are sorted in decreasing order, and a weight vector ρ = [ρ1,... |

4 | Co-Ordinate Interleaved Spatial Multiplexing with Channel State Information
- Srinivas, Koilpillai, et al.
- 2009
(Show Context)
Citation Context ...igher decoding complexity. Specifically, in the uncoded case, full diversity requires that all streams are precoded, i.e., Fully Precoded Multiple Beamforming (FPMB). A similar result was reported in =-=[15]-=- with a technique employing the rotated Quadrature Amplitude Modulation (QAM) constellation. On the other hand, for the convolutional coded SVD systems without the condition RcS ≤ 1, other than full p... |

4 |
Coded Multiple Beamfoming
- Li, Ayanoglu, et al.
- 2010
(Show Context)
Citation Context ...ined in [2]. 3with two transmit and two receive antennas [19], [20], has been incorporated into the 802.16e Worldwide Interoperability for Microwave Access (WiMAX) standard [21]. In our previous work =-=[22]-=-, Perfect Coded Multiple Beamforming (PCMB) was proposed. PCMB combines PSTBCs with uncoded multiple beamforming, and achieves full diversity, full multiplexing, and full rate at the same time, in a s... |

4 |
Space-time block codes with low maximum likelihood decoding complexity
- Sinnokrot
- 2009
(Show Context)
Citation Context ... (SD) is an alternative for ML with reduced complexity [28], which reduces the average complexity and provides the worst-case complexity of O(MD). Moreover, if an efficient implementation of a slicer =-=[29]-=- is applied, the worst-case complexity is then O(MD − 1). Particularly, it was proved in [22] that R is a real-valued matrix for dimensions 2 and 4, which implies that the real and imaginary parts of ... |

2 | Reduced complexity sphere decoding
- Li, Ayanoglu
- 2011
(Show Context)
Citation Context ...ber of real multiplications which are the most expensive operations in terms of machine cycles, for acquiring one bit metric is calculated at different SNR for BICMB-PC and BICMB-FP, respectively. In =-=[30]-=-, [31], an efficient reduced complexity decoding technique was introduced for BICMB-FP, which is applied in this paper. For fair comparisons, a similar decoding technique is applied to BICMB-PC. Fig. ... |

2 |
complexity decoding for bit-interleaved coded multiple beamforming with constellation precoding
- “Reduced
- 2011
(Show Context)
Citation Context ... real multiplications which are the most expensive operations in terms of machine cycles, for acquiring one bit metric is calculated at different SNR for BICMB-PC and BICMB-FP, respectively. In [30], =-=[31]-=-, an efficient reduced complexity decoding technique was introduced for BICMB-FP, which is applied in this paper. For fair comparisons, a similar decoding technique is applied to BICMB-PC. Fig. 4 show... |

2 |
complexity sphere decoding
- “Reduced
- 2011
(Show Context)
Citation Context ...orders of magnitude. 11 Additionally, Fig. 5 shows the complexity comparisons for uncoded full-diversity full-multiplexing SVD systems of FPMB and PCMB in dimensions of 2 and 4 using 64-QAM. In [30], =-=[32]-=-, an efficient reduced complexity SD technique was introduced, which is applied in this paper. For the dimension of 2, the complexity of GCMB is 0.5 order of magnitude lower than FPMB at low SNR and s... |

1 |
Precoding with X- and Y-Codes
- “MIMO
- 2011
(Show Context)
Citation Context ...was proposed [5], [6]. BICMB can achieve both full diversity and full multiplexing as long as the code rate Rc and the number of employed subchannels S satisfy the condition RcS ≤ 1 [7], [8]. In [9], =-=[10]-=-, X-Codes and Y-Codes were introduced to increase the diversity of multiple beamforming which transmits multiple streams. These techniques do not guarantee full diversity when the number of transmit o... |