Optimal Excitation Matching Strategy for Sub-Arrayed Phased Linear Arrays Generating Arbitrary-Shaped Beams

The design of phased arrays able to generate arbitrary-shaped beams through a sub-arrayed architecture is addressed here. The synthesis problem is cast in the excitation matching framework, so as to yield clustered phased arrays providing optimal trade-offs between the complexity of the array archit...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on antennas and propagation Ročník 68; číslo 6; s. 4638 - 4647
Hlavní autoři: Rocca, Paolo, Poli, Lorenzo, Polo, Alessandro, Massa, Andrea
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.06.2020
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Institute of Electrical and Electronics Engineers
Témata:
ISSN:0018-926X, 1558-2221
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract The design of phased arrays able to generate arbitrary-shaped beams through a sub-arrayed architecture is addressed here. The synthesis problem is cast in the excitation matching framework, so as to yield clustered phased arrays providing optimal trade-offs between the complexity of the array architecture (i.e., the minimum number of control points at the sub-array level) and the matching of a reference pattern. A synthesis tool based on the <inline-formula> <tex-math notation="LaTeX">k </tex-math></inline-formula>-means algorithm is proposed for jointly optimizing the sub-array configuration and the complex sub-array coefficients. Selected numerical results, including pencil beams with sidelobe notches and asymmetric lobes as well as shaped main lobes, are reported and discussed to highlight the peculiarities of the proposed approach also in comparison with some extensions to complex excitations of state-of-the-art sub-array design methods.
AbstractList The design of phased arrays able to generate arbitrary-shaped beams through a sub-arrayed architecture is addressed here. The synthesis problem is cast in the excitation matching framework, so as to yield clustered phased arrays providing optimal trade-offs between the complexity of the array architecture (i.e., the minimum number of control points at the sub-array level) and the matching of a reference pattern. A synthesis tool based on the [Formula Omitted]-means algorithm is proposed for jointly optimizing the sub-array configuration and the complex sub-array coefficients. Selected numerical results, including pencil beams with sidelobe notches and asymmetric lobes as well as shaped main lobes, are reported and discussed to highlight the peculiarities of the proposed approach also in comparison with some extensions to complex excitations of state-of-the-art sub-array design methods.
The design of phased arrays able to generate arbitrary-shaped beams through a sub-arrayed architecture is addressed here. The synthesis problem is cast in the excitation matching framework, so as to yield clustered phased arrays providing optimal trade-offs between the complexity of the array architecture (i.e., the minimum number of control points at the sub-array level) and the matching of a reference pattern. A synthesis tool based on the <inline-formula> <tex-math notation="LaTeX">k </tex-math></inline-formula>-means algorithm is proposed for jointly optimizing the sub-array configuration and the complex sub-array coefficients. Selected numerical results, including pencil beams with sidelobe notches and asymmetric lobes as well as shaped main lobes, are reported and discussed to highlight the peculiarities of the proposed approach also in comparison with some extensions to complex excitations of state-of-the-art sub-array design methods.
Author Poli, Lorenzo
Rocca, Paolo
Massa, Andrea
Polo, Alessandro
Author_xml – sequence: 1
  givenname: Paolo
  orcidid: 0000-0003-4522-6903
  surname: Rocca
  fullname: Rocca, Paolo
  email: paolo.rocca@unitn.it
  organization: ELEDIA@UniTN (DISI-University of Trento), Trento, Italy
– sequence: 2
  givenname: Lorenzo
  orcidid: 0000-0002-8816-1970
  surname: Poli
  fullname: Poli, Lorenzo
  email: lorenzo.poli@unitn.it
  organization: ELEDIA@UniTN (DISI-University of Trento), Trento, Italy
– sequence: 3
  givenname: Alessandro
  orcidid: 0000-0002-8190-2377
  surname: Polo
  fullname: Polo, Alessandro
  email: alessandro.polo.1@unitn.it
  organization: ELEDIA@UniTN (DISI-University of Trento), Trento, Italy
– sequence: 4
  givenname: Andrea
  orcidid: 0000-0002-8429-8937
  surname: Massa
  fullname: Massa, Andrea
  email: andrea.massa@unitn.it
  organization: ELEDIA@UniTN (DISI-University of Trento), Trento, Italy
BackLink https://centralesupelec.hal.science/hal-04465373$$DView record in HAL
BookMark eNp9kU1PwkAQhjdGExG9m3hp4slDcT9beqxGxQQDCZh420zbKSxCi7vFyL93K-DBg6fJTp5nMzPvGTmu6goJuWS0xxhNbqfpuMcppz2exDyS7Ih0mFL9kHPOjkmHUtYPEx69nZIz5xb-KftSdsj7aN2YFSyDh6_cNNCYugpeoMnnppoFk8ZCg7NtUNY2mGyyMLUWtlgE4zk4X4amQrDBT9cFT1ih51sxtZnxrt2GkzmsPXmHsHLn5KSEpcOLfe2S18eH6f0gHI6enu_TYZgLrpowlgCi5BKoZH7GHIBlkYwFEwVkTBaRylAlsmRJXlBQeRnH_UIgSsxjBI91yc3u3zks9dr69exW12D0IB3qtkeljJSIxWfLXu_Yta0_Nugavag3tvLjaS5pIuJESeWpaEfltnbOYqkPx_JbmqVmVLchaB-CbkPQ-xC8SP-Ih3n-Ua52ikHEXzyhVCgaiW-m-5PR
CODEN IETPAK
CitedBy_id crossref_primary_10_1109_TAP_2023_3304748
crossref_primary_10_1109_TAP_2022_3177498
crossref_primary_10_1109_ACCESS_2022_3160459
crossref_primary_10_1109_TAP_2021_3137176
crossref_primary_10_1109_TAP_2022_3143137
crossref_primary_10_1109_TAP_2022_3209709
crossref_primary_10_1002_mmce_23020
crossref_primary_10_1016_j_sigpro_2023_109197
crossref_primary_10_1109_TAP_2024_3439654
crossref_primary_10_1109_TMTT_2023_3344878
crossref_primary_10_1109_ACCESS_2022_3183754
crossref_primary_10_1109_LAWP_2023_3310972
crossref_primary_10_1109_TAP_2021_3118710
crossref_primary_10_1109_TAP_2025_3575589
crossref_primary_10_1109_LAWP_2021_3060190
crossref_primary_10_1080_23746149_2023_2299543
crossref_primary_10_1109_LAWP_2022_3160733
crossref_primary_10_3390_s21010062
crossref_primary_10_1109_TAP_2024_3374226
crossref_primary_10_1109_ACCESS_2023_3315740
crossref_primary_10_1109_TAP_2022_3164161
crossref_primary_10_1002_cta_3118
crossref_primary_10_1016_j_dsp_2022_103868
crossref_primary_10_1007_s00034_022_02043_1
crossref_primary_10_1109_LAWP_2025_3546038
Cites_doi 10.1109/TAP.1985.1143682
10.1109/JPROC.2015.2512389
10.1049/ip-h-2.1988.0061
10.1109/TAP.2007.893406
10.1109/TAP.2004.838788
10.1109/TAP.2009.2024489
10.1109/TAP.2018.2864628
10.1109/TAP.1984.1143262
10.1109/TAP.2008.924713
10.1109/TAP.2007.913037
10.1049/ip-h-2.1988.0084
10.1007/978-3-319-69404-7
10.1049/iet-map.2016.0517
10.1109/TAP.2009.2013423
10.1109/TAP.2018.2879778
10.2307/2281952
10.1109/TAP.2010.2096383
10.1109/TAP.2017.2738065
10.1109/TSP.2003.810308
10.1109/TAP.2008.2009776
10.1109/TMTT.2014.2354134
10.1109/MAP.2015.2397154
10.1109/8.901272
10.1109/JPROC.2015.2494879
10.1109/TAP.2017.2735549
10.1109/TAP.2018.2816782
10.1109/TAP.2007.893374
10.1163/156939396X00919
10.2528/PIER10060912
10.1109/8.964098
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2020
Distributed under a Creative Commons Attribution 4.0 International License
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2020
– notice: Distributed under a Creative Commons Attribution 4.0 International License
DBID 97E
RIA
RIE
AAYXX
CITATION
7SP
8FD
L7M
1XC
DOI 10.1109/TAP.2020.2972641
DatabaseName IEEE Xplore (IEEE)
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE Electronic Library (IEL)
CrossRef
Electronics & Communications Abstracts
Technology Research Database
Advanced Technologies Database with Aerospace
Hyper Article en Ligne (HAL)
DatabaseTitle CrossRef
Technology Research Database
Advanced Technologies Database with Aerospace
Electronics & Communications Abstracts
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
Architecture
Mathematics
EISSN 1558-2221
EndPage 4647
ExternalDocumentID oai:HAL:hal-04465373v1
10_1109_TAP_2020_2972641
9003506
Genre orig-research
GrantInformation_xml – fundername: Project “CYBER-PHYSICAL ELECTROMAGNETIC VISION: Context-Aware Electromagnetic Sensing and Smart Reaction (EMvisioning)”
  grantid: 2017HZJXSZ
– fundername: Italian Ministry of Education, University, and Research within the Program “Smart cities and communities and Social Innovation”
  grantid: CUP: E44G14000060008
– fundername: Italian Ministry of Education, University and Research within the Program PRIN2017
  grantid: CUP: E64I19002530001
– fundername: Project “WATERTECH - Smart Community per lo Sviluppo e l’Applicazione di Tecnologie di Monitoraggio Innovative per le Reti di Distribuzione Idrica negli usi idropotabili ed agricoli”
  grantid: SCN_00489
GroupedDBID -~X
0R~
29I
4.4
5GY
5VS
6IK
85S
97E
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABFSI
ABQJQ
ABVLG
ACGFO
ACGFS
ACIWK
ACKIV
ACNCT
AENEX
AETIX
AGQYO
AGSQL
AHBIQ
AI.
AIBXA
AKJIK
AKQYR
ALLEH
ALMA_UNASSIGNED_HOLDINGS
ASUFR
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CS3
E.L
EBS
EJD
F5P
HZ~
H~9
IAAWW
IBMZZ
ICLAB
IDIHD
IFIPE
IFJZH
IPLJI
JAVBF
LAI
M43
O9-
OCL
P2P
RIA
RIE
RNS
RXW
TAE
TAF
TN5
VH1
VJK
VOH
AAYXX
CITATION
7SP
8FD
L7M
1XC
ID FETCH-LOGICAL-c325t-74aa3f24a041844caa1b647313dab14d65be594f19cd0a5cf778d3ee4ec7ea313
IEDL.DBID RIE
ISICitedReferencesCount 31
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000543274300044&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0018-926X
IngestDate Tue Oct 14 20:23:42 EDT 2025
Mon Jun 30 10:16:37 EDT 2025
Tue Nov 18 22:32:05 EST 2025
Sat Nov 29 05:23:07 EST 2025
Wed Aug 27 02:38:55 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 6
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
Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c325t-74aa3f24a041844caa1b647313dab14d65be594f19cd0a5cf778d3ee4ec7ea313
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0002-8816-1970
0000-0003-4522-6903
0000-0002-8190-2377
0000-0002-8429-8937
PQID 2409379545
PQPubID 85476
PageCount 10
ParticipantIDs hal_primary_oai_HAL_hal_04465373v1
crossref_primary_10_1109_TAP_2020_2972641
proquest_journals_2409379545
ieee_primary_9003506
crossref_citationtrail_10_1109_TAP_2020_2972641
PublicationCentury 2000
PublicationDate 2020-06-01
PublicationDateYYYYMMDD 2020-06-01
PublicationDate_xml – month: 06
  year: 2020
  text: 2020-06-01
  day: 01
PublicationDecade 2020
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle IEEE transactions on antennas and propagation
PublicationTitleAbbrev TAP
PublicationYear 2020
Publisher IEEE
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Institute of Electrical and Electronics Engineers
Publisher_xml – name: IEEE
– name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
– name: Institute of Electrical and Electronics Engineers
References ref13
ref12
ref15
ref14
ref31
ref30
ref11
ref32
ref10
ref1
ref17
ref16
ref19
ref18
arthur (ref29) 2019
ref24
ref23
ref26
ref25
ref20
ref22
ref21
ref28
ref27
ref8
mailloux (ref2) 2018
ref7
ref9
ref4
ref3
ref6
ref5
References_xml – ident: ref10
  doi: 10.1109/TAP.1985.1143682
– ident: ref8
  doi: 10.1109/JPROC.2015.2512389
– ident: ref11
  doi: 10.1049/ip-h-2.1988.0061
– start-page: 405
  year: 2019
  ident: ref29
  article-title: k-means has polynomial smoothed complexity
  publication-title: Proc IEEE Ann Symp Foundations of Computer Science (FOCS)
– ident: ref14
  doi: 10.1109/TAP.2007.893406
– ident: ref15
  doi: 10.1109/TAP.2004.838788
– ident: ref22
  doi: 10.1109/TAP.2009.2024489
– ident: ref24
  doi: 10.1109/TAP.2018.2864628
– ident: ref9
  doi: 10.1109/TAP.1984.1143262
– ident: ref16
  doi: 10.1109/TAP.2008.924713
– year: 2018
  ident: ref2
  publication-title: Phased Array Antenna Handbook
– ident: ref19
  doi: 10.1109/TAP.2007.913037
– ident: ref32
  doi: 10.1049/ip-h-2.1988.0084
– ident: ref30
  doi: 10.1007/978-3-319-69404-7
– ident: ref5
  doi: 10.1049/iet-map.2016.0517
– ident: ref21
  doi: 10.1109/TAP.2009.2013423
– ident: ref25
  doi: 10.1109/TAP.2018.2879778
– ident: ref20
  doi: 10.2307/2281952
– ident: ref23
  doi: 10.1109/TAP.2010.2096383
– ident: ref3
  doi: 10.1109/TAP.2017.2738065
– ident: ref26
  doi: 10.1109/TSP.2003.810308
– ident: ref18
  doi: 10.1109/TAP.2008.2009776
– ident: ref6
  doi: 10.1109/TMTT.2014.2354134
– ident: ref1
  doi: 10.1109/MAP.2015.2397154
– ident: ref31
  doi: 10.1109/8.901272
– ident: ref7
  doi: 10.1109/JPROC.2015.2494879
– ident: ref4
  doi: 10.1109/TAP.2017.2735549
– ident: ref28
  doi: 10.1109/TAP.2018.2816782
– ident: ref17
  doi: 10.1109/TAP.2007.893374
– ident: ref12
  doi: 10.1163/156939396X00919
– ident: ref27
  doi: 10.2528/PIER10060912
– ident: ref13
  doi: 10.1109/8.964098
