A Low-Complexity Design of Linear Precoding for MIMO Channels with Finite-Alphabet Inputs

This paper investigates linear precoding scheme that maximizes mutual information for multiple-input multiple-output (MIMO) channels with finite-alphabet inputs. In contrast with recent studies, optimizing mutual information directly with extensive computational burden, this work proposes a low-comp...

Full description

Saved in:
Bibliographic Details
Published in:IEEE wireless communications letters Vol. 1; no. 1; pp. 38 - 41
Main Authors: Zeng, Weiliang, Xiao, Chengshan, Lu, Jianhua
Format: Journal Article
Language:English
Published: IEEE 01.02.2012
Subjects:
ISSN:2162-2337, 2162-2345
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract This paper investigates linear precoding scheme that maximizes mutual information for multiple-input multiple-output (MIMO) channels with finite-alphabet inputs. In contrast with recent studies, optimizing mutual information directly with extensive computational burden, this work proposes a low-complexity and high-performance design. It derives a lower bound that demands low computational effort and approximates, with a constant shift, the mutual information for various settings. Based on this bound, the precoding problem is solved efficiently. Numerical examples show the efficacy of this method for constant and fading MIMO channels. Compared to its conventional counterparts, the proposed method reduces the computational complexity without performance loss.
AbstractList This paper investigates linear precoding scheme that maximizes mutual information for multiple-input multiple-output (MIMO) channels with finite-alphabet inputs. In contrast with recent studies, optimizing mutual information directly with extensive computational burden, this work proposes a low-complexity and high-performance design. It derives a lower bound that demands low computational effort and approximates, with a constant shift, the mutual information for various settings. Based on this bound, the precoding problem is solved efficiently. Numerical examples show the efficacy of this method for constant and fading MIMO channels. Compared to its conventional counterparts, the proposed method reduces the computational complexity without performance loss.
Author Chengshan Xiao
Jianhua Lu
Weiliang Zeng
Author_xml – sequence: 1
  givenname: Weiliang
  surname: Zeng
  fullname: Zeng, Weiliang
– sequence: 2
  givenname: Chengshan
  surname: Xiao
  fullname: Xiao, Chengshan
– sequence: 3
  givenname: Jianhua
  surname: Lu
  fullname: Lu, Jianhua
