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...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on signal processing Vol. 70; pp. 1 - 13
Main Authors: Perera, Sirani M., Lingsch, Levi, Madanayake, Arjuna, Mandal, Soumyajit, Mastronardi, Nicola
Format: Journal Article
Language:English
Published: New York IEEE 01.01.2022
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
ISSN:1053-587X, 1941-0476
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract 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.
AbstractList 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.
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 [Formula Omitted]-beam wideband beamforming from [Formula Omitted] to [Formula Omitted], where [Formula Omitted]. 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.
Author Lingsch, Levi
Madanayake, Arjuna
Mastronardi, Nicola
Perera, Sirani M.
Mandal, Soumyajit
Author_xml – sequence: 1
  givenname: Sirani M.
  orcidid: 0000-0002-3975-3742
  surname: Perera
  fullname: Perera, Sirani M.
  organization: Department of Mathematics, Embry-Riddle Aeronautical University, Florida, USA
– sequence: 2
  givenname: Levi
  orcidid: 0000-0002-7480-9916
  surname: Lingsch
  fullname: Lingsch, Levi
  organization: Department of Aerospace Engineering, Embry-Riddle Aeronautical University, Florida, USA
– sequence: 3
  givenname: Arjuna
  orcidid: 0000-0003-3478-6702
  surname: Madanayake
  fullname: Madanayake, Arjuna
  organization: Department of Electrical and Computer Engineering, Florida International University, Miami, Florida, USA
– sequence: 4
  givenname: Soumyajit
  orcidid: 0000-0001-9070-2337
  surname: Mandal
  fullname: Mandal, Soumyajit
  organization: Department of Electrical and Computer Engineering, University of Florida, Gainesville, Florida, USA
– sequence: 5
  givenname: Nicola
  surname: Mastronardi
  fullname: Mastronardi, Nicola
  organization: Istituto per le Applicazioni del Calcolo, "M. Picone," Consiglio Nazionale delle Ricerche (CNR), Sez. Bari, Bari, Italy
BookMark eNp9kE1PAjEQhhuDiYDeTbw08bzYTne37RFB1ASiifhxa8q2qyX7gW058O9dAvHgwcvMHN5n3uQZoF7TNhahS0pGlBJ5s3x5HgEBGDFglAo4QX0qU5qQlOe97iYZSzLBP87QIIQ1ITRNZd5HkzGe6RDx9G2Bx9Vn6138qnHZevzujF3pxuClq20ytZXe4cW2ii65tbrG-9HFauvDOTotdRXsxXEP0evsbjl5SOZP94-T8TwpQNKYZEbnK14AMdYQSIXJmZXASynS3JDCMENKkQKAyIS1QgMTArgmUnC2ktKwIbo-_N349ntrQ1TrduubrlIBz2RKKEjoUuSQKnwbgrel2nhXa79TlKi9KtWpUntV6qiqQ_I_SOGijq5toteu-g-8OoDOWvvbI6XMKWfsB1dZdXE
CODEN ITPRED
CitedBy_id crossref_primary_10_1109_TMTT_2025_3543480
crossref_primary_10_1109_ACCESS_2025_3573930
crossref_primary_10_1109_JRFID_2025_3602901
crossref_primary_10_3390_drones8020057
crossref_primary_10_3390_s24020576
crossref_primary_10_1016_j_laa_2025_01_010
Cites_doi 10.1109/TCSI.2014.2309833
10.1137/060676635
10.1006/jcom.1994.1021
10.1109/JOE.2011.2169611
10.1002/0471221104
10.1007/978-1-4020-6629-0
10.2307/2313246
10.1109/TAES.2021.3086356
10.1137/1.9781611971354
10.1109/ISCAS.2013.6572086
10.1007/978-3-319-49887-4_2
10.1115/1.3171799
10.1016/j.laa.2005.09.014
10.1090/mcom/3204
10.1109/ISCAS.2018.8351765
10.1016/S0024-3795(96)00315-1
10.1007/s11235-015-0007-8
10.1109/OJSP.2020.2991586
10.1016/j.dam.2004.08.003
10.1109/ACCESS.2019.2921522
10.1109/JSTSP.2018.2822940
10.1109/TCSII.2015.2482578
10.1016/0024-3795(94)90189-9
10.1145/1476589.1476610
10.1137/S0895479804440335
10.3847/1538-4357/ab229e
10.1017/CBO9780511760921
10.1016/j.cam.2004.01.032
10.1016/S0024-3795(98)10101-5
10.1109/5.542410
10.1007/978-1-4612-0129-8
10.1016/j.laa.2006.08.032
10.1090/S0025-5718-1965-0178586-1
10.1109/TCSI.2020.3005475
10.1109/TCSI.2012.2185294
10.1137/1.9781611970999
10.1016/j.laa.2009.12.034
10.1109/ACCESS.2020.2970342
10.1109/MERCon.2017.7980488
10.1109/TSP.2006.882087
10.1109/MWSYM.2015.7167112
10.1162/089976698300017052
10.1109/JETCAS.2018.2832177
10.1016/S0024-3795(00)00124-5
10.1090/S0025-5718-1991-1094957-9
10.1109/TSP.2013.2282271
10.1109/TAP.1963.1138114
10.1090/S0025-5718-1970-0290541-1
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2022
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2022
DBID 97E
RIA
RIE
AAYXX
CITATION
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
DOI 10.1109/TSP.2022.3231182
DatabaseName IEEE All-Society Periodicals Package (ASPP) 2005-present
IEEE All-Society Periodicals Package (ASPP) 1998-Present
IEEE Electronic Library (IEL)
CrossRef
Computer and Information Systems Abstracts
Electronics & Communications Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Technology Research Database
Computer and Information Systems Abstracts – Academic
Electronics & Communications Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts Professional
DatabaseTitleList
Technology Research Database
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1941-0476
EndPage 13
ExternalDocumentID 10_1109_TSP_2022_3231182
9996173
Genre orig-research
GrantInformation_xml – fundername: National Science Foundation
  grantid: 1902283
