Transceiver designs and analysis for LTI, LTV and broadcast channels - new matrix decompositions and majorization theory

Signal processing techniques play important roles in the design of digital communication systems. These include information manipulation, transmitter signal processing, channel estimation, channel equalization and receiver signal processing. By interacting with communication theory and system implementing technologies, signal processing specialists develop efficient schemes for various communication problems by wisely exploiting various mathematical tools such as analysis, probability theory, matrix theory, optimization theory, and many others. In recent years, researchers realized that multiple-input multiple-output (MIMO) channel models are applicable to a wide range of different physical communications channels. Using the elegant matrix-vector notations, many MIMO transceiver (including the precoder and equalizer) design problems can be solved by matrix and optimization theory. Furthermore, the researchers showed that the majorization theory and matrix decompositions, such as singular value decomposition (SVD), geometric mean decomposition (GMD) and generalized triangular decomposition (GTD), provide unified frameworks for solving many of the point-to-point MIMO transceiver design problems.

In this thesis, we consider the transceiver design problems for linear time invariant (LTI) flat MIMO channels, linear time-varying narrowband MIMO channels, flat MIMO broadcast channels, and doubly selective scalar channels. Additionally, the channel estimation problem is also considered. The main contributions of this dissertation are the development of new matrix decompositions, and the uses of the matrix decompositions and majorization theory toward the practical transmit-receive scheme designs for transceiver optimization problems. Elegant solutions are obtained, novel transceiver structures are developed, ingenious algorithms are proposed, and performance analyses are derived.

The first part of the thesis focuses on transceiver design with LTI flat MIMO channels. We propose a novel matrix decomposition which decomposes a complex matrix as a product of several sets of semi-unitary matrices and upper triangular matrices in an iterative manner. The complexity of the new decomposition, generalized geometric mean decomposition (GGMD), is always less than or equal to that of geometric mean decomposition (GMD). The optimal GGMD parameters which yield the minimal complexity are derived. Based on the channel state information (CSI) at both the transmitter (CSIT) and receiver (CSIR), GGMD is used to design a butterfly structured decision feedback equalizer (DFE) MIMO transceiver which achieves the minimum average mean square error (MSE) under the total transmit power constraint. A novel iterative receiving detection algorithm for the specific receiver is also proposed. For the application to cyclic prefix (CP) systems in which the SVD of the equivalent channel matrix can be easily computed, the proposed GGMD transceiver has K/log_2(K) times complexity advantage over the GMD transceiver, where K is the number of data symbols per data block and is a power of 2. The performance analysis shows that the GGMD DFE transceiver can convert a MIMO channel into a set of parallel subchannels with the same bias and signal to interference plus noise ratios (SINRs). Hence, the average bit rate error (BER) is automatically minimized without the need for bit allocation. Moreover, the proposed transceiver can achieve the channel capacity simply by applying independent scalar Gaussian codes of the same rate at subchannels.

In the second part of the thesis, we focus on MIMO transceiver design for slowly time-varying MIMO channels with zero-forcing or MMSE criterion. Even though the GGMD/GMD DFE transceivers work for slowly time-varying MIMO channels by exploiting the instantaneous CSI at both ends, their performance is by no means optimal since the temporal diversity of the time-varying channels is not exploited. Based on the GTD, we develop space-time GTD (ST-GTD) for the decomposition of linear time-varying flat MIMO channels. Under the assumption that CSIT, CSIR and channel prediction are available, by using the proposed ST-GTD, we develop space-time geometric mean decomposition (ST-GMD) DFE transceivers under the zero-forcing or MMSE criterion. Under perfect channel prediction, the new system minimizes both the average MSE at the detector in each space-time (ST) block (which consists of several coherence blocks), and the average per ST-block BER in the moderate high SNR region. Moreover, the ST-GMD DFE transceiver designed under an MMSE criterion maximizes Gaussian mutual information over the equivalent channel seen by each ST-block. In general, the newly proposed transceivers perform better than the GGMD-based systems since the super-imposed temporal precoder is able to exploit the temporal diversity of time-varying channels. For practical applications, a novel ST-GTD based system which does not require channel prediction but shares the same asymptotic BER performance with the ST-GMD DFE transceiver is also proposed.