BookMark eNqFkM9Kw0AQhxdRsNY-gSD7Aqn7J8km4KVEq4WUelDEU9hkJ-1Kult2V2rf3pRID16cyww_-GaG7wqdG2sAoVtKppSS_O69KKeMUDaljMaUHkPCkjM0YjRlEeNxcn6aubhEE-8_SV9pz9BshD5muLT7qLDbXQffOhzwA3i9Nti2uNQGpMMvDhqrtFnj1jq8XCxXuNhIY6DzeK_DBs-10QGiWbfbyBoCXpjdV_DX6KKVnYfJbx-jt_nja_EclaunRTEro4aJJERQM6J4xhKquIhjFQulmEyEzCjL6hYy4G3SNG0OAKLJapbnueI1USKpY8aBj1E67G2c9d5BW-2c3kp3qCipjo6q3lF1dFQNjqrBUQ_e_wEbHWTQ1gQndfc_fjPguv_sdDOlRMSc8h-Fwnce
CODEN IWCLAF
CitedBy_id crossref_primary_10_1049_iet_com_2012_0731
crossref_primary_10_1109_TVT_2015_2453990
crossref_primary_10_1109_TVT_2022_3217804
crossref_primary_10_1109_TVT_2019_2930071
crossref_primary_10_1109_TCOMM_2018_2790402
crossref_primary_10_1109_ACCESS_2018_2841027
crossref_primary_10_1109_TCOMM_2024_3439436
crossref_primary_10_1109_TWC_2021_3125954
crossref_primary_10_1109_LSP_2015_2416258
crossref_primary_10_1109_TCOMM_2017_2716375
crossref_primary_10_1109_TCOMM_2024_3383102
crossref_primary_10_1109_TWC_2018_2810072
crossref_primary_10_1109_TCOMM_2016_2598836
crossref_primary_10_1109_TCOMM_2017_2695598
crossref_primary_10_1109_LCOMM_2020_3011978
crossref_primary_10_1109_TWC_2019_2920822
crossref_primary_10_1109_TWC_2014_2382125
crossref_primary_10_1109_TCOMM_2019_2934054
crossref_primary_10_1109_TCOMM_2024_3356445
crossref_primary_10_1109_JSAC_2012_121103
crossref_primary_10_1109_TCOMM_2022_3150416
crossref_primary_10_1109_WCL_2013_050613_120923
crossref_primary_10_1109_TVT_2017_2717925
crossref_primary_10_1109_TVT_2024_3384959
crossref_primary_10_1109_TWC_2020_3004497
crossref_primary_10_1109_ACCESS_2019_2917978
crossref_primary_10_1109_TWC_2021_3109735
crossref_primary_10_1109_TCCN_2024_3435877
crossref_primary_10_1109_TCOMM_2023_3287536
crossref_primary_10_1109_TVT_2024_3508819
crossref_primary_10_1109_TVT_2021_3083887
crossref_primary_10_1109_LCOMM_2018_2890242
crossref_primary_10_1016_j_sigpro_2022_108649
crossref_primary_10_1109_TWC_2022_3143543
crossref_primary_10_1109_TWC_2022_3145288
crossref_primary_10_1109_LCOMM_2015_2446976
crossref_primary_10_1109_LWC_2019_2919687
crossref_primary_10_1109_ACCESS_2019_2894873
crossref_primary_10_1109_TCOMM_2019_2899628
crossref_primary_10_1007_s11277_017_4194_3
crossref_primary_10_1016_j_phycom_2021_101402
crossref_primary_10_1109_TVT_2017_2712774
crossref_primary_10_1109_JPROC_2018_2848363
crossref_primary_10_1109_TCOMM_2022_3204659
crossref_primary_10_1109_TVT_2013_2264688
crossref_primary_10_1109_TVT_2022_3213752
crossref_primary_10_1109_TVT_2019_2935476
crossref_primary_10_1016_j_dsp_2017_12_010
crossref_primary_10_1109_TVT_2017_2778005
crossref_primary_10_1109_TWC_2017_2700308
crossref_primary_10_1109_ACCESS_2019_2925939
crossref_primary_10_1109_TCOMM_2020_3035233
crossref_primary_10_1109_ACCESS_2020_3027548
crossref_primary_10_1109_LWC_2025_3528826
crossref_primary_10_1109_TVT_2024_3382319
crossref_primary_10_1109_JIOT_2022_3211022
crossref_primary_10_1109_TCOMM_2019_2920645
crossref_primary_10_1109_ACCESS_2017_2671878
crossref_primary_10_1109_LCOMM_2022_3215712
crossref_primary_10_1109_TWC_2014_2374593
crossref_primary_10_1109_TSP_2015_2500880
crossref_primary_10_1109_TWC_2012_122212_120324
crossref_primary_10_1109_TCOMM_2015_2388584
crossref_primary_10_1109_ACCESS_2020_2991342
Cites_doi 10.1017/CBO9780511804441
10.1109/TSP.2011.2140112
10.1109/TWC.2003.808970
10.1109/TIT.2009.2039045
10.1109/JSAC.2003.810294
10.1109/MSP.2007.904811
10.1109/TIT.2011.2104491
10.1109/TIT.2005.844072
10.1109/TIT.2006.876220
ContentType Journal Article
DBID 97E
RIA
RIE
AAYXX
CITATION
DOI 10.1109/WCL.2012.121411.110025
DatabaseName IEEE All-Society Periodicals Package (ASPP) 2005–Present
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE Electronic Library (IEL)
CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 2162-2345
EndPage 41
ExternalDocumentID 10_1109_WCL_2012_121411_110025
6107431
Genre orig-research
GroupedDBID 0R~
4.4
5VS
6IK
97E
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABQJQ
ABVLG
AGQYO
AGSQL
AHBIQ
AKJIK
AKQYR
ALMA_UNASSIGNED_HOLDINGS
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
EBS
EJD
IES
IFIPE
IPLJI
JAVBF
M43
OCL
RIA
RIE
RNS
AAYXX
CITATION
ID FETCH-LOGICAL-c275t-eb20d38251d3744d47dd2a57a8128bfe8e3f5ccf9eee7c8b2999d3b0d75b423e3
IEDL.DBID RIE
ISICitedReferencesCount 88
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000209695900010&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 2162-2337
IngestDate Tue Nov 18 22:35:47 EST 2025
Sat Nov 29 06:26:09 EST 2025
Tue Aug 26 17:18:59 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 1
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c275t-eb20d38251d3744d47dd2a57a8128bfe8e3f5ccf9eee7c8b2999d3b0d75b423e3
PageCount 4
ParticipantIDs ieee_primary_6107431
crossref_citationtrail_10_1109_WCL_2012_121411_110025
crossref_primary_10_1109_WCL_2012_121411_110025
PublicationCentury 2000
PublicationDate 2012-February
2012-02-00
PublicationDateYYYYMMDD 2012-02-01
PublicationDate_xml – month: 02
  year: 2012
  text: 2012-February
PublicationDecade 2010
PublicationTitle IEEE wireless communications letters
PublicationTitleAbbrev LWC
PublicationYear 2012
Publisher IEEE
Publisher_xml – name: IEEE
References ref8
ref7
gradshteyn (ref9) 2007
ref4
ref3
ref6
ref10
ref5
ref2
ref1
References_xml – ident: ref10
  doi: 10.1017/CBO9780511804441
– ident: ref6
  doi: 10.1109/TSP.2011.2140112
– ident: ref1
  doi: 10.1109/TWC.2003.808970
