SwePub
Tyck till om SwePub Sök här!
Sök i SwePub databas

  Extended search

Träfflista för sökning "L773:0018 9448 OR L773:0018 9448 srt2:(2010-2013);lar1:(liu)"

Search: L773:0018 9448 OR L773:0018 9448 > (2010-2013) > Linköping University

  • Result 1-3 of 3
Sort/group result
   
EnumerationReferenceCoverFind
1.
  •  
2.
  • Mohammed, Saif Khan, 1977-, et al. (author)
  • MIMO Precoding with X- and Y- Codes
  • 2011
  • In: IEEE Transactions on Information Theory. - New Jersey, USA : IEEE. - 0018-9448 .- 1557-9654. ; 57:6, s. 3542-3566
  • Journal article (peer-reviewed)abstract
    • We consider a slow fading nt x nr multiple-input multiple-output (MIMO) system with channel state information (CSI) at both the transmitter and receiver. Since communication in such scenarios is subject to block fading, reception reliability, quantified in terms of the achievable diversity gain, is of importance. A simple and well known precoding scheme is based upon the singular value decomposition (SVD) of the channel matrix, which transforms the MIMO channel into parallel subchannels. Despite having low maximum likelihood decoding (MLD) complexity, this SVD based precoding scheme provides a diversity gain which is limited by the diversity gain of the weakest subchannel. We therefore propose X- and YCodes, which improve the diversity gain of the SVD precoding scheme, by jointly coding information across a pair of subchannels (i.e., pairing subchannels). In particular, subchannels with high diversity gain are paired with those having low diversitygain. A pair of subchannels is jointly encoded using a 2 x 2 real matrix, which is fixed a priori and does not change with each channel realization. For X-Codes, these matrices are 2-dimensional rotation matrices parameterized by a single angle, while for Y-Codes, these matrices are 2-dimensional upper left triangular matrices. Also, since joint coding is performed only across a pair of subchannels, the joint MLD complexity remains low. In particular, the MLD complexity of Y-Codes is even lower than that of X-Codes, and is equivalent to symbol by symbol detection. Moreover, we propose X-, Y-Precoders with the same structure as X-, Y-Codes, but with encoding matrices adapted to each channel realization. With respect to the error probability performance, the optimal encoding matrices for X-, YCodes/ Precoders are derived analytically and numerically. Whencompared to other precoding schemes reported in the literature, it is observed that X-Codes/Precoders perform better in wellconditioned channels, while Y-Codes/Precoders perform better in ill-conditioned channels.
  •  
3.
  • Mohammed, Saif Khan, 1977-, et al. (author)
  • Precoding by Pairing Subchannels to Increase MIMO Capacity with Discrete Input Alphabets
  • 2011
  • In: IEEE Transactions on Information Theory. - New Jersey, USA : IEEE. - 0018-9448 .- 1557-9654. ; 57:7, s. 4156-4169
  • Journal article (peer-reviewed)abstract
    • We consider Gaussian multiple-input multiple-output (MIMO) channels with discrete input alphabets. We propose a non-diagonal precoder based on the X-Codes in \cite{Xcodes_paper} to increase the mutual information. The MIMO channel is transformed into a set of parallel subchannels using Singular Value Decomposition (SVD) and X-Codes are then used to pair the subchannels. X-Codes are fully characterized by the pairings and a $2\times 2$ real rotation matrix for each pair (parameterized with a single angle). This precoding structure enables us to express the total mutual information as a sum of the mutual information of all the pairs. The problem of finding the optimal precoder with the above structure, which maximizes the total mutual information, is solved by {\em i}) optimizing the rotation angle and the power allocation within each pair and {\em ii}) finding the optimal pairing and power allocation among the pairs. It is shown that the mutual information achieved with the proposed pairing scheme is very close to that achieved with the optimal precoder by Cruz {\em et al.}, and is significantly better than Mercury/waterfilling strategy by Lozano {\em et al.}. Our approach greatly simplifies both the precoder optimization and the detection complexity, making it suitable for practical applications.
  •  
Skapa referenser, mejla, bekava och länka
  • Result 1-3 of 3
Type of publication
journal article (3)
Type of content
peer-reviewed (2)
other academic/artistic (1)
Author/Editor
Hong, Yi (2)
Mohammed, Saif Khan, ... (2)
Viterbo, Emanuele (2)
Chockalingam, Ananth ... (2)
Larsson, Jan-Åke (1)
Löfvenberg, Jacob (1)
University
Language
English (3)
Research subject (UKÄ/SCB)
Natural sciences (1)

Year

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view