The third part of the thesis considers two quality of service (QoS) transceiver design problems for flat MIMO broadcast channels. The first one is the power minimization problem (min-power) with a total bitrate constraint and per-stream BER constraints. The second problem is the rate maximization problem (max-rate) with a total transmit power constraint and per-stream BER constraints. Exploiting a particular class of joint triangularization (JT), we are able to jointly optimize the bit allocation and the broadcast DFE transceiver for the min-power and max-rate problems. The resulting optimal designs are called the minimum power JT broadcast DFE transceiver (MPJT) and maximum rate JT broadcast DFE transceiver (MRJT), respectively. In addition to the optimal designs, two suboptimal designs based on QR decomposition are proposed. They are realizable for arbitrary number of users.

Finally, we investigate the design of a discrete Fourier transform (DFT) modulated filterbank transceiver (DFT-FBT) with LTV scalar channels. For both cases with known LTV channels and unknown wide sense stationary uncorrelated scattering (WSSUS) statistical channels, we show how to optimize the transmitting and receiving prototypes of a DFT-FBT such that the SINR at the receiver is maximized. Also, a novel pilot-aided subspace channel estimation algorithm is proposed for the orthogonal frequency division multiplexing (OFDM) systems with quasi-stationary multi-path Rayleigh fading channels. Using the concept of a difference co-array, the new technique can construct M^2 co-pilots from M physical pilot tones with alternating pilot placement. Subspace methods, such as MUSIC and ESPRIT, can be used to estimate the multipath delays and the number of identifiable paths is up to O(M^2), theoretically. With the delay information, a MMSE estimator for frequency response is derived. It is shown through simulations that the proposed method outperforms the conventional subspace channel estimator when the number of multipaths is greater than or equal to the number of physical pilots minus one.

Geometric integration applied to moving mesh methods and degenerate Lagrangians

Moving mesh methods (also called r-adaptive methods) are space-adaptive strategies used for the numerical simulation of time-dependent partial differential equations. These methods keep the total number of mesh points fixed during the simulation, but redistribute them over time to follow the areas where a higher mesh point density is required. There are a very limited number of moving mesh methods designed for solving field-theoretic partial differential equations, and the numerical analysis of the resulting schemes is challenging. In this thesis we present two ways to construct r-adaptive variational and multisymplectic integrators for (1+1)-dimensional Lagrangian field theories. The first method uses a variational discretization of the physical equations and the mesh equations are then coupled in a way typical of the existing r-adaptive schemes. The second method treats the mesh points as pseudo-particles and incorporates their dynamics directly into the variational principle. A user-specified adaptation strategy is then enforced through Lagrange multipliers as a constraint on the dynamics of both the physical field and the mesh points. We discuss the advantages and limitations of our methods. The proposed methods are readily applicable to (weakly) non-degenerate field theories---numerical results for the Sine-Gordon equation are presented.

In an attempt to extend our approach to degenerate field theories, in the last part of this thesis we construct higher-order variational integrators for a class of degenerate systems described by Lagrangians that are linear in velocities. We analyze the geometry underlying such systems and develop the appropriate theory for variational integration. Our main observation is that the evolution takes place on the primary constraint and the 'Hamiltonian' equations of motion can be formulated as an index 1 differential-algebraic system. We then proceed to construct variational Runge-Kutta methods and analyze their properties. The general properties of Runge-Kutta methods depend on the 'velocity' part of the Lagrangian. If the 'velocity' part is also linear in the position coordinate, then we show that non-partitioned variational Runge-Kutta methods are equivalent to integration of the corresponding first-order Euler-Lagrange equations, which have the form of a Poisson system with a constant structure matrix, and the classical properties of the Runge-Kutta method are retained. If the 'velocity' part is nonlinear in the position coordinate, we observe a reduction of the order of convergence, which is typical of numerical integration of DAEs. We also apply our methods to several models and present the results of our numerical experiments.

Equivalent differential equations for nonlinear dynamical systems

A technique for obtaining approximate periodic solutions to nonlinear ordinary differential equations is investigated. The approach is based on defining an equivalent differential equation whose exact periodic solution is known. Emphasis is placed on the mathematical justification of the approach. The relationship between the differential equation error and the solution error is investigated, and, under certain conditions, bounds are obtained on the latter. The technique employed is to consider the equation governing the exact solution error as a two point boundary value problem. Among other things, the analysis indicates that if an exact periodic solution to the original system exists, it is always possible to bound the error by selecting an appropriate equivalent system.

Three equivalence criteria for minimizing the differential equation error are compared, namely, minimum mean square error, minimum mean absolute value error, and minimum maximum absolute value error. The problem is analyzed by way of example, and it is concluded that, on the average, the minimum mean square error is the most appropriate criterion to use.