GroupedDBID -~X
.DC
0R~
29I
4.4
5GY
6IK
85S
97E
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABQJQ
ABVLG
ACGFO
ACIWK
ACNCT
AENEX
AGQYO
AHBIQ
AJQPL
AKJIK
AKQYR
ALMA_UNASSIGNED_HOLDINGS
ASUFR
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CS3
EBS
F5P
HZ~
IFIPE
IPLJI
JAVBF
LAI
MS~
O9-
OCL
P2P
RIA
RIE
RNS
TAE
TN5
3EH
53G
5VS
AAYXX
ABFSI
ACKIV
AETIX
AGSQL
AI.
AIBXA
ALLEH
CITATION
E.L
EJD
H~9
ICLAB
IFJZH
VH1
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c291t-5da6b7c20ded0248d63e927f9846d0cd3d0f84222858ee8a238827a09873b99d3
IEDL.DBID RIE
ISICitedReferencesCount 9
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000906446800004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1053-587X
IngestDate Mon Jun 30 10:20:39 EDT 2025
Sat Nov 29 04:10:56 EST 2025
Tue Nov 18 22:26:36 EST 2025
Wed Aug 27 02:29:11 EDT 2025
IsPeerReviewed true
IsScholarly true
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
https://doi.org/10.15223/policy-029
https://doi.org/10.15223/policy-037
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c291t-5da6b7c20ded0248d63e927f9846d0cd3d0f84222858ee8a238827a09873b99d3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0003-3478-6702
0000-0001-9070-2337
0000-0002-7480-9916
0000-0002-3975-3742
PQID 2759401292
PQPubID 85478
PageCount 13
ParticipantIDs proquest_journals_2759401292
ieee_primary_9996173
crossref_primary_10_1109_TSP_2022_3231182
crossref_citationtrail_10_1109_TSP_2022_3231182
PublicationCentury 2000
PublicationDate 2022-01-01
PublicationDateYYYYMMDD 2022-01-01
PublicationDate_xml – month: 01
  year: 2022
  text: 2022-01-01
  day: 01
PublicationDecade 2020
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle IEEE transactions on signal processing
PublicationTitleAbbrev TSP
PublicationYear 2022
Publisher IEEE
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml – name: IEEE
– name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References ref13
ref12
ref15
ref14
ref52
ref11
ref10
ref17
ref16
ref18
ref51
ref50
ref46
ref45
Bckstrm (ref41)
ref47
ref42
ref44
ref43
ref49
ref8
ref7
ref9
ref4
ref3
ref6
ref5
ref35
ref34
ref37
ref36
ref31
ref30
ref33
ref32
ref2
ref1
ref39
ref38
Perera (ref48) 2012
ref24
Stoica (ref40) 2005
ref23
Canny (ref19) 1989
ref26
ref25
ref20
ref22
ref21
ref28
ref27
ref29
References_xml – ident: ref25
  doi: 10.1109/TCSI.2014.2309833
