Non orthogonal space time block codes
Since April of 2021 Purchased: 0 times 10
Non-orthogonal space-time block codes
10.1 Introduction
We introduced space-time block coding in Chapter 4. The space-time block codes in Chapters 4 and 5 have interesting structures that can be...
Maximum likelihood decoding and maximum ratio
Since April of 2021 Purchased: 0 times 4.3 Maximum-likelihood decoding and maximum ratio combining 59
of the code is two. This provides dual diversity that is the same as the diversity of a system with one transmit antenna and two receive...
Historical notes on transmit diversity
Since April of 2021 Purchased: 0 times 26 Introduction
maintain low implementation complexity, a simple linear beamforming scheme at the transmitter is preferred. If non-perfect channel state information is available, a combined...
Generalized real orthogonal designs
Since April of 2021 Purchased: 0 times Due to the structure of the orthogonal designs, each symbol xk appears only once in every column. Therefore the above definition determines without any ambiguity. As a reference, we provide for...
Generalized complex orthogonal designs
Since April of 2021 Purchased: 0 times Construction: Given a complex orthogonal design of size N , we replace each complex variable xn {xn } {xn }j, 1 n N by the 2 2 real matrix
{xn} {xn} . ()
{xn} {xn}
The resulting 2N 2N matrix...
Diversity
Since April of 2021 Purchased: 0 times The path gains, j , are independent complex Gaussian distributions and t rep- resents the noise. In the case of Rayleigh fading, they are zero-mean iid complex Gaussian random variables. A special...
Differential space time modulation
Since April of 2021 Purchased: 0 times 8
Differential space-time modulation
8.1 Introduction
The primary focus of the codes that we have discussed so far has been on the case when only the receiver knows the channel. This is the case for...
Complex orthogonal designs
Since April of 2021 Purchased: 0 times 76 Orthogonal space-time block codes
where k HT ET is the kT row of a K T matrix and contains T elements. These elements are a function of N path gains 1, 2,..., N . Note that
T
N...
Closed loop versus open loop systems
Since April of 2021 Purchased: 0 times 24 Introduction
Optimal trade-off
12
10
8
6
4
2
0
0 1 2 3
Spatial multiplexing gain
Fig. . Optimal trade-off between spatial multiplexing gain (an indication of rate) and diversity.
where r...
Capacity of MIMO channels
Since April of 2021 Purchased: 0 times equations is the method of normalization. Another difference is that the representa- tion of the SNR, the main performance factor, is implicit in (2.5) and explicit in (2.7).
2.2 Capacity of MIMO...
Additional topics in space time coding
Since April of 2021 Purchased: 0 times 11
Additional topics in space-time coding
11.1 MIMO-OFDM
OFDM is an efcient technique for transmitting data over frequency selective chan- nels. The main idea behind OFDM is to divide a broadband...
Alamouti code
Since April of 2021 Purchased: 0 times 4
Orthogonal space-time block codes
4.1 Introduction
In this section, we study the design of space-time block codes (STBCs) to transmit information over a multiple antenna wireless communication...
Wireless applications
Since April of 2021 Purchased: 0 times 2 Introduction
while keeping the transmission power intact. Most of the book discusses differ-
ent space-time coding methods in detail. The detailed discussion of...
Super orthogonal space time trellis codes
Since April of 2021 Purchased: 0 times 7
Super-orthogonal space-time trellis codes
7.1 Motivation
STBCs provide full diversity and small decoding complexity. STBCs...
Transmission model for multiple input multiple output
Since April of 2021 Purchased: 0 times 2
Capacity of multiple-input multiple-output channels
2.1 Transmission model for multiple-input multiple-output channels
We consider a communication system,...
Wireless channels
Since April of 2021 Purchased: 0 times 1.3 Wireless channels 5
Fig. 1.1. An example of different paths in a wireless channel.
to the topic, as it is needed in our...
Symmetric homogeneous means
Since April of 2021 Purchased: 0 times 26 2 Double integral transformations
(X) sH (X)sK (H, 0)sH X(1 sK ) (1 sH )XsK (0, K)
(0, 0)(1 sH )X(1 sK ).
Proof. The equation sH ((X))sK (sH XsK ) is seen from...
Uniform bounds for norms
Since April of 2021 Purchased: 0 times 106 8 Certain alternating sums of operators
8.1 Preliminaries
For n 1, 2, and m 2, 3, we set
n
k n1k...
Ubiquity of the Distance Function in Mathematical Morphology
Since April of 2021 Purchased: 0 times Ubiquity of the Distance Function in Mathematical Morphology
Distance Function: a Historical Tool Distance has been the key notion for usual Euclidean geometry and the definition of geometrical...