High-throughput implementation of tree-search algorithms for vector precoding
This contribution analyzes the architecture design and FPGA implementation of high-throughput multiuser vector precoders. The most complex task of such precoders, i.e. the search of the perturbing vector over an infinite lattice, has been carried out by means of two tree search algorithms: a novel f...
Gespeichert in:
| Hauptverfasser: | , , , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 1692 |
|---|---|
| container_issue | |
| container_start_page | 1689 |
| container_title | |
| container_volume | |
| creator | Barrenechea, Maitane Barbero, Luis Jimenez, Idoia Arruti, Egoitz Mendicute, Mikel |
| description | This contribution analyzes the architecture design and FPGA implementation of high-throughput multiuser vector precoders. The most complex task of such precoders, i.e. the search of the perturbing vector over an infinite lattice, has been carried out by means of two tree search algorithms: a novel fully-pipelined complex-valued K-Best scheme and a fixed-sphere encoder (FSE). Both designs have been implemented in a Virtex-6 device, leading to precoding throughputs of up to 2.4 Gbps with 16-QAM modulation. |
| doi_str_mv | 10.1109/ICASSP.2011.5946825 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_5946825</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5946825</ieee_id><sourcerecordid>5946825</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-18ef15e917a5775d7b0d92455918521279378e0c072548e5a9299caf02013f843</originalsourceid><addsrcrecordid>eNo1kN1KAzEUhOMfWGufoDf7Aqk52T1NzqUUbYWKQhW8K3F7djeyf2RTwbd3wTo338XAMDNCzEEtABTdPa3ud7vXhVYAC6RsaTWeiRvI0BiFKZlzMdGpIQmkPi7EjIz996y6FBNAreQSMroWs2H4UqOW2hikiXje-LKSsQrdsaz6Y0x809fccBtd9F2bdEUSA7Mc2IW8SlxddsHHqhmSogvJN-dxRB847w6-LW_FVeHqgWcnTsX748PbaiO3L-txw1Z6MBglWC4AmcC4sSUezKc6kM4QCSxq0IZSY1nlymjMLKMjTZS7Qo0HpIXN0qmY_-V6Zt73wTcu_OxPz6S_9xNTEg</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>High-throughput implementation of tree-search algorithms for vector precoding</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Barrenechea, Maitane ; Barbero, Luis ; Jimenez, Idoia ; Arruti, Egoitz ; Mendicute, Mikel</creator><creatorcontrib>Barrenechea, Maitane ; Barbero, Luis ; Jimenez, Idoia ; Arruti, Egoitz ; Mendicute, Mikel</creatorcontrib><description>This contribution analyzes the architecture design and FPGA implementation of high-throughput multiuser vector precoders. The most complex task of such precoders, i.e. the search of the perturbing vector over an infinite lattice, has been carried out by means of two tree search algorithms: a novel fully-pipelined complex-valued K-Best scheme and a fixed-sphere encoder (FSE). Both designs have been implemented in a Virtex-6 device, leading to precoding throughputs of up to 2.4 Gbps with 16-QAM modulation.</description><identifier>ISSN: 1520-6149</identifier><identifier>ISBN: 9781457705380</identifier><identifier>ISBN: 1457705389</identifier><identifier>EISSN: 2379-190X</identifier><identifier>EISBN: 1457705397</identifier><identifier>EISBN: 9781457705373</identifier><identifier>EISBN: 9781457705397</identifier><identifier>EISBN: 1457705370</identifier><identifier>DOI: 10.1109/ICASSP.2011.5946825</identifier><language>eng</language><publisher>IEEE</publisher><subject>Bit error rate ; Complexity theory ; FSE ; Hardware ; Implementation ; K-Best ; Lattices ; MIMO ; Sorting ; Throughput ; Vector Precoding</subject><ispartof>2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2011, p.1689-1692</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/5946825$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5946825$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Barrenechea, Maitane</creatorcontrib><creatorcontrib>Barbero, Luis</creatorcontrib><creatorcontrib>Jimenez, Idoia</creatorcontrib><creatorcontrib>Arruti, Egoitz</creatorcontrib><creatorcontrib>Mendicute, Mikel</creatorcontrib><title>High-throughput implementation of tree-search algorithms for vector precoding</title><title>2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)</title><addtitle>ICASSP</addtitle><description>This contribution analyzes the architecture design and FPGA implementation of high-throughput multiuser vector precoders. The most complex task of such precoders, i.e. the search of the perturbing vector over an infinite lattice, has been carried out by means of two tree search algorithms: a novel fully-pipelined complex-valued K-Best scheme and a fixed-sphere encoder (FSE). Both designs have been implemented in a Virtex-6 device, leading to precoding throughputs of up to 2.4 Gbps with 16-QAM modulation.</description><subject>Bit error rate</subject><subject>Complexity theory</subject><subject>FSE</subject><subject>Hardware</subject><subject>Implementation</subject><subject>K-Best</subject><subject>Lattices</subject><subject>MIMO</subject><subject>Sorting</subject><subject>Throughput</subject><subject>Vector Precoding</subject><issn>1520-6149</issn><issn>2379-190X</issn><isbn>9781457705380</isbn><isbn>1457705389</isbn><isbn>1457705397</isbn><isbn>9781457705373</isbn><isbn>9781457705397</isbn><isbn>1457705370</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2011</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNo1kN1KAzEUhOMfWGufoDf7Aqk52T1NzqUUbYWKQhW8K3F7djeyf2RTwbd3wTo338XAMDNCzEEtABTdPa3ud7vXhVYAC6RsaTWeiRvI0BiFKZlzMdGpIQmkPi7EjIz996y6FBNAreQSMroWs2H4UqOW2hikiXje-LKSsQrdsaz6Y0x809fccBtd9F2bdEUSA7Mc2IW8SlxddsHHqhmSogvJN-dxRB847w6-LW_FVeHqgWcnTsX748PbaiO3L-txw1Z6MBglWC4AmcC4sSUezKc6kM4QCSxq0IZSY1nlymjMLKMjTZS7Qo0HpIXN0qmY_-V6Zt73wTcu_OxPz6S_9xNTEg</recordid><startdate>201105</startdate><enddate>201105</enddate><creator>Barrenechea, Maitane</creator><creator>Barbero, Luis</creator><creator>Jimenez, Idoia</creator><creator>Arruti, Egoitz</creator><creator>Mendicute, Mikel</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>201105</creationdate><title>High-throughput implementation of tree-search algorithms for vector precoding</title><author>Barrenechea, Maitane ; Barbero, Luis ; Jimenez, Idoia ; Arruti, Egoitz ; Mendicute, Mikel</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-18ef15e917a5775d7b0d92455918521279378e0c072548e5a9299caf02013f843</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2011</creationdate><topic>Bit error rate</topic><topic>Complexity theory</topic><topic>FSE</topic><topic>Hardware</topic><topic>Implementation</topic><topic>K-Best</topic><topic>Lattices</topic><topic>MIMO</topic><topic>Sorting</topic><topic>Throughput</topic><topic>Vector Precoding</topic><toplevel>online_resources</toplevel><creatorcontrib>Barrenechea, Maitane</creatorcontrib><creatorcontrib>Barbero, Luis</creatorcontrib><creatorcontrib>Jimenez, Idoia</creatorcontrib><creatorcontrib>Arruti, Egoitz</creatorcontrib><creatorcontrib>Mendicute, Mikel</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library Online</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Barrenechea, Maitane</au><au>Barbero, Luis</au><au>Jimenez, Idoia</au><au>Arruti, Egoitz</au><au>Mendicute, Mikel</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>High-throughput implementation of tree-search algorithms for vector precoding</atitle><btitle>2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)</btitle><stitle>ICASSP</stitle><date>2011-05</date><risdate>2011</risdate><spage>1689</spage><epage>1692</epage><pages>1689-1692</pages><issn>1520-6149</issn><eissn>2379-190X</eissn><isbn>9781457705380</isbn><isbn>1457705389</isbn><eisbn>1457705397</eisbn><eisbn>9781457705373</eisbn><eisbn>9781457705397</eisbn><eisbn>1457705370</eisbn><abstract>This contribution analyzes the architecture design and FPGA implementation of high-throughput multiuser vector precoders. The most complex task of such precoders, i.e. the search of the perturbing vector over an infinite lattice, has been carried out by means of two tree search algorithms: a novel fully-pipelined complex-valued K-Best scheme and a fixed-sphere encoder (FSE). Both designs have been implemented in a Virtex-6 device, leading to precoding throughputs of up to 2.4 Gbps with 16-QAM modulation.</abstract><pub>IEEE</pub><doi>10.1109/ICASSP.2011.5946825</doi><tpages>4</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1520-6149 |
| ispartof | 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2011, p.1689-1692 |
| issn | 1520-6149 2379-190X |
| language | eng |
| recordid | cdi_ieee_primary_5946825 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Bit error rate Complexity theory FSE Hardware Implementation K-Best Lattices MIMO Sorting Throughput Vector Precoding |
| title | High-throughput implementation of tree-search algorithms for vector precoding |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-25T06%3A22%3A52IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=High-throughput%20implementation%20of%20tree-search%20algorithms%20for%20vector%20precoding&rft.btitle=2011%20IEEE%20International%20Conference%20on%20Acoustics,%20Speech%20and%20Signal%20Processing%20(ICASSP)&rft.au=Barrenechea,%20Maitane&rft.date=2011-05&rft.spage=1689&rft.epage=1692&rft.pages=1689-1692&rft.issn=1520-6149&rft.eissn=2379-190X&rft.isbn=9781457705380&rft.isbn_list=1457705389&rft_id=info:doi/10.1109/ICASSP.2011.5946825&rft_dat=%3Cieee_6IE%3E5946825%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=1457705397&rft.eisbn_list=9781457705373&rft.eisbn_list=9781457705397&rft.eisbn_list=1457705370&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=5946825&rfr_iscdi=true |