– ident: ref47
  doi: 10.1137/060676635
– ident: ref15
  doi: 10.1006/jcom.1994.1021
– ident: ref9
  doi: 10.1109/JOE.2011.2169611
– ident: ref1
  doi: 10.1002/0471221104
– ident: ref26
  doi: 10.1007/978-1-4020-6629-0
– ident: ref43
  doi: 10.2307/2313246
– ident: ref49
  doi: 10.1109/TAES.2021.3086356
– ident: ref29
  doi: 10.1137/1.9781611971354
– start-page: 34
  volume-title: Proc. ACM-SIGSAM ISSAC
  year: 1989
  ident: ref19
  article-title: Solving systems of non-linear equations faster
– ident: ref24
  doi: 10.1109/ISCAS.2013.6572086
– ident: ref28
  doi: 10.1007/978-3-319-49887-4_2
– ident: ref21
  doi: 10.1115/1.3171799
– ident: ref17
  doi: 10.1016/j.laa.2005.09.014
– ident: ref16
  doi: 10.1090/mcom/3204
– ident: ref35
  doi: 10.1109/ISCAS.2018.8351765
– ident: ref51
  doi: 10.1016/S0024-3795(96)00315-1
– ident: ref4
  doi: 10.1007/s11235-015-0007-8
– ident: ref7
  doi: 10.1109/OJSP.2020.2991586
– ident: ref13
  doi: 10.1016/j.dam.2004.08.003
– ident: ref32
  doi: 10.1109/ACCESS.2019.2921522
– volume-title: Spectral Analysis of Signals
  year: 2005
  ident: ref40
– ident: ref5
  doi: 10.1109/JSTSP.2018.2822940
– ident: ref31
  doi: 10.1109/TCSII.2015.2482578
– ident: ref14
  doi: 10.1016/0024-3795(94)90189-9
– ident: ref30
  doi: 10.1145/1476589.1476610
– ident: ref50
  doi: 10.1137/S0895479804440335
– ident: ref3
  doi: 10.3847/1538-4357/ab229e
– ident: ref27
  doi: 10.1017/CBO9780511760921
– ident: ref12
  doi: 10.1016/j.cam.2004.01.032
– ident: ref38
  doi: 10.1016/S0024-3795(98)10101-5
– ident: ref37
  doi: 10.1109/5.542410
– ident: ref42
  doi: 10.1007/978-1-4612-0129-8
– ident: ref46
  doi: 10.1016/j.laa.2006.08.032
– ident: ref20
  doi: 10.1090/S0025-5718-1965-0178586-1
– ident: ref36
  doi: 10.1109/TCSI.2020.3005475
– ident: ref2
  doi: 10.1109/TCSI.2012.2185294
– ident: ref22
  doi: 10.1137/1.9781611970999
– start-page: 71
  volume-title: Proc. IEEE 22nd Eur. Signal Process. Conf.
  ident: ref41
  article-title: Implementation and evaluation of the Vandermonde transform
– ident: ref18
  doi: 10.1016/j.laa.2009.12.034
– ident: ref6
  doi: 10.1109/ACCESS.2020.2970342
– ident: ref10
  doi: 10.1109/MERCon.2017.7980488
– ident: ref23
  doi: 10.1109/TSP.2006.882087
– ident: ref34
  doi: 10.1109/MWSYM.2015.7167112
– ident: ref52
  doi: 10.1162/089976698300017052
– ident: ref33
  doi: 10.1109/JETCAS.2018.2832177
– ident: ref11
  doi: 10.1016/S0024-3795(00)00124-5
– ident: ref45
  doi: 10.1090/S0025-5718-1991-1094957-9
– year: 2012
  ident: ref48
  article-title: Quasiseparable approach to matrices of vandermonde type
– ident: ref39
  doi: 10.1109/TSP.2013.2282271
