7 citations · 10 across the 6 of their papers we have counts for
6 papers
Least-Squares Design of Chromatic Dispersion Compensation FIR Filters Realized with Overlap-Save Processing
Oscar Gustafsson, Cheolyong Bae, Hakan Johansson
A design method for chromatic dispersion compensation filters realized using overlap-save processing in the frequency domain is proposed. Based on the idea to use the values that a…
Integer Linear Programming Modeling of Addition Sequences With Additional Constraints for Evaluation of Power Terms
Muhammad Abbas, Oscar Gustafsson
In this work, an integer linear programming (ILP) based model is proposed for the computation of a minimal cost addition sequence for a given set of integers. Since exponents are a…
Stochastic Analysis of LMS Algorithm with Delayed Block Coefficient Adaptation
Mohd. Tasleem Khan, Oscar Gustafsson
In high sample-rate applications of the least-mean-square (LMS) adaptive filtering algorithm, pipelining or/and block processing is required. As opposed to earlier work, pipelining…
On Frequency-Domain Implementation of Digital FIR Filters Using Overlap-Add and Overlap-Save Techniques
Hakan Johansson, Oscar Gustafsson
In this paper, new insights in frequency-domain implementations of digital finite-length impulse response filtering (linear convolution) using overlap-add and overlap-save techniqu…
Massive Machine Type Communication Pilot-Hopping Sequence Detection Architectures Based on Non-Negative Least Squares for Grant-Free Random Access
Narges Mohammadi Sarband, Ema Becirovic, Mattias Krysander +2
User activity detection in grant-free random access massive machine type communication (mMTC) using pilot-hopping sequences can be formulated as solving a non-negative least square…
A Distributed Processing Architecture for Modular and Scalable Massive MIMO Base Stations
Erik Bertilsson, Oscar Gustafsson, Erik G. Larsson
In this work, a scalable and modular architecture for massive MIMO base stations with distributed processing is proposed. New antennas can readily be added by adding a new node as…