FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2108651121> ?p ?o ?g. }

• W2108651121 abstract "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." @default.
• W2108651121 created "2016-06-24" @default.
• W2108651121 creator A5004976101 @default.
• W2108651121 date "2013-01-01" @default.
• W2108651121 modified "2023-09-26" @default.
• W2108651121 title "Transceiver Designs and Analysis for LTI, LTV and Broadcast Channels - New Matrix Decompositions and Majorization Theory" @default.
• W2108651121 cites W1481646516 @default.
• W2108651121 cites W1488435683 @default.
• W2108651121 cites W1507039213 @default.
• W2108651121 cites W1538961851 @default.
• W2108651121 cites W1542278698 @default.
• W2108651121 cites W1576347883 @default.
• W2108651121 cites W1602659231 @default.
• W2108651121 cites W1603604912 @default.
• W2108651121 cites W1813834645 @default.
• W2108651121 cites W1873519168 @default.
• W2108651121 cites W1976772748 @default.
• W2108651121 cites W1977132383 @default.
• W2108651121 cites W1977271127 @default.
• W2108651121 cites W1980502833 @default.
• W2108651121 cites W1982360330 @default.
• W2108651121 cites W1997176148 @default.
• W2108651121 cites W1997834106 @default.
• W2108651121 cites W2006309149 @default.
• W2108651121 cites W2016108003 @default.
• W2108651121 cites W2017058410 @default.
• W2108651121 cites W2021340904 @default.
• W2108651121 cites W2024318675 @default.
• W2108651121 cites W2025689464 @default.
• W2108651121 cites W2029435453 @default.
• W2108651121 cites W2049285480 @default.
• W2108651121 cites W2049569101 @default.
• W2108651121 cites W2051742223 @default.
• W2108651121 cites W2055089340 @default.
• W2108651121 cites W2079488346 @default.
• W2108651121 cites W2082819064 @default.
• W2108651121 cites W2095914596 @default.
• W2108651121 cites W2097183892 @default.
• W2108651121 cites W2098174516 @default.
• W2108651121 cites W2098244585 @default.
• W2108651121 cites W2100335971 @default.
• W2108651121 cites W2100345042 @default.
• W2108651121 cites W2101110894 @default.
• W2108651121 cites W2103091915 @default.
• W2108651121 cites W2104013896 @default.
• W2108651121 cites W2104057862 @default.
• W2108651121 cites W2105192384 @default.
• W2108651121 cites W2105683995 @default.
• W2108651121 cites W2106166897 @default.
• W2108651121 cites W2113165941 @default.
• W2108651121 cites W2113638573 @default.
• W2108651121 cites W2114004090 @default.
• W2108651121 cites W2114043910 @default.
• W2108651121 cites W2115755118 @default.
• W2108651121 cites W2118067723 @default.
• W2108651121 cites W2118155052 @default.
• W2108651121 cites W2118267334 @default.
• W2108651121 cites W2119726820 @default.
• W2108651121 cites W2120435222 @default.
• W2108651121 cites W2121051729 @default.
• W2108651121 cites W2122128483 @default.
• W2108651121 cites W2122727481 @default.
• W2108651121 cites W2123008867 @default.
• W2108651121 cites W2124029382 @default.
• W2108651121 cites W2124300121 @default.
• W2108651121 cites W2125716579 @default.
• W2108651121 cites W2127737376 @default.
• W2108651121 cites W2128133840 @default.
• W2108651121 cites W2129788226 @default.
• W2108651121 cites W2129994137 @default.
• W2108651121 cites W2132818688 @default.
• W2108651121 cites W2133475491 @default.
• W2108651121 cites W2135288797 @default.
• W2108651121 cites W2136526740 @default.
• W2108651121 cites W2139940560 @default.
• W2108651121 cites W2141658588 @default.
• W2108651121 cites W2142232614 @default.
• W2108651121 cites W2144433515 @default.
• W2108651121 cites W2149587304 @default.
• W2108651121 cites W2149684933 @default.
• W2108651121 cites W2150630209 @default.
• W2108651121 cites W2150727869 @default.
• W2108651121 cites W2151262405 @default.
• W2108651121 cites W2152660369 @default.
• W2108651121 cites W2153856430 @default.
• W2108651121 cites W2154395274 @default.
• W2108651121 cites W2154602108 @default.
• W2108651121 cites W2156427903 @default.
• W2108651121 cites W2156779572 @default.
• W2108651121 cites W2157195543 @default.
• W2108651121 cites W2157326466 @default.
• W2108651121 cites W2159399605 @default.
• W2108651121 cites W2160432600 @default.
• W2108651121 cites W2162667926 @default.
• W2108651121 cites W2164218958 @default.
• W2108651121 cites W2164514900 @default.
• W2108651121 cites W2164848020 @default.
• W2108651121 cites W2165350939 @default.
• W2108651121 cites W2166772722 @default.
• W2108651121 cites W2171674912 @default.

• next