– ident: ref8
  doi: 10.1109/TAP.1963.1138114
– ident: ref44
  doi: 10.1090/S0025-5718-1970-0290541-1
SSID ssj0014496
Score 2.4277797
Snippet This paper presents a sparse factorization for the delay Vandermonde matrix (DVM) along with fast, exact, radix-2, and recursive algorithms to compute the...
SourceID proquest
crossref
ieee
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 1
SubjectTerms 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
URI https://ieeexplore.ieee.org/document/9996173
https://www.proquest.com/docview/2759401292
Volume 70
WOSCitedRecordID wos000906446800004&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: 1941-0476
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0014496
  issn: 1053-587X
  databaseCode: RIE
  dateStart: 19910101
  isFulltext: true
  titleUrlDefault: https://ieeexplore.ieee.org/
  providerName: IEEE
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT8MwDLY2xAEOvAZiMFAOXJDo1qbtkhwHY-ICQuK1W5UmLkzaA20FiX9PknYVCITEpcohiarPbfzZjm2AE6FTEWS-jfpH0ovQGKxCY-rpWKLOFBc6ylyzCXZzw4dDcVuDsyoXBhHd5TNs26GL5euZerOuso4l5wEL61BnrFvkalURgyhyvbgMXQi9mLPhMiTpi8793a0xBClth4bMBJx-U0Gup8qPg9hpl8Hm_95rCzZKFkl6hdi3oYbTHVj_UluwARc9MpCLnPQfr0lv_Dybj_KXCTEUlTyNDExyqolN__D6OJYfxOXheucoJ8Q-LJM1vHAXHgaX9xdXXtkxwVNUBLkXa9lNmaK-Rm2LleluiIKyTBiWoX2lQ-1n3Dl9Yo7IpdHXnDLpC87CVAgd7sHKdDbFfSDSbBGkymgvW78m7UqZ6YxGIVdoRCiDJnSWICaqLCduu1qME2dW-CIxsCcW9qSEvQmn1YrXopTGH3MbFuZqXolwE1pLOSXlv7ZIKItFZP1p9OD3VYewZvcuHCctWMnnb3gEq-o9Hy3mx-4z-gQIacQR
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT8MwDLZ4ScCBN2IwIAcuSJS1abomx_GYhoAJiQG7VWniwqQ90FaQ-PckWTeBQEhcqh6Stvqc1J_t2AY4EjoVQebbqD-THkNjsAqNqacjiTpTXGiWuWYTcbPJ221xNwMn01wYRHSHz_DU3rpYvh6oN-sqq1hyHsThLMxHjFF_nK01jRkw5rpxGcIQehGP25OgpC8qrfs7YwpSehoaOhNw-k0Jua4qP37FTr_UV__3ZWuwUvBIUhsLfh1msL8By1-qC27CeY3U5SgnF4-3pNZ9Hgw7-UuPGJJKnjoGKNnXxCaAeBfYlR_EZeJ6Zyh7xF4slzXMcAse6pet84ZX9EzwFBVB7kVaVtNYUV-jtuXKdDVEQeNMGJ6hfaVD7WfcuX0ijsil0dicxtIXPA5TIXS4DXP9QR93gEjziCBVRn_ZCjZpVcpMZ5SFXKERogxKUJmAmKiioLjta9FNnGHhi8TAnljYkwL2EhxPZ7yOi2n8MXbTwjwdVyBcgvJETkmx20YJjSPBrEeN7v4-6xAWG63bm-Tmqnm9B0v2PWM3Shnm8uEb7sOCes87o-GBW1KfaajHWA
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+Fast+DVM+Algorithm+for+Wideband+Time-Delay+Multi-Beam+Beamformers&rft.jtitle=IEEE+transactions+on+signal+processing&rft.au=Perera%2C+Sirani+M&rft.au=Levi+Lingsch&rft.au=Madanayake%2C+Arjuna&rft.au=Mandal%2C+Soumyajit&rft.date=2022-01-01&rft.pub=The+Institute+of+Electrical+and+Electronics+Engineers%2C+Inc.+%28IEEE%29&rft.issn=1053-587X&rft.eissn=1941-0476&rft.volume=70&rft.spage=5913&rft_id=info:doi/10.1109%2FTSP.2022.3231182&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1053-587X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1053-587X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1053-587X&client=summon