– ident: ref4
  doi: 10.1109/TIT.2009.2039045
– ident: ref2
  doi: 10.1109/JSAC.2003.810294
– ident: ref3
  doi: 10.1109/MSP.2007.904811
– ident: ref5
  doi: 10.1109/TIT.2011.2104491
– year: 2007
  ident: ref9
  publication-title: Table of Integrals Series and Products
– ident: ref7
  doi: 10.1109/TIT.2005.844072
– ident: ref8
  doi: 10.1109/TIT.2006.876220
SSID ssj0000601218
Score 2.2683961
Snippet This paper investigates linear precoding scheme that maximizes mutual information for multiple-input multiple-output (MIMO) channels with finite-alphabet...
SourceID crossref
ieee
SourceType Enrichment Source
Index Database
Publisher
StartPage 38
SubjectTerms Fading
finite-alphabet inputs
Linear precoder
low-complexity design
MIMO
Mutual information
mutual information maximization
Optimization
Phase shift keying
Signal to noise ratio
Vectors
Title A Low-Complexity Design of Linear Precoding for MIMO Channels with Finite-Alphabet Inputs
URI https://ieeexplore.ieee.org/document/6107431
Volume 1
WOSCitedRecordID wos000209695900010&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVIEE
  databaseName: IEEE Electronic Library (IEL)
  customDbUrl:
  eissn: 2162-2345
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000601218
  issn: 2162-2337
  databaseCode: RIE
  dateStart: 20120101
  isFulltext: true
  titleUrlDefault: https://ieeexplore.ieee.org/
  providerName: IEEE
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8NAEF7a4kEPvqpYX-zBo2s3m8cmx1ItFtrag2I9hX0FCpKWNlX89-5sYuhBEG9hyW4e34ZvZjLfDEI39lv2E8U4EYZSEiRMEJFpUIGEzKhQSSGkazbBJ5N4NkumDXRba2GMMS75zNzBofuXrxdqA6GybuQ5wmuiJudRqdWq4ylQV4S5cB7zInst3-eVINijSfe1P4I0LgbFFALPg0EK3bG3uGiruYrjlsHB_-7qEO1XNiTulaAfoYbJj9HeVmXBNnrr4dHik8DXDhUviy9871I18CLD1v202xtPwRcG5sLWbsXj4fgJg9Qgt2SJITqLB3OwR0kP1LjSFHiYLzfF-gS9DB6e-4-k6qJALARhQazrTLUPClXt8yDQAdeaiZALS-2xzExs_CxUKkvsg3EVS8tPifYl1TyU1tYy_ilq5YvcnCEci0BY-yaKYKVISms7ChMzLZihgtGsg8Kf95mqqsQ4dLp4T52rQZPU4pACDmmJQ1ri0EHdet6yLLLx54w2AFGfXWFw_vvwBdqFJcpk60vUKlYbc4V21EcxX6-u3T76Buz_wt4
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8NAEB60CurBt1ife_Bo7GbzPha1WEyrh4r1FPYVECQRTRX_vTubGHoQxFtYspvHt-Gbmcw3A3BmvmUvkSxyuKbU8RPGHZ4rVIEETMtACs6FbTYRjcfxdJrcL8B5q4XRWtvkM32Bh_ZfvirlDENlvdC1hLcIS4HvM1qrtdqIClYWYTagx9zQXM3zokYS7NKk93iZYiIXw3IKvuviIMX-2HNsNNdexbLLYON_97UJ640VSfo17FuwoIttWJurLbgDT32Slp8Ofu9Y87L6Ilc2WYOUOTEOqNng5B69YeQuYixXMhqO7giKDQpDlwTjs2TwjBap00c9rtAVGRavs-p9Fx4G15PLG6fpo-AYEILKMc4zVR5qVJUX-b7yI6UYDyJuyD0WuY61lwdS5ol5sEjGwjBUojxBVRQIY21pbw86RVnofSAx97mxcMIQVwqFMNYj1zFTnGnKGc27EPy8z0w2Rcax18VLZp0NmmQGhwxxyGocshqHLvTaea91mY0_Z-wgEO3ZDQYHvw-fwsrNZJRm6XB8ewiruFyden0Eneptpo9hWX5Uz-9vJ3ZPfQNATsYl
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+Low-Complexity+Design+of+Linear+Precoding+for+MIMO+Channels+with+Finite-Alphabet+Inputs&rft.jtitle=IEEE+wireless+communications+letters&rft.au=Weiliang+Zeng&rft.au=Chengshan+Xiao&rft.au=Jianhua+Lu&rft.date=2012-02-01&rft.pub=IEEE&rft.issn=2162-2337&rft.volume=1&rft.issue=1&rft.spage=38&rft.epage=41&rft_id=info:doi/10.1109%2FWCL.2012.121411.110025&rft.externalDocID=6107431
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2162-2337&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2162-2337&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2162-2337&client=summon