{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:02:18Z","timestamp":1750309338994,"version":"3.41.0"},"reference-count":9,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T00:00:00Z","timestamp":1693526400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Commun. Comput. Algebra"],"published-print":{"date-parts":[[2023,9]]},"abstract":"<jats:p>\n            Beamforming is a signal processing technique where an array of antenna elements can be steered to transmit and receive radio signals in a specific direction. The usage of millimeter wave (mmWave) frequencies and multiple input multiple output (MIMO) beamforming are considered as the key innovations of 5\n            <jats:sup>th<\/jats:sup>\n            Generation (5G) and beyond communication systems. The mmWave radio waves enable high capacity and directive communication, but suffer from many challenges such as rapid channel variation, blockage effects, atmospheric attenuations, etc. The technique initially performs beam alignment procedure, followed by data transfer in the aligned directions between the transmitter and the receiver [1]. Traditionally, beam alignment involves periodical and exhaustive beam sweeping at both transmitter and the receiver, which is a slow process causing extra communication overhead with MIMO and massive MIMO radio units. In applications such as beam tracking, angular velocity, beam steering etc. [2], beam alignment procedure is optimized by estimating the beam directions using\n            <jats:italic>first order polynomial approximations.<\/jats:italic>\n            Recent learning-based SOTA strategies [3] for fast mmWave beam alignment also require exploration over exhaustive beam pairs during the training procedure, causing overhead to learning strategies for higher antenna configurations. Therefore, our goal is to optimize the beam alignment cost functions\n            <jats:italic>e.g.<\/jats:italic>\n            , data rate, to reduce the beam sweeping overhead by applying polynomial approximations of its partial derivatives which can then be solved as a system of polynomial equations. Specifically, we aim to reduce the beam search space by estimating approximate beam directions using the polynomial solvers. Here, we assume both transmitter (TX) and receiver (RX) to be equipped with uniform linear array (ULA) configuration, each having only one degree of freedom (d.o.f.) with\n            <jats:italic>\n              N\n              <jats:sub>t<\/jats:sub>\n            <\/jats:italic>\n            and\n            <jats:italic>\n              N\n              <jats:sub>r<\/jats:sub>\n            <\/jats:italic>\n            antennas, respectively.\n          <\/jats:p>","DOI":"10.1145\/3637529.3637537","type":"journal-article","created":{"date-parts":[[2023,12,13]],"date-time":"2023-12-13T17:06:57Z","timestamp":1702487217000},"page":"148-151","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["A Novel Application of Polynomial Solvers in mmWave Analog Radio Beamforming"],"prefix":"10.1145","volume":"57","author":[{"given":"Snehal","family":"Bhayani","sequence":"first","affiliation":[{"name":"University of Oulu, Finland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Praneeth","family":"Susarla","sequence":"additional","affiliation":[{"name":"University of Oulu, Finland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. S. Krishna Chaitanya","family":"Bulusu","sequence":"additional","affiliation":[{"name":"University of Oulu, Finland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olli","family":"Silven","sequence":"additional","affiliation":[{"name":"University of Oulu, Finland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Markku","family":"Juntti","sequence":"additional","affiliation":[{"name":"University of Oulu, Finland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Janne","family":"Heikkila","sequence":"additional","affiliation":[{"name":"University of Oulu, Finland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,12,13]]},"reference":[{"volume-title":"et al., 5G NR: The next generation wireless access technology","year":"2020","key":"e_1_2_1_1_1","unstructured":"D. et al., 5G NR: The next generation wireless access technology. Academic Press, 2020."},{"key":"e_1_2_1_2_1","unstructured":"A. et al. \"Adaptive beamforming by compact arrays using evolutionary optimization of Schelkunoff polynomials \" IEEE Transactions on Antennas and Propagation 2022."},{"key":"e_1_2_1_3_1","unstructured":"S. et al. \"Learning-based Beam Alignment for Uplink mmWave UAVs \" IEEE Transactions on Wireless Communications 2022."},{"key":"e_1_2_1_4_1","volume-title":"dissertation","author":"Kukelova","year":"2013","unstructured":"Z. Kukelova, \"Algebraic Methods in Computer Vision,\" Ph.D. dissertation, Czech Technical University in Prague, 2013."},{"volume-title":"et al., \"Efficient Solvers for Minimal Problems by Syzygy-based Reduction,\" in Computer Vision and Pattern Recognition (CVPR)","year":"2017","key":"e_1_2_1_5_1","unstructured":"L. et al., \"Efficient Solvers for Minimal Problems by Syzygy-based Reduction,\" in Computer Vision and Pattern Recognition (CVPR), 2017."},{"volume-title":"et al., \"Optimizing Elimination Templates by Greedy Parameter Search","year":"2022","key":"e_1_2_1_6_1","unstructured":"M. et al., \"Optimizing Elimination Templates by Greedy Parameter Search,\" 2022."},{"key":"e_1_2_1_7_1","first-page":"1767","volume-title":"et al., \"A Sparse Resultant Based Method for Efficient Minimal Solvers,\" in 2020 IEEE\/CVF Conference on Computer Vision and Pattern Recognition (CVPR)","year":"2020","unstructured":"B. et al., \"A Sparse Resultant Based Method for Efficient Minimal Solvers,\" in 2020 IEEE\/CVF Conference on Computer Vision and Pattern Recognition (CVPR), 2020, pp. 1767--1776."},{"key":"e_1_2_1_8_1","volume-title":"Real and Complex Analysis","author":"Rudin","year":"1986","unstructured":"W. Rudin, Real and Complex Analysis. McGraw-Hill Science\/Engineering\/Math, May 1986."},{"key":"e_1_2_1_9_1","volume-title":"Using Algebraic Geometry","year":"1998","unstructured":"C. et al., Using Algebraic Geometry, 1st ed., ser. Graduate Texts in Mathematics. Springer, 1998, vol. 185.","edition":"1"}],"container-title":["ACM Communications in Computer Algebra"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3637529.3637537","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3637529.3637537","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:04:23Z","timestamp":1750291463000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3637529.3637537"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["10.1145\/3637529.3637537"],"URL":"https:\/\/doi.org\/10.1145\/3637529.3637537","relation":{},"ISSN":["1932-2240"],"issn-type":[{"type":"print","value":"1932-2240"}],"subject":[],"published":{"date-parts":[[2023,9]]},"assertion":[{"value":"2023-12-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}