Lower complexity computation of lattice reduction
A signal vector is received over a plurality of channels. A channel matrix H is determined that represents at least one of the plurality of channels. An iterative algorithm such as Lenstra-Lenstra-Lovasz is used to determining a change of basis matrix T that when multiplied with the channel matrix H...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Patent |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | HEISKALA JUHA |
| description | A signal vector is received over a plurality of channels. A channel matrix H is determined that represents at least one of the plurality of channels. An iterative algorithm such as Lenstra-Lenstra-Lovasz is used to determining a change of basis matrix T that when multiplied with the channel matrix H converges to a matrix H*T that is more orthogonal than the channel matrix H. In one aspect the iterative algorithm is upwardly bounded in the number of iterations (e.g., 20 or 30 iterations) that it may perform for any specific channel realization to determine the change of basis matrix T. In another aspect the algorithm is initiated with a matrix derived from a previously determined change of basis matrix. Both aspects may be combined in a single method or device, or either employed separately. |
| format | Patent |
| fullrecord | <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US7668268B2</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US7668268B2</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US7668268B23</originalsourceid><addsrcrecordid>eNrjZDD0yS9PLVJIzs8tyEmtyCypBDNLSxJLMvPzFPLTFHISS0oyk1MVilJTSpNBgjwMrGmJOcWpvFCam0HBzTXE2UM3tSA_PrW4IDE5NS-1JD402NzMzMLIzMLJyJgIJQCO7Swy</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Lower complexity computation of lattice reduction</title><source>esp@cenet</source><creator>HEISKALA JUHA</creator><creatorcontrib>HEISKALA JUHA</creatorcontrib><description>A signal vector is received over a plurality of channels. A channel matrix H is determined that represents at least one of the plurality of channels. An iterative algorithm such as Lenstra-Lenstra-Lovasz is used to determining a change of basis matrix T that when multiplied with the channel matrix H converges to a matrix H*T that is more orthogonal than the channel matrix H. In one aspect the iterative algorithm is upwardly bounded in the number of iterations (e.g., 20 or 30 iterations) that it may perform for any specific channel realization to determine the change of basis matrix T. In another aspect the algorithm is initiated with a matrix derived from a previously determined change of basis matrix. Both aspects may be combined in a single method or device, or either employed separately.</description><language>eng</language><subject>BASIC ELECTRONIC CIRCUITRY ; DEMODULATION OR TRANSFERENCE OF MODULATION FROM ONE CARRIER TOANOTHER ; ELECTRIC COMMUNICATION TECHNIQUE ; ELECTRICITY ; TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</subject><creationdate>2010</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20100223&DB=EPODOC&CC=US&NR=7668268B2$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,777,882,25545,76296</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20100223&DB=EPODOC&CC=US&NR=7668268B2$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>HEISKALA JUHA</creatorcontrib><title>Lower complexity computation of lattice reduction</title><description>A signal vector is received over a plurality of channels. A channel matrix H is determined that represents at least one of the plurality of channels. An iterative algorithm such as Lenstra-Lenstra-Lovasz is used to determining a change of basis matrix T that when multiplied with the channel matrix H converges to a matrix H*T that is more orthogonal than the channel matrix H. In one aspect the iterative algorithm is upwardly bounded in the number of iterations (e.g., 20 or 30 iterations) that it may perform for any specific channel realization to determine the change of basis matrix T. In another aspect the algorithm is initiated with a matrix derived from a previously determined change of basis matrix. Both aspects may be combined in a single method or device, or either employed separately.</description><subject>BASIC ELECTRONIC CIRCUITRY</subject><subject>DEMODULATION OR TRANSFERENCE OF MODULATION FROM ONE CARRIER TOANOTHER</subject><subject>ELECTRIC COMMUNICATION TECHNIQUE</subject><subject>ELECTRICITY</subject><subject>TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2010</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZDD0yS9PLVJIzs8tyEmtyCypBDNLSxJLMvPzFPLTFHISS0oyk1MVilJTSpNBgjwMrGmJOcWpvFCam0HBzTXE2UM3tSA_PrW4IDE5NS-1JD402NzMzMLIzMLJyJgIJQCO7Swy</recordid><startdate>20100223</startdate><enddate>20100223</enddate><creator>HEISKALA JUHA</creator><scope>EVB</scope></search><sort><creationdate>20100223</creationdate><title>Lower complexity computation of lattice reduction</title><author>HEISKALA JUHA</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US7668268B23</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2010</creationdate><topic>BASIC ELECTRONIC CIRCUITRY</topic><topic>DEMODULATION OR TRANSFERENCE OF MODULATION FROM ONE CARRIER TOANOTHER</topic><topic>ELECTRIC COMMUNICATION TECHNIQUE</topic><topic>ELECTRICITY</topic><topic>TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</topic><toplevel>online_resources</toplevel><creatorcontrib>HEISKALA JUHA</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>HEISKALA JUHA</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Lower complexity computation of lattice reduction</title><date>2010-02-23</date><risdate>2010</risdate><abstract>A signal vector is received over a plurality of channels. A channel matrix H is determined that represents at least one of the plurality of channels. An iterative algorithm such as Lenstra-Lenstra-Lovasz is used to determining a change of basis matrix T that when multiplied with the channel matrix H converges to a matrix H*T that is more orthogonal than the channel matrix H. In one aspect the iterative algorithm is upwardly bounded in the number of iterations (e.g., 20 or 30 iterations) that it may perform for any specific channel realization to determine the change of basis matrix T. In another aspect the algorithm is initiated with a matrix derived from a previously determined change of basis matrix. Both aspects may be combined in a single method or device, or either employed separately.</abstract><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_epo_espacenet_US7668268B2 |
| source | esp@cenet |
| subjects | BASIC ELECTRONIC CIRCUITRY DEMODULATION OR TRANSFERENCE OF MODULATION FROM ONE CARRIER TOANOTHER ELECTRIC COMMUNICATION TECHNIQUE ELECTRICITY TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION |
| title | Lower complexity computation of lattice reduction |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-20T15%3A07%3A01IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=HEISKALA%20JUHA&rft.date=2010-02-23&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS7668268B2%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |