?url_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Adc&rft.relation=http%3A%2F%2Fwww.eledia.org%2Fstudents-reports%2F889%2F&rft.title=Clustering+Complex+Excitations+in+Linear+Arrays+with+Hilbert+Ordering&rft.creator=BENONI%2C+Arianna&rft.creator=ROCCA%2C+Paolo&rft.creator=ANSELMI%2C+Nicola&rft.creator=MASSA%2C+Andrea&rft.subject=A+WC+Next+Generation+Wireless+Communications&rft.subject=M+AT+Analytic+Techniques&rft.description=This+study+investigates+the+clustering+of+linear+phased+arrays+(PAs)%0Demploying+complex+weights.+Leveraging+the+inherent+locality-preserving%0Dnature+of+the+Hilbert+curve%2C+an+initial+reduction+of+problem+dimensionality%0Dis+performed.+Subsequently%2C+a+basic+clustering+algorithm+is+adopted+to%0Denhance+the+alignment+of+the+radiated+pattern+with+a+predefined+reference.%0DBoth+contiguous+and+noncontiguous+partitions+of+the+Hilbert-ordered+list+of%0Dcomplex+excitations+are+comprehensively+evaluated+to+systematically+explore+the%0Dsolution+space.+Representative+results%2C+including+reference+PAs+generating%0Dsteered+pencil+and+shaped+beams%2C+are+presented+for+validation+and+to+highlight%0Dthe+superior+performance+of+the+proposed+approach+over+conventional+k-means+algorithms.&rft.publisher=ELEDIA+Research+Center+-+University+of+Trento&rft.date=2024-06-14&rft.type=Monograph&rft.type=NonPeerReviewed&rft.format=text&rft.language=en&rft.identifier=http%3A%2F%2Fwww.eledia.org%2Fstudents-reports%2F889%2F1%2FClustering_Complex_Excitations_in_Linear_Arrays_with_Hilbert_Ordering.pdf&rft.identifier=++BENONI%2C+Arianna+and+ROCCA%2C+Paolo+and+ANSELMI%2C+Nicola+and+MASSA%2C+Andrea++(2024)+Clustering+Complex+Excitations+in+Linear+Arrays+with+Hilbert+Ordering.++Technical+Report.+ELEDIA+Research+Center+-+University+of+Trento.+++++