Suchergebnisse - Complexity and performance of algorithms

  1. 1

    A low-complexity algorithm to search for Legendre pairs von Perera, Sirani M., Kotsireas, Ilias S.

    ISSN: 0024-3795
    Veröffentlicht: Elsevier Inc 15.09.2025
    Veröffentlicht in Linear algebra and its applications (15.09.2025)
    “… In this paper, we search for Legendre pairs exploring matrix structures and obtain a low arithmetic and time complexity algorithm instead of conventional combinatorial algorithms …”
    Volltext
    Journal Article
  2. 2

    A low-complexity algorithm to digitally uncouple the mutual coupling effect in antenna arrays via symmetric Toeplitz matrices von Perera, Sirani M., Lingsch, Levi, Madanayake, Arjuna, Belostotski, Leonid

    ISSN: 0377-0427
    Veröffentlicht: Elsevier B.V 15.05.2026
    Veröffentlicht in Journal of computational and applied mathematics (15.05.2026)
    “… Thus, in this paper, we propose an algorithm to uncouple the mutual coupling effect of antenna arrays using O(nlog(n)) as opposed to O(n3 …”
    Volltext
    Journal Article
  3. 3

    A Reduced-Complexity Trajectory Generation Algorithm for Three-Body Regimes With Minimum Predefined Data von Baker-McEvilly, Brian, Aluvihare, Hansaka, Perera, Sirani M., Canales, David

    ISSN: 0018-9251, 1557-9603
    Veröffentlicht: New York IEEE 01.04.2025
    “… Thus, a reduced-complexity classical algorithm is proposed utilizing predefined spacecraft's position and velocity data to achieve precise and accurate orbital trajectories of the spacecraft within three-body dynamics …”
    Volltext
    Journal Article
  4. 4

    Sparse Matrix Based Low-Complexity, Recursive, and Radix-2 Algorithms for Discrete Sine Transforms von Perera, Sirani M., Lingsch, Levi E.

    ISSN: 2169-3536, 2169-3536
    Veröffentlicht: Piscataway IEEE 2021
    Veröffentlicht in IEEE access (2021)
    “… Based on the proposed matrix factorization formulas, reduced multiplication complexity, recursive, and radix-2 DST I-IV algorithms are presented …”
    Volltext
    Journal Article
  5. 5

    A Low-Complexity LSTM Network to Realize Multibeam Beamforming von Aluvihare, Hansaka, Shanahan, Carina, Perera, Sirani M., Sivasankar, Sivakumar, Kumarasiri, Umesha, Madanayake, Arjuna, Li, Xianqi

    ISSN: 2380-7636
    Veröffentlicht: IEEE 16.12.2024
    “… Massive data structures can be embedded in the form of weight matrices, enabling to design of neural networks with low-complexity learning algorithms …”
    Volltext
    Tagungsbericht
  6. 6

    Multi-Beam Beamforming-Based ML Algorithm to Optimize the Routing of Drone Swarms von Myers, Rodman J., Perera, Sirani M., McLewee, Grace, Huang, David, Song, Houbing

    ISSN: 2504-446X, 2504-446X
    Veröffentlicht: Basel MDPI AG 01.02.2024
    Veröffentlicht in Drones (Basel) (01.02.2024)
    “… We show a reduction in the arithmetic and time complexities of the algorithm through theoretical and numerical results …”
    Volltext
    Journal Article
  7. 7

    Efficient and Self-Recursive Delay Vandermonde Algorithm for Multi-Beam Antenna Arrays von Perera, Sirani M., Madanayake, Arjuna, Cintra, Renato J.

    ISSN: 2644-1322, 2644-1322
    Veröffentlicht: New York IEEE 2020
    Veröffentlicht in IEEE open journal of signal processing (2020)
    “… An efficient DVM algorithm is proposed to reduce the complexity of radio-frequency (RF) N-beam analog beamforming systems …”
    Volltext
    Journal Article
  8. 8

    Multihead Multitrack Detection for Next Generation Magnetic Recording, Part II: Complexity Reduction - Algorithms and Performance Analysis von Bing Fan, Thapar, Hemant K., Siegel, Paul H.

    ISSN: 0090-6778, 1558-0857
    Veröffentlicht: New York IEEE 01.04.2017
    Veröffentlicht in IEEE transactions on communications (01.04.2017)
    “… ) is a promising technique for significantly reducing the complexity, while retaining good performance …”
    Volltext
    Journal Article
  9. 9

    Randomization, relaxation, and complexity in polynomial equation solving : Banff International Research Station workshop on Randomization, Relaxation, and Complexity, February 28-March 5, 2010, Banff, Ontario, Canada von Randomization, relaxation, and complexity, Gurvits, Leonid, Pébay, Philippe, Rojas, J. Maurice, Thompson, David

    ISBN: 9780821852286, 0821852280
    Veröffentlicht: Providence, R.I American Mathematical Society 2011
    “… This volume corresponds to the Banff International Research Station Workshop on Randomization, Relaxation, and Complexity, held from February 28-March 5, 2010 in Banff, Ontario, Canada …”
    Volltext
    E-Book Buch
  10. 10

    Low-Complexity Decorrelation NLMS Algorithms: Performance Analysis and AEC Application von Zhang, Sheng, Zhang, Jiashu, So, Hing Cheung

    ISSN: 1053-587X, 1941-0476
    Veröffentlicht: New York IEEE 2020
    Veröffentlicht in IEEE transactions on signal processing (2020)
    “… In the traditional decorrelation normalized least-mean-square (D-NLMS) algorithm, high computational complexity is mainly caused by finding the decorrelated-vector …”
    Volltext
    Journal Article
  11. 11

    A Novel Method for Asynchronous Time-of-Arrival-Based Source Localization: Algorithms, Performance and Complexity von Chen, Yuanpeng, Yao, Zhiqiang, Peng, Zheng

    ISSN: 1424-8220, 1424-8220
    Veröffentlicht: Basel MDPI AG 19.06.2020
    Veröffentlicht in Sensors (Basel, Switzerland) (19.06.2020)
    “… The state-of-the-art algorithms need to relax the original problem to convex programming, such as semidefinite programming (SDP …”
    Volltext
    Journal Article
  12. 12

    Thiran Filters for Wideband DSP-Based Multi-Beam True Time Delay RF Sensing Applications von Perera, Sirani M., Rathnasekara, Gayani, Madanayake, Arjuna

    ISSN: 1424-8220, 1424-8220
    Veröffentlicht: Switzerland MDPI AG 01.01.2024
    Veröffentlicht in Sensors (Basel, Switzerland) (01.01.2024)
    “… The digital DVM algorithm leverages sparse matrix factorization to yield multiple simultaneous RF beams for low-complexity sensing applications …”
    Volltext
    Journal Article
  13. 13

    Antenna Selection in Space-Time Block Coded Systems: Performance Analysis and Low-Complexity Algorithm von Chiang-Yu Chen, Sezgin, A., Cioffi, J.M., Paulraj, A.

    ISSN: 1053-587X, 1941-0476
    Veröffentlicht: New York, NY IEEE 01.07.2008
    Veröffentlicht in IEEE transactions on signal processing (01.07.2008)
    “… This paper presents outage probability analysis and a practical algorithm for antenna selection in multiple-input multiple-output wireless communication systems employing space-time block codes (STBC …”
    Volltext
    Journal Article
  14. 14

    Complexity and performance of an Augmented Lagrangian algorithm von Birgin, E. G., Martínez, J. M.

    ISSN: 1055-6788, 1029-4937
    Veröffentlicht: Abingdon Taylor & Francis 02.09.2020
    Veröffentlicht in Optimization methods & software (02.09.2020)
    “… Algencan is a well established safeguarded Augmented Lagrangian algorithm introduced in [R. Andreani, E. G. Birgin, J. M. Martínez, and M. L …”
    Volltext
    Journal Article
  15. 15

    Low Complexity High-Performance Precoding Algorithms for mm-Wave MU-MIMO Communication System von El-abd, Rania H., Abdullah, Haythem H., Elazim, Mohamed Abd, Samrah, Ahmed sh

    ISSN: 0929-6212, 1572-834X
    Veröffentlicht: New York Springer US 01.12.2020
    Veröffentlicht in Wireless personal communications (01.12.2020)
    “… ) performance of large scale multiple input multiple output (MIMO) system. A new technique of enhancing the BER performance of linear precoding algorithm without complexity …”
    Volltext
    Journal Article
  16. 16

    A systematic analysis on performance and computational complexity of sorting algorithms von Sureshkumar Sundaramoorthy, Govardhan Karunanidhi

    ISSN: 2948-2992
    Veröffentlicht: Springer 03.11.2025
    Veröffentlicht in Discover Computing (03.11.2025)
    “… This review systematically evaluates the performance and computational complexity of twelve classical sorting techniques …”
    Volltext
    Journal Article
  17. 17

    Performance analysis of the low‐complexity adaptive channel estimation algorithms over non‐stationary multipath Rayleigh fading channels under carrier frequency offsets von Hadei, Sayed A., Hosseini, S. Abolfazl, Miri, Mohammadhasan

    ISSN: 1751-8628, 1751-8636
    Veröffentlicht: Stevenage John Wiley & Sons, Inc 01.06.2022
    Veröffentlicht in IET communications (01.06.2022)
    “… ‐varying channel estimation. This paper provides performance analysis of the low‐complexity family of affine projection algorithms based on selective partial update …”
    Volltext
    Journal Article
  18. 18

    FMCW Radar Estimation Algorithm with High Resolution and Low Complexity Based on Reduced Search Area von Kim, Bong-Seok, Jin, Youngseok, Lee, Jonghun, Kim, Sangdong

    ISSN: 1424-8220, 1424-8220
    Veröffentlicht: Switzerland MDPI AG 05.02.2022
    Veröffentlicht in Sensors (Basel, Switzerland) (05.02.2022)
    “… FFT-based and MUSIC algorithms have tradeoff characteristics between resolution performance and complexity …”
    Volltext
    Journal Article
  19. 19

    Channel Estimation Algorithms for OFDM-IDMA: Complexity and Performance von Hammarberg, P., Rusek, F., Edfors, O.

    ISSN: 1536-1276
    Veröffentlicht: New York, NY IEEE 01.05.2012
    Veröffentlicht in IEEE transactions on wireless communications (01.05.2012)
    “… The considered algorithms differ in terms of complexity, as well as performance. The main contribution of this paper is to give an overview of different channel estimation …”
    Volltext
    Journal Article
  20. 20

    Closed-Loop Sign Algorithms for Low-Complexity Digital Predistortion: Methods and Performance von Pascual Campo, Pablo, Lampu, Vesa, Anttila, Lauri, Brihuega, Alberto, Allen, Markus, Guo, Yan, Valkama, Mikko

    ISSN: 0018-9480, 1557-9670
    Veröffentlicht: New York IEEE 01.01.2021
    “… )-based memory DPD models, and low-complexity sign-based estimation algorithms such that even continuous DPD learning could be technically feasible …”
    Volltext
    Journal Article