EPErik Perrins

Erik Perrins

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Erik Perrins has a total of 26 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Real-Time Decoder Architecture for LDPC–CPM

    by Erik Perrins

    This paper examines the iterative decoding of low-density parity check (LDPC) codes concatenated with continuous phase modulation (CPM). As relevant case studies, we focus on the family of three CPM waveforms that are embodied in the IRIG-106 aeronautical telemetry standard. Two of these CPMs have recently had LDPC codes designed for them for the first time, and thus the decoding complexity of these new schemes is of interest when considering adoption into the standard. We provide comprehensive numerical results that characterize the performance and iteration statistics of the joint LDPC–CPM decoder. These results identify the most advantageous decoder configurations and also expose a key design challenge, which is that LDPC-CPM decoders must deal with a large “peak to average” ratio in terms of global iterations. We show how a properly designed reference simulation can be used as a design tool to explore the performance of a large range of candidate systems without need for further simulation. We develop a real-time decoder architecture with fixed complexity and show how such a decoder can still achieve a relatively large maximum number of global iterations by introducing a trade-off between decoding latency and maximum global iterations. Our discussion shows that this scheme is generally applicable to LDPC-based schemes. We conclude with a comprehensive design study that demonstrates the accuracy of our methodology and its attractive performance–complexity trade-off.

  • Open Access

    Rate-Compatible, Bandwidth-Efficient, Low-Density Parity-Check (LDPC) Codes for Aeronautical Telemetry

    by Andrew D. Cummins, David G. M. Mitchell, Erik Perrins

    Low-density parity-check (LDPC) codes form part of the IRIG-106 standard and have been successfully deployed for the Telemetry Group version of shaped-offset quadrature phase shift keying (SOQPSK-TG) modulation. Recently, LDPC code solutions have been proposed and optimized for continuous phase modulations (CPMs), including pulse code modulation/frequency modulation (PCM/FM) and the multi-h CPM developed by the Advanced-Range TeleMetry program (ARTM CPM), the latter of which was shown to perform around one dB from channel capacity. In this paper, we consider the effect of the random puncturing and shortening of these LDPC codes to further improve spectrum efficiency. We perform asymptotic analyses of the ARTM0 code ensembles and present numerical simulation results that affirm the robust decoding performance promised by LDPC codes designed for ARTM CPM.


  • Open Access

    Rate-Compatible, Bandwidth-Efficient LDPC Codes for Aeronautical Telemetry

    by Andrew D. Cummins, David G. M. Mitchell, Erik Perrins

    Low-density parity-check (LDPC) codes form part of the IRIG-106 standard and have been successfully deployed for the Telemetry Group version of shaped-offset quadrature phase shift keying (SOQPSK-TG) modulation. Recently, LDPC code solutions have been proposed and optimized for continuous phase modulations (CPMs), including pulse code modulation/frequency modulation (PCM/FM) and the multi-h CPM developed by the Advanced Range TeleMetry program (ARTM CPM). These codes were shown to perform around one dB from the respective channel capacities of these modulations. In this paper, we consider the effect of random puncturing and shortening of these LDPC codes to further improve spectrum efficiency. We perform asymptotic analyses of the ARTM0 code ensembles and present numerical simulation results that affirm the robust decoding performance promised by LDPC codes designed for ARTM CPM.

  • Open Access

    Spectrally Efficient LDPC Codes For IRIG-106 Waveforms via Random Puncturing

    by Andrew D. Cummins, David G. M. Mitchell, Erik Perrins

    Low-density parity-check (LDPC) codes form part of the IRIG-106 standard and have been successfully deployed for the Telemetry Group version of shaped-offset quadrature phase shift keying (SOQPSK-TG) modulation. Recently, LDPC code solutions have been proposed and optimized for continuous phase modulations (CPMs), including the pulse code modulation/frequency modulation (PCM/FM) and the multi-h CPM developed by the Advanced Range TeleMetry program (ARTM CPM). These codes were shown to perform around one dB from the respective channel capacities of these modulations. In this paper, we consider the effect of random puncturing of these LDPC codes to further improve spectrum efficiency. We present numerical simulation results that affirm the robust decoding performance promised by LDPC codes designed for ARTM CPM.

  • Open Access

    Content-Aware User Association and Multi-User MIMO Beamforming over Mobile Edge Caching

    by Susanna Mosleh, Qiang Fan, Lingjia Liu, Jonathan D. Ashdown, Erik Perrins, Kurt Turck

    Mobile edge caching (MEC) has been introduced to support ever-growing end-users' needs. To reduce the backhaul traffic demand and content delivery latency, cache-enabled edge servers at base stations (BSs) are employed to provision popular contents at the network edge. In this paper, multiple-input-multiple-output (MIMO) operation and user association policy are linked to the underlying cache placement strategy to ensure a good trade-off between load balancing and backhaul traffic taking into account the underlying wireless channel and the finite cache capacity at edge servers. Due to the coupled interference among mobile stations, the binary nature of the underlying cache placement and user association matrices, the resulting mixed-timescale mixed integer optimization problem is nonconvex and NP-hard. To solve this problem, we decompose the joint optimization problem into a long-term content placement sub-problem and a short-term content delivery sub-problem. A novel iterative algorithm is introduced by leveraging the alternating direction method of multipliers together with a stochastic parallel successive convex approximation-based algorithm. The introduced scheme enables all BSs to update their optimization variables in parallel by solving a sequence of convex subproblems. Simulation evaluation demonstrates the efficiency of our strategy.

  • Optimality Conditions of Performance-Guaranteed Power Minimization in MIMO Networks: A Distributed Algorithm and Its Feasibility

    by Guojun Xiong, Taejoon Kim, David J. Love, Erik Perrins

    A distributed approach is proposed to the problem of signal-to-interference-plus-noise-ratio (SINR)-guaranteed power minimization (SGPM) for multicell multiuser (MCMU) multiple-input multiple-output (MIMO) systems. Unlike prior SGPM approaches, the proposed technique is based on solving necessary and sufficient optimality conditions, which are derived by decomposing the original problem into forward and backward (FB) subproblems, while ensuring the strong duality of each subproblem. The proposed distributed SGPM algorithm makes use of FB adaptation and Jacobi recursion for iterative filter de-sign and power allocation, respectively. A sufficient condition for the feasibility of the proposed distributed algorithm is analyzed, based on the application of the matrix inverse-positive theory.Unlike the existing fully distributed FB filter update algorithms, the proposed approach guarantees target SINR performance as well as its convergence to a stationary point. Simulation results illustrate the enhanced power efficiency with the performance guarantees of the proposed method compared to the existing distributed techniques.


  • Coherence Statistics of Structured Random Ensembles and Support Detection Bounds for OMP

    by Qiyou Duan, Taejoon Kim, Lin Dai, Erik Perrins

    A structured random matrix ensemble that maintains constant modulus entries and unit-norm columns, often called a random phase-rotated (RPR) matrix, is considered in this paper. We analyze the coherence statistics of RPR measurement matrices and apply them to acquire probabilistic performance guarantees of orthogonal matching pursuit (OMP) for support detection (SD). It is revealed via numerical simulations that the SD performance guarantee provides a tight characterization, especially when the signal is sparse.


  • Open Access

    Coherence Statistics of Structured Random Ensembles and Support Detection Bounds for OMP

    by Qiyou Duan, Taejoon Kim, Lin Dai, Erik Perrins

    A structured random matrix ensemble that maintains constant modulus entries and unit-norm columns, often called a random phase-rotated (RPR) matrix, is considered in this paper. We analyze the coherence statistics of RPR measurement matrices and apply them to acquire probabilistic performance guarantees of orthogonal matching pursuit (OMP) for support detection (SD). It is revealed via numerical simulations that the SD performance guarantee provides a tight characterization, especially when the signal is sparse.

  • Energy-Efficient Wireless Communications: From Energy Modeling to Performance Evaluation

    by Farhad Mahmood, Erik Perrins, Lingjia Liu

    In this paper, we analyze energy-efficient communications based on an advanced energy consumption model for wireless devices. The developed model captures relationships between transmission power, transceiver distance, modulation order, channel fading, power amplifier (PA) effects, as well as other circuit components in the radio frequency transceiver. Based the developed model, we are able to identify the optimal modulation order in terms of energy-efficiency under different situations (e.g., different transceiver distance, different PA classes and efficiencies, different pulse shape, etc). This provides an important framework for analyzing energy-efficient communications for different wireless systems ranging from cellular networks to wireless Internet of Things.


  • Burst-Mode Synchronization for SOQPSK

    by Ehsan Hosseini, Erik Perrins

    We consider a comprehensive synchronization strategy for burst-mode transmission of shaped-offset quadrature phase-shift keying (SOQPSK) signals over the additive white Gaussian noise (AWGN) channel. Due to the similarities between SOQPSK and continuous phase modulation (CPM), we make use of recent results for synchronization of burst-mode CPMs. We first derive a training sequence that is optimal in the sense that it jointly minimizes the CrameRao bounds (CRBs) for frequency offset, phase offset, and timing offset estimation. Additionally, we develop a maximum likelihood (ML) dataaided (DA) algorithm for joint estimation of the synchronization parameters for SOQPSK signals. We show that the proposed algorithm for the optimal training sequence can be adapted to work with the suboptimal training sequence that is being considered for use in burst-mode network enhanced telemetry (iNET). This demonstrates an immediate practical application for our approach. We present numerical results on the the meansquared error (MSE) performance of the proposed algorithm for both training sequences and for different versions of SOQPSK. The numerical results show that our joint estimation algorithm yields performance that is very close to the CRBs for all three synchronization variables. Finally, we compare the overall performance of our proposed training sequence and synchronization algorithm for different sequence lengths by simulating a burstmode SOQPSK receiver. This allows us to employ the right training sequence length based on the desired complexity and bit error rate (BER) performance.