Joohwan Chun

Fast Parallel Algorithms for QR and Triangular Factorization

We present a family of new fast algorithms for QR factorization of certain structured matrices, including rectangular Toeplitz matrices and a variety of other Toeplitz-like matrices. It possesses a very regular structure, and appears to be very convenient for parallel implementation. Moreover it is shown that the same architecture can be used for either triangular factorization or QR factorization. Our approach separates the conceptual and implementational aspects of the problem. Our analysis reveals a variety of algorithmic implementations of the basic procedure, all with potentially different numerical properties that need further examination.Our approach is based on the observations that the matrix

Generalized Displacement Structure for Block-Toeplitz,Toeplitz-Block, and Toeplitz-Derived Matrices

{\bf R}

Achievable Sum-Rate Maximizing AF Relay Beamforming Scheme in Two-Way Relay Channels

in

Asymptotic Capacity of the Separated MIMO Two-Way Relay Channel

{\bf A} = {\bf {QR}}

Linear Precoder and Decoder Design for Two-Way AF MIMO Relaying System

is the Cholesky factor of

Modified High-Order PAMs for Binary Coded Physical-Layer Network Coding

{\bf A}^T {\bf A}

Optimal Lattice-Reduction Aided Successive Interference Cancellation for MIMO Systems

and that fast algorithms for Cholesky factorization of positive definite Toeplitz and certain “close-to-Toeplitz” matrices are readily obtained via a so-called displacement representation of matrices. In this paper we show that if

About a MoirÉ-Less Condition for Non-Square Grids

{\bf A}

Symbol detection in V-BLAST architectures under channel estimation errors

is Toeplitz or is expressed in suitable displacement form then

Study of growth rate and failure mode of chemically vapour deposited TiN, TiCxNy and TiC on cemented tungsten carbide

{\bf A}^T {\bf A}