SSID ssj0014844
Score 2.487603
Snippet The design of phased arrays able to generate arbitrary-shaped beams through a sub-arrayed architecture is addressed here. The synthesis problem is cast in the...
SourceID hal
proquest
crossref
ieee
SourceType Open Access Repository
Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 4638
SubjectTerms <italic xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">k -means algorithm
Algorithms
Arbitrary shaped beams
Architecture
Arrays
Clustering algorithms
Complexity
Complexity theory
Excitation
excitation matching
Linear antenna arrays
linear array
Linear arrays
Lobes
Mathematics
Notches
Optimization
Pattern matching
Pencil beams
Phase matching
phased array
Phased arrays
Sidelobes
sub-arraying
Synthesis
Title Optimal Excitation Matching Strategy for Sub-Arrayed Phased Linear Arrays Generating Arbitrary-Shaped Beams
URI https://ieeexplore.ieee.org/document/9003506
https://www.proquest.com/docview/2409379545
https://centralesupelec.hal.science/hal-04465373
Volume 68
WOSCitedRecordID wos000543274300044&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: 1558-2221
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0014844
  issn: 0018-926X
  databaseCode: RIE
  dateStart: 19630101
  isFulltext: true
  titleUrlDefault: https://ieeexplore.ieee.org/
  providerName: IEEE
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3faxQxEB56xQd9qNUqvVoliC-C20t2s5vL4yktfdB6YIV7W2aTCVe013J3Le1_7yS7tygWwbclTCDZbzM_dma-ALxTucFCuiozjYotOTTOUDYyQ6VNyGMlYMB02YQ5OxvPZna6BR_6XhgiSsVndBQfUy7fX7mb-KtsZFMerBrAwBjT9mr1GQM91i3jsuIDnFezTUpS2tH5ZMqBYC6PcmvY_qs_TNBgHgsg080qf6njZGNOnv7f6nZhp_MlxaQF_xls0eI5PPmNYXAPfnxllXDJQsd3rmPjFl9Y-8b_TqJjpr0X7LgK1iDZZLnEe_JiOmfb5gXHqXwORBpdiZagOlZJ80hzkdr1s29zvGbJj4SXqxfw_eT4_NNp1t2vkLkiL9eZ0YhFyDVKzXGedoiqqbQpVOGxUdpXZUOl1UFZ5yWWLhgz9gWRJmcIWewlbC-uFrQPIlRsCUtPaIhdMhVsiSoo5V2gquGgaAijzSuvN9uNd2D8rFMQIm3NINURpLoDaQjv-xnXLfHGP2TfMoq9WGTMPp18ruOYTARyprhlob2IWS_VwTWEww3odXd8VzW7Oey2Wd7KwcOzXsHjuIC2ZuwQttfLG3oNj9zt-mK1fJO-zF_BL9_C
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3db9MwED9tAwl44GtDFAZYiBckstqJE9ePBW0qoiuVKFLfLMc-qxOsm9puYv89ZyeNQCAk3iLrLNn5xfeRu_sZ4I3IlS24qzJVi9iSg4PM8ppnVkgV8lgJGGy6bEJNJoP5XE934F3XC4OIqfgMj-JjyuX7C3cVf5X1dcqDVbtwq5QyF023VpczkAPZcC4LOsJ5Nd8mJbnuz4ZTCgVzfpRrRR6A-M0I7S5iCWS6W-UPhZyszMmD_1vfQ7jfepNs2MD_CHZw-Rju_cIxuA_fPpNSOCeh4x-u5eNmp6R_458n1nLT3jByXRnpkGy4Wtkb9Gy6IOvmGUWqdBJYGl2zhqI61knTSH2WGvazLwt7SZLv0Z6vD-DryfHswyhrb1jIXJGXm0xJa4uQS8slRXrSWSvqSqpCFN7WQvqqrLHUMgjtPLelC0oNfIEo0Sm0JPYE9pYXS3wKLFRkC0uPViE5ZSLo0ooghHcBq5rCoh70t6_cbLcbb8H4blIYwrUhkEwEybQg9eBtN-Oyod74h-xrQrETi5zZo-HYxDGeKORUcU1C-xGzTqqFqweHW9BNe4DXhhwdctw0beXZ32e9gjuj2enYjD9OPj2Hu3ExTQXZIextVlf4Am67683ZevUyfaU_AYox4wk
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=Optimal+Excitation+Matching+Strategy+for+Sub-Arrayed+Phased+Linear+Arrays+Generating+Arbitrary-Shaped+Beams&rft.jtitle=IEEE+transactions+on+antennas+and+propagation&rft.au=Rocca%2C+Paolo&rft.au=Poli%2C+Lorenzo&rft.au=Polo%2C+Alessandro&rft.au=Massa%2C+Andrea&rft.date=2020-06-01&rft.pub=IEEE&rft.issn=0018-926X&rft.volume=68&rft.issue=6&rft.spage=4638&rft.epage=4647&rft_id=info:doi/10.1109%2FTAP.2020.2972641&rft.externalDocID=9003506
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0018-926X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0018-926X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0018-926X&client=summon