Levi E. Lingsch

Levi E. Lingsch

Auto-generated profile, based on publicly available information

Levi E. Lingsch

Department of Aerospace Engineering, Embry-Riddle Aeronautical University, Daytona Beach, FL, USA

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
21 December 2022 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
SPSirani Kanchana Mututhanthrige Perera
Sirani Kanchana Mututhanthrige Perera
LLLevi Lingsch
Levi Lingsch
AMArjuna Madanayake
Arjuna Madanayake
Soumyajit MandalSoumyajit Mandal
Soumyajit Mandal
NMNicola Mastronardi
Nicola Mastronardi
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 $N$ -beam wideband beamforming from $\mathcal {O}(N^{2})$ to $\mathcal {O}(N \mathrm{\: log\:} N)$ , where $N=2^{r}(r \geq 1)$ . 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.

14 October 2021 in IEEE Access
Verified
Journal Article
Open access
SPSirani Kanchana Mututhanthrige Perera
Sirani Kanchana Mututhanthrige Perera
LLLevi E. Lingsch
Levi E. Lingsch
This paper presents factorizations of each discrete sine transform (DST) matrix of types I, II, III, and IV into a product of sparse, diagonal, bidiagonal, and scaled orthogonal matrices. Based on the proposed matrix factorization formulas, reduced multiplication complexity, recursive, and radix-2 DST I-IV algorithms are presented. We will present the lowest multiplication complexity DST-IV algorithm in the literature. The paper fills a gap in the self-recursive, exact, and radix-2 DST I-IIII algorithms executed via diagonal, bidiagonal, scaled orthogonal, and simple matrix factors for any input $n=2^{t} \; (t \geq 1)$ . The paper establishes a novel relationship between DST-II and DST-IV matrices using diagonal and bidiagonal matrices. Similarly, a novel relationship between DST-I and DST-III matrices is proposed using sparse and diagonal matrices. These interweaving relationships among DST matrices enable us to bridge the existing factorizations of the DST matrices with the proposed factorization formulas. We present signal flow graphs to provide a layout for realizing the proposed algorithms in DST-based integrated circuit designs. Additionally, we describe an implementation of algorithms based on the proposed DST-II and DST-III factorizations within a double random phase encoding (DRPE) image encryption scheme.