13.07.2015 Views

Praise for Fundamentals of WiMAX

Praise for Fundamentals of WiMAX

Praise for Fundamentals of WiMAX

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

168 Chapter 5 • Multiple-Antenna TechniquesSidebar 5.1 A Brief Primer on Matrix TheoryAs this chapter indicates, linear algebra and matrix analysis are an inseparable part <strong>of</strong>MIMO theory. Matrix theory is also useful in understanding OFDM. In this book, wehave tried to keep all the matrix notation as standard as possible, so that any appropriatereference will be capable <strong>of</strong> clarifying any <strong>of</strong> the presented equations.In this sidebar, we simply define some <strong>of</strong> the more important notation <strong>for</strong> clarity.First, in this chapter, two types <strong>of</strong> transpose operations are used. The first is the conventionaltranspose A T , which is defined asTA ij=A jithat is, only the rows and columns are reversed. The second type <strong>of</strong> transpose is the conjugatetranspose, which is defined as*A ij=( ) * .A jiThat is, in addition to exchanging rows with columns, each term in the matrix isreplaced with its complex conjugate. If all the terms in A are real, A T = A * . Sometimes,the conjugate transpose is called the Hermitian transpose and denoted as A H . They areequivalent.Another recurring theme is matrix decomposition—specifically, the eigendecompositionand the singular-value decomposition, which are related to each other. If a matrix issquare and diagonalizable (M × M), it has the eigendecompositionA = TΛT –1 ,where T contains the (right) eigenvectors <strong>of</strong> A, and Λ = diag[λ 1 λ 2 ... λ M ] is a diagonalmatrix containing the eigenvalues <strong>of</strong> A. T is invertible as long as A is symmetric or hasfull rank (M nonzero eigenvalues).When the eigendecomposition does not exist, either because A is not square or <strong>for</strong>the preceding reasons, a generalization <strong>of</strong> matrix diagonalization is the singular-valuedecomposition, which is defined asA = UΣV * ,where U is M × r, V is N × r, and Σ is r × r, and the rank <strong>of</strong> A—the number <strong>of</strong> nonzerosingular values—is r. Although U and V are no longer inverses <strong>of</strong> each other as in eigendecomposition,they are both unitary—U*U = V*V = UU* = VV* = I—which meansthat they have orthonormal columns and rows. The singular values <strong>of</strong> A can be related toeigenvalues <strong>of</strong> A*A byσ i ( A) = λ i ( A*A).Because T –1 is not unitary, it is not possible to find a more exact relation between the singularvalues and eigenvalues <strong>of</strong> a matrix, but these values generally are <strong>of</strong> the same order,since the eigenvalues <strong>of</strong> A*A are on the order <strong>of</strong> the square <strong>of</strong> those <strong>of</strong> A.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!