A comparison is made between the use of linear and cubic auxiliary systems for obtaining approximate solutions. In the examples considered, the cubic system provides noticeable improvement over the linear system in describing periodic response.

A comparison of the present approach to some of the more classical techniques is included. It is shown that certain of the standard approaches where a solution form is assumed can yield erroneous qualitative results.

Electromagnetic wave propagation and scattering in a randomly-inhomogeneous dielectric sphere

Electromagnetic wave propagation and scattering in a sphere composed of an inhomogeneous medium having random variations in its permittivity are studied by utilizing the Born approximation in solving the vector wave equation. The variations in the permittivity are taken to be isotropic and homogeneous, and are spatially characterized by a Gaussian correlation function. Temporal variations in the medium are not considered.

Two particular problems are considered: i) finding the far-zone electric field when an electric or magnetic dipole is situated at the center of the sphere, and ii) finding the electric field at the sphere's center when a linearly polarized plane wave is incident upon it. Expressions are obtained for the mean-square magnitudes of the scattered field components; it is found that the mean of the product of any two transverse components vanishes. The cases where the wavelength is much shorter than correlation distance of the medium and where it is much longer than it are both considered.

Nuclear hyperfine interactions in W^(182), W^(183), and Pt^(195) as studies by the Mossbauer effect

The Mössbauer technique has been used to study the nuclear hyperfine interactions and lifetimes in W¹⁸² (2⁺ state) and W¹⁸³ (3/2^- and 5/2^- states) with the following results: g(5/2^-)/g(2⁺) = 1.40 ± 0.04; g(3/2^- = -0.07 ± 0.07; Q(5/2^-)/Q(2⁺) = 0.94 ± 0.04; T_1/2(3/2^-) = 0.184 ± 0.005 nsec; T_1/2(5/2^-) >̰ 0.7 nsec. These quantities are discussed in terms of a rotation-particle interaction in W¹⁸³ due to Coriolis coupling. From the measured quantities and additional information on γ-ray transition intensities magnetic single-particle matrix elements are derived. It is inferred from these that the two effective g-factors, resulting from the Nilsson-model calculation of the single-particle matrix elements for the spin operators ŝ_z and ŝ₊, are not equal, consistent with a proposal of Bochnacki and Ogaza.

The internal magnetic fields at the tungsten nucleus were determined for substitutional solid solutions of tungsten in iron, cobalt, and nickel. With g(2⁺) = 0.24 the results are: |H_eff(W-Fe)| = 715 ± 10 kG; |H_eff(W-Co)| = 360 ± 10 kG; |H_eff(W-Ni)| = 90 ± 25 kG. The electric field gradients at the tungsten nucleus were determined for WS₂ and WO₃. With Q(2⁺) = -1.81b the results are: for WS₂, eq = -(1.86 ± 0.05) 10¹⁸ V/cm²; for WO₃, eq = (1.54 ± 0.04) 10¹⁸ V/cm² and ƞ = 0.63 ± 0.02.

The 5/2^- state of Pt¹⁹⁵ has also been studied with the Mössbauer technique, and the g-factor of this state has been determined to be -0.41 ± 0.03. The following magnetic fields at the Pt nucleus were found: in an Fe lattice, 1.19 ± 0.04 MG; in a Co lattice, 0.86 ± 0.03 MG; and in a Ni lattice, 0.36 ± 0.04 MG. Isomeric shifts have been detected in a number of compounds and alloys and have been interpreted to imply that the mean square radius of the Pt¹⁹⁵ nucleus in the first-excited state is smaller than in the ground state.

Isotope shift studies in the rare earths and lead

Isotope shifts of K_α1 x-ray transitions were measured for the Neodymium isotopes Nd 142, 143, 144, 145, 146, 148 and 150, the Samarium isotopes Sm 147, 148, 149, 150, 152 and 154, the Gadolinium isotopes Gd 154, 155, 156, 157, 158 and 160, the Dysprosium isotopes Dy 162 and 164, the Erbium isotopes Er 166, 168 and 170, the Hafnium isotopes Hf 178 and 180 and the Lead isotopes Pb 204, 206, 207 and 208. A curved crystal Cauchois spectrometer was used. The analysis of the measurement furnished the variation of the mean square charge radius of the nucleus, δ˂r²˃, for 23 isotope pairs. The experimental results were compared with theoretical values from nuclear models. Combining the x-ray shifts and the optical shifts in Nd and Sm yielded the optical mass shifts. An anomaly was observed in the odd-even shifts when the optical and the x-ray shifts were plotted against each other.