A Fast DVM Algorithm for Wideband Time-Delay Multi-Beam Beamformers
This paper presents a sparse factorization for the delay Vandermonde matrix (DVM) along with fast, exact, radix-2, and recursive algorithms to compute the DVM-vector product for wideband multi-beam antenna arrays. The proposed algorithms enable low-complexity wideband beamformers in emerging millime...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on signal processing 2022-01, Vol.70, p.1-13 |
|---|---|
| Hauptverfasser: | , , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 13 |
|---|---|
| container_issue | |
| container_start_page | 1 |
| container_title | IEEE transactions on signal processing |
| container_volume | 70 |
| creator | Perera, Sirani M. Lingsch, Levi Madanayake, Arjuna Mandal, Soumyajit Mastronardi, Nicola |
| description | This paper presents a sparse factorization for the delay Vandermonde matrix (DVM) along with fast, exact, radix-2, and recursive algorithms to compute the DVM-vector product for wideband multi-beam antenna arrays. The proposed algorithms enable low-complexity wideband beamformers in emerging millimeter-wave wireless communication networks by reducing the complexity of N-beam wideband beamforming from \mathcal {O}(N^{2}) to \mathcal {O}(N \mathrm{\: log\:} N), where N=2^{r}(r \geq 1). As a result, the algorithms are faster than the brute-force computation of the DVM-vector product and more efficient than the direct realization of true-time-delay-based multi-beam beamformers. The proposed low-complexity algorithms' signal flow graph (SFG) is also presented to highlight their suitability for hardware implementations. The 2-D frequency responses of DVM-based beamformers are explained through an array signal processing example. Simulation results suggest that integrated circuit (IC) implementations of the SFG significantly reduce chip area and power consumption. |
| doi_str_mv | 10.1109/TSP.2022.3231182 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_journals_2759401292</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>9996173</ieee_id><sourcerecordid>2759401292</sourcerecordid><originalsourceid>FETCH-LOGICAL-c291t-5da6b7c20ded0248d63e927f9846d0cd3d0f84222858ee8a238827a09873b99d3</originalsourceid><addsrcrecordid>eNo9kD1PwzAQhi0EEqWwI7FYYk44n53YHktLAakVSJSPzXJjB1IlTbHTof-eVK1Y7r3hee-kh5BrBiljoO8Wb68pAmLKkTOm8IQMmBYsASHz036HjCeZkl_n5CLGFQATQucDMh7RqY0dnXzM6aj-bkPV_TS0bAP9rJxf2rWji6rxycTXdkfn27qrkntvG7ofPdb4EC_JWWnr6K-OOSTv04fF-CmZvTw-j0ezpEDNuiRzNl_KAsF5ByiUy7nXKEutRO6gcNxBqQQiqkx5ryxypVBa0ErypdaOD8nt4e4mtL9bHzuzardh3b80KDMtgKHGnoIDVYQ2xuBLswlVY8POMDB7VaZXZfaqzFFVX7k5VCrv_T-utc6Z5PwPctFiQw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2759401292</pqid></control><display><type>article</type><title>A Fast DVM Algorithm for Wideband Time-Delay Multi-Beam Beamformers</title><source>IEEE Electronic Library (IEL)</source><creator>Perera, Sirani M. ; Lingsch, Levi ; Madanayake, Arjuna ; Mandal, Soumyajit ; Mastronardi, Nicola</creator><creatorcontrib>Perera, Sirani M. ; Lingsch, Levi ; Madanayake, Arjuna ; Mandal, Soumyajit ; Mastronardi, Nicola</creatorcontrib><description><![CDATA[This paper presents a sparse factorization for the delay Vandermonde matrix (DVM) along with fast, exact, radix-2, and recursive algorithms to compute the DVM-vector product for wideband multi-beam antenna arrays. The proposed algorithms enable low-complexity wideband beamformers in emerging millimeter-wave wireless communication networks by reducing the complexity of <inline-formula><tex-math notation="LaTeX">N</tex-math></inline-formula>-beam wideband beamforming from <inline-formula><tex-math notation="LaTeX">\mathcal {O}(N^{2})</tex-math></inline-formula> to <inline-formula><tex-math notation="LaTeX">\mathcal {O}(N \mathrm{\: log\:} N)</tex-math></inline-formula>, where <inline-formula><tex-math notation="LaTeX">N=2^{r}(r \geq 1)</tex-math></inline-formula>. As a result, the algorithms are faster than the brute-force computation of the DVM-vector product and more efficient than the direct realization of true-time-delay-based multi-beam beamformers. The proposed low-complexity algorithms' signal flow graph (SFG) is also presented to highlight their suitability for hardware implementations. The 2-D frequency responses of DVM-based beamformers are explained through an array signal processing example. Simulation results suggest that integrated circuit (IC) implementations of the SFG significantly reduce chip area and power consumption.]]></description><identifier>ISSN: 1053-587X</identifier><identifier>EISSN: 1941-0476</identifier><identifier>DOI: 10.1109/TSP.2022.3231182</identifier><identifier>CODEN: ITPRED</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>algorithmic complexity ; Algorithms ; Antenna arrays ; Array signal processing ; Beamforming ; Broadband ; Communication networks ; Complexity ; Complexity theory ; Delay ; Delay Vandermonde matrix ; Discrete Fourier transforms ; fast recursive algorithms ; Integrated circuits ; millimeter wave ; Millimeter waves ; multi-beam beamforming ; Multibeam antennas ; Power consumption ; Radix-2 ; Signal flow graphs ; Signal processing ; Signal processing algorithms ; Sparse matrices ; Wideband ; Wireless communications</subject><ispartof>IEEE transactions on signal processing, 2022-01, Vol.70, p.1-13</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2022</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c291t-5da6b7c20ded0248d63e927f9846d0cd3d0f84222858ee8a238827a09873b99d3</citedby><cites>FETCH-LOGICAL-c291t-5da6b7c20ded0248d63e927f9846d0cd3d0f84222858ee8a238827a09873b99d3</cites><orcidid>0000-0003-3478-6702 ; 0000-0001-9070-2337 ; 0000-0002-7480-9916 ; 0000-0002-3975-3742</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/9996173$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/9996173$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Perera, Sirani M.</creatorcontrib><creatorcontrib>Lingsch, Levi</creatorcontrib><creatorcontrib>Madanayake, Arjuna</creatorcontrib><creatorcontrib>Mandal, Soumyajit</creatorcontrib><creatorcontrib>Mastronardi, Nicola</creatorcontrib><title>A Fast DVM Algorithm for Wideband Time-Delay Multi-Beam Beamformers</title><title>IEEE transactions on signal processing</title><addtitle>TSP</addtitle><description><![CDATA[This paper presents a sparse factorization for the delay Vandermonde matrix (DVM) along with fast, exact, radix-2, and recursive algorithms to compute the DVM-vector product for wideband multi-beam antenna arrays. The proposed algorithms enable low-complexity wideband beamformers in emerging millimeter-wave wireless communication networks by reducing the complexity of <inline-formula><tex-math notation="LaTeX">N</tex-math></inline-formula>-beam wideband beamforming from <inline-formula><tex-math notation="LaTeX">\mathcal {O}(N^{2})</tex-math></inline-formula> to <inline-formula><tex-math notation="LaTeX">\mathcal {O}(N \mathrm{\: log\:} N)</tex-math></inline-formula>, where <inline-formula><tex-math notation="LaTeX">N=2^{r}(r \geq 1)</tex-math></inline-formula>. As a result, the algorithms are faster than the brute-force computation of the DVM-vector product and more efficient than the direct realization of true-time-delay-based multi-beam beamformers. The proposed low-complexity algorithms' signal flow graph (SFG) is also presented to highlight their suitability for hardware implementations. The 2-D frequency responses of DVM-based beamformers are explained through an array signal processing example. Simulation results suggest that integrated circuit (IC) implementations of the SFG significantly reduce chip area and power consumption.]]></description><subject>algorithmic complexity</subject><subject>Algorithms</subject><subject>Antenna arrays</subject><subject>Array signal processing</subject><subject>Beamforming</subject><subject>Broadband</subject><subject>Communication networks</subject><subject>Complexity</subject><subject>Complexity theory</subject><subject>Delay</subject><subject>Delay Vandermonde matrix</subject><subject>Discrete Fourier transforms</subject><subject>fast recursive algorithms</subject><subject>Integrated circuits</subject><subject>millimeter wave</subject><subject>Millimeter waves</subject><subject>multi-beam beamforming</subject><subject>Multibeam antennas</subject><subject>Power consumption</subject><subject>Radix-2</subject><subject>Signal flow graphs</subject><subject>Signal processing</subject><subject>Signal processing algorithms</subject><subject>Sparse matrices</subject><subject>Wideband</subject><subject>Wireless communications</subject><issn>1053-587X</issn><issn>1941-0476</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9kD1PwzAQhi0EEqWwI7FYYk44n53YHktLAakVSJSPzXJjB1IlTbHTof-eVK1Y7r3hee-kh5BrBiljoO8Wb68pAmLKkTOm8IQMmBYsASHz036HjCeZkl_n5CLGFQATQucDMh7RqY0dnXzM6aj-bkPV_TS0bAP9rJxf2rWji6rxycTXdkfn27qrkntvG7ofPdb4EC_JWWnr6K-OOSTv04fF-CmZvTw-j0ezpEDNuiRzNl_KAsF5ByiUy7nXKEutRO6gcNxBqQQiqkx5ryxypVBa0ErypdaOD8nt4e4mtL9bHzuzardh3b80KDMtgKHGnoIDVYQ2xuBLswlVY8POMDB7VaZXZfaqzFFVX7k5VCrv_T-utc6Z5PwPctFiQw</recordid><startdate>20220101</startdate><enddate>20220101</enddate><creator>Perera, Sirani M.</creator><creator>Lingsch, Levi</creator><creator>Madanayake, Arjuna</creator><creator>Mandal, Soumyajit</creator><creator>Mastronardi, Nicola</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><orcidid>https://orcid.org/0000-0003-3478-6702</orcidid><orcidid>https://orcid.org/0000-0001-9070-2337</orcidid><orcidid>https://orcid.org/0000-0002-7480-9916</orcidid><orcidid>https://orcid.org/0000-0002-3975-3742</orcidid></search><sort><creationdate>20220101</creationdate><title>A Fast DVM Algorithm for Wideband Time-Delay Multi-Beam Beamformers</title><author>Perera, Sirani M. ; Lingsch, Levi ; Madanayake, Arjuna ; Mandal, Soumyajit ; Mastronardi, Nicola</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c291t-5da6b7c20ded0248d63e927f9846d0cd3d0f84222858ee8a238827a09873b99d3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>algorithmic complexity</topic><topic>Algorithms</topic><topic>Antenna arrays</topic><topic>Array signal processing</topic><topic>Beamforming</topic><topic>Broadband</topic><topic>Communication networks</topic><topic>Complexity</topic><topic>Complexity theory</topic><topic>Delay</topic><topic>Delay Vandermonde matrix</topic><topic>Discrete Fourier transforms</topic><topic>fast recursive algorithms</topic><topic>Integrated circuits</topic><topic>millimeter wave</topic><topic>Millimeter waves</topic><topic>multi-beam beamforming</topic><topic>Multibeam antennas</topic><topic>Power consumption</topic><topic>Radix-2</topic><topic>Signal flow graphs</topic><topic>Signal processing</topic><topic>Signal processing algorithms</topic><topic>Sparse matrices</topic><topic>Wideband</topic><topic>Wireless communications</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Perera, Sirani M.</creatorcontrib><creatorcontrib>Lingsch, Levi</creatorcontrib><creatorcontrib>Madanayake, Arjuna</creatorcontrib><creatorcontrib>Mandal, Soumyajit</creatorcontrib><creatorcontrib>Mastronardi, Nicola</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEEE transactions on signal processing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Perera, Sirani M.</au><au>Lingsch, Levi</au><au>Madanayake, Arjuna</au><au>Mandal, Soumyajit</au><au>Mastronardi, Nicola</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A Fast DVM Algorithm for Wideband Time-Delay Multi-Beam Beamformers</atitle><jtitle>IEEE transactions on signal processing</jtitle><stitle>TSP</stitle><date>2022-01-01</date><risdate>2022</risdate><volume>70</volume><spage>1</spage><epage>13</epage><pages>1-13</pages><issn>1053-587X</issn><eissn>1941-0476</eissn><coden>ITPRED</coden><abstract><![CDATA[This paper presents a sparse factorization for the delay Vandermonde matrix (DVM) along with fast, exact, radix-2, and recursive algorithms to compute the DVM-vector product for wideband multi-beam antenna arrays. The proposed algorithms enable low-complexity wideband beamformers in emerging millimeter-wave wireless communication networks by reducing the complexity of <inline-formula><tex-math notation="LaTeX">N</tex-math></inline-formula>-beam wideband beamforming from <inline-formula><tex-math notation="LaTeX">\mathcal {O}(N^{2})</tex-math></inline-formula> to <inline-formula><tex-math notation="LaTeX">\mathcal {O}(N \mathrm{\: log\:} N)</tex-math></inline-formula>, where <inline-formula><tex-math notation="LaTeX">N=2^{r}(r \geq 1)</tex-math></inline-formula>. As a result, the algorithms are faster than the brute-force computation of the DVM-vector product and more efficient than the direct realization of true-time-delay-based multi-beam beamformers. The proposed low-complexity algorithms' signal flow graph (SFG) is also presented to highlight their suitability for hardware implementations. The 2-D frequency responses of DVM-based beamformers are explained through an array signal processing example. Simulation results suggest that integrated circuit (IC) implementations of the SFG significantly reduce chip area and power consumption.]]></abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TSP.2022.3231182</doi><tpages>13</tpages><orcidid>https://orcid.org/0000-0003-3478-6702</orcidid><orcidid>https://orcid.org/0000-0001-9070-2337</orcidid><orcidid>https://orcid.org/0000-0002-7480-9916</orcidid><orcidid>https://orcid.org/0000-0002-3975-3742</orcidid></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1053-587X |
| ispartof | IEEE transactions on signal processing, 2022-01, Vol.70, p.1-13 |
| issn | 1053-587X 1941-0476 |
| language | eng |
| recordid | cdi_proquest_journals_2759401292 |
| source | IEEE Electronic Library (IEL) |
| subjects | algorithmic complexity Algorithms Antenna arrays Array signal processing Beamforming Broadband Communication networks Complexity Complexity theory Delay Delay Vandermonde matrix Discrete Fourier transforms fast recursive algorithms Integrated circuits millimeter wave Millimeter waves multi-beam beamforming Multibeam antennas Power consumption Radix-2 Signal flow graphs Signal processing Signal processing algorithms Sparse matrices Wideband Wireless communications |
| title | A Fast DVM Algorithm for Wideband Time-Delay Multi-Beam Beamformers |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-08T05%3A15%3A45IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20Fast%20DVM%20Algorithm%20for%20Wideband%20Time-Delay%20Multi-Beam%20Beamformers&rft.jtitle=IEEE%20transactions%20on%20signal%20processing&rft.au=Perera,%20Sirani%20M.&rft.date=2022-01-01&rft.volume=70&rft.spage=1&rft.epage=13&rft.pages=1-13&rft.issn=1053-587X&rft.eissn=1941-0476&rft.coden=ITPRED&rft_id=info:doi/10.1109/TSP.2022.3231182&rft_dat=%3Cproquest_RIE%3E2759401292%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2759401292&rft_id=info:pmid/&rft_ieee_id=9996173&rfr_iscdi=true |