We analyze wireless communication systems employing multiple-transmit multiplereceive antennas in this thesis. Space-time codes have been proposed in the literature as an e cient means of coding over multiple transmit antennas. In particular, the rank and the determinant of code di erence matrices have been shown to be important in the design of space time codes in quasi-static fading channels....

We give lower bounds on the largest singular value of arbitrary matrices, some of which are asymptotically tight for almost all matrices. To study when these bounds are exact, we introduce several combinatorial concepts. In particular, we introduce regular, pseudo-regular, and almost regular matrices. Nonnegative, symmetric, almost regular matrices were studied earlier by Hoffman, Wolfe, and Ho...

We give lower bounds on the largest singular value of arbitrary matrices, some of which are asymptotically tight for almost all matrices. To study when these bounds are exact, we introduce several combinatorial concepts. In particular, we introduce regular, pseudo-regular, and almost regular matrices. Nonnegative, symmetric, almost regular matrices were studied earlier by Ho¤man, Wolfe, and Ho¤...

Imposing structure on the Smith form of an (integer) periodicity matrix N = U V leads to e cient m-D DFT implementations. For resampling matrices, i.e. non-singular rational matrices, we introduce Smith form decomposition algorithms to generate matrices whose diagonal elements exhibit minimum variance and U matrices with minimum norm. Such structure simpli es non-uniform m-D lter bank design.