Searcharxiv⌕ Search

arXiv subjects

Håkan Johansson

Publications and source records attributed to Håkan Johansson.

17 recordsLinked to original sources

Efficient Computation of Time-Index Powered Weighted Sums Using Cascaded Accumulators

This letter presents a novel approach for \mbox{efficiently} computing time-index powered weighted sums of the form $\sum_{n=0}^{N-1} n^{K} v[n]$ using cascaded accumulators. Traditional direct computation requires $K{\times}N$ general multiplications, which become prohibitive for large $N$, while alternative strategies based on lookup tables or signal reversal require storing entire data blocks. By exploiting accumulator properties, the proposed method eliminates the need for such storage and reduces the multiplicative cost to only $K{+}1$ constant multiplications, enabling efficient real-time implementation. The approach is particularly useful when such sums need to be efficiently computed in sample-by-sample processing systems.

eess.SP↗

A Unified Analytical Nullspace-Based Least-Squares Design of the Farrow Structure

Farrow structures based on linear--phase FIR subfilters provide an efficient realization of variable fractional--delay (VFD) filters with reduced implementation complexity. While the all--linear--phase configuration admits a decoupled least--squares (LS) formulation with an analytical solution, this decoupling fails when branches of mixed types, linear--phase and general FIR, are required, as occurs when a group--delay constraint is imposed. This letter presents a unified LS design for Farrow structures via a nullspace parameterization of the per--branch symmetry constraints, yielding an analytical solution that accommodates arbitrary per--branch types. Numerical results demonstrate that the proposed framework satisfies group--delay constraints that the all linear--phase approach cannot meet, while substantially reducing the number of free parameters relative to the unconstrained general FIR baseline.

eess.SP↗

Joint Sampling Frequency Offset Estimation and Compensation Algorithms Based on the Farrow Structure

This paper presents joint sampling frequency offset (SFO) estimation and compensation algorithms based on the Farrow structure. Unlike conventional approaches that treat estimation and compensation separately, the proposed framework exploits the interpolator structure to enable a low-complexity, fully time-domain solution applicable to arbitrary bandlimited signals, without imposing constraints on the waveform or requiring Fourier transform based processing. The estimation stage can operate on a real-valued component of a complex signal and supports the simultaneous estimation of SFO and sampling time offset, while being inherently robust to other synchronization impairments such as carrier frequency offset. The proposed estimation algorithms rely on two complementary methods, specifically, Newton's method and iterative least-squares formulation. The implementations of the estimators are presented and the overall computational complexity is analyzed, showing that the complexity scales only linearly with the number of samples employed. Numerical results for real and complex multisine and bandpass-filtered white noise signals demonstrate accurate estimation and effective compensation over a wide range of operating conditions, confirming the flexibility and efficiency of the proposed approach. Moreover, the influence of the Farrow structure approximation error on the SFO estimation accuracy is investigated.

eess.SP↗

Low-Complexity Frequency-Dependent Linearizers Based on Parallel Bias-Modulus and Bias-ReLU Operations

This paper introduces low-complexity frequency-dependent (memory) linearizers designed to suppress nonlinear distortion in analog-to-digital interfaces. Two different linearizers are considered, based on nonlinearity models which correspond to sampling before and after the nonlinearity operations, respectively. The proposed linearizers are inspired by convolutional neural networks but have an order-of-magnitude lower implementation complexity compared to existing neural-network-based linearizer schemes. The proposed linearizers can also outperform the traditional parallel Hammerstein (as well as Wiener) linearizers even when the nonlinearities have been generated through a Hammerstein model. Further, a design procedure is proposed in which the linearizer parameters are obtained through matrix inversion. This eliminates the need for costly and time-consuming iterative nonconvex optimization which is traditionally associated with neural network training. The design effectively handles a wide range of wideband multi-tone signals and filtered white noise. Examples demonstrate significant signal-to-noise-and-distortion ratio (SNDR) improvements of some $20$--$30$ dB, as well as a lower implementation complexity than the Hammerstein linearizers.

eess.SP↗

Closed-Form Least-Squares Design of Fast-Convolution Based Variable-Bandwidth FIR Filters

This paper introduces a closed-form least-squares (LS) design approach for fast-convolution (FC) based variable-bandwidth (VBW) finite-impulse-response (FIR) filters. The proposed LS design utilizes frequency sampling and the VBW filter frequency-domain implementation using the overlap-save (OLS) method, that together offer significant savings in implementation and online bandwidth reconfiguration complexities. Since combining frequency-domain design and OLS implementation leads to a linear periodic time-varying (LPTV) behavior of the VBW filter, a set of the corresponding time-invariant impulse responses is considered in the proposed design. Through numerical examples, it is demonstrated that the proposed approach enables not only closed-form design of FC-based VBW filters with substantial complexity reductions compared to existing solutions for a given performance, but also allows the variable bandwidth range to be extended without any increase in complexity. Moreover, a way of reducing the maximum approximation error energy over the whole set of the time-invariant filters of the LPTV system is shown by introducing appropriate weighting functions in the design.

eess.SP↗

Low-Complexity Memoryless Linearizer for Analog-to-Digital Interfaces

This paper introduces a low-complexity memoryless linearizer for suppression of distortion in analog-to-digital interfaces. It is inspired by neural networks, but has a substantially lower complexity than the neural-network schemes that have appeared earlier in the literature in this context. The paper demonstrates that the proposed linearizer can outperform the conventional parallel memoryless Hammerstein linearizer even when the nonlinearities have been generated through a memoryless polynomial model. Further, a design procedure is proposed in which the linearizer parameters are obtained through matrix inversion. Thereby, the costly and time consuming numerical optimization that is traditionally used when training neural networks is eliminated. Moreover, the design and evaluation incorporate a large set of multi-tone signals covering the first Nyquist band. Simulations show signal-to-noise-and-distortion ratio (SNDR) improvements of some 25 dB for multi-tone signals that correspond to the quadrature parts of OFDM signals with QPSK modulation.

eess.SP↗

Joint Sampling Frequency Offset Estimation and Compensation Based on the Farrow Structure

This paper introduces a sampling frequency offset (SFO) estimation method based on the Farrow structure, which is typically utilized for the SFO compensation and thereby enables a reduction of the implementation complexity of the SFO estimation. The proposed method is implemented in the time domain and works for arbitrary bandlimited signals, thus with no additional constraints on the waveform structure. Moreover, it can operate on only the real or imaginary part of a complex signal, which further reduces the estimation complexity. Furthermore, the proposed method can simultaneously estimate the SFO and additional sampling time offset (STO) and it is insensitive to other synchronization errors, like carrier frequency offset. Both the derivations of the proposed method and its implementation are presented, and through simulation examples, it is demonstrated that it can accurately estimate both SFO and STO for different types of bandlimited signals.

eess.SP↗

Digital Linearizer Based on 1-Bit Quantizations

This paper introduces a novel low-complexity memoryless linearizer for suppression of distortion in analog frontends. It is based on our recently introduced linearizer which is inspired by neural networks, but with orders-of-magnitude lower complexity than conventional neural-networks considered in this context, and it can also outperform the conventional parallel memoryless Hammerstein linearizer. Further, it can be designed through matrix inversion and thereby the costly and time consuming numerical optimization traditionally used when training neural networks is avoided. The linearizer proposed in this paper is different in that it uses 1-bit quantizations as nonlinear activation functions and different bias values. These features enable a look-up table implementation which eliminates all but one of the multiplications and additions required for the linearization. Extensive simulations and comparisons are included in the paper, for distorted multi-tone signals and bandpass filtered white noise, which demonstrate the efficacy of the proposed linearizer.

eess.SP↗

Order Estimation of Linear-Phase FIR Filters for DAC Equalization in Multiple Nyquist Bands

This letter considers the design of linear-phase finite-length impulse response (FIR) filters for equalization of the frequency responses of digital-to-analog converters (DACs). The letter derives estimates for the filter orders required, as functions of the bandwidth and equalization accuracy, for four DAC pulses that are used in DACs in multiple Nyquist bands. The estimates are derived through a large set of minimax-optimal equalizers and the use of symbolic regression followed by minimax-optimal curve fitting for further enhancement. Design examples included demonstrate the accuracy of the proposed estimates. In addition, the letter discusses the appropriateness of the four types of linear-phase FIR filters, for the different equalizer cases, as well as the corresponding properties of the equalized systems.

eess.SP↗

Modeling, Analysis, and Optimization of Cascaded Power Amplifiers

This paper deals with modeling, analysis, and optimization of power amplifiers (PAs) placed in a cascaded structure, particularly the effect of cascaded nonlinearities is studied by showing potential ways to minimize the total nonlinearities. The nonlinear least-squares algorithm is proposed to optimize the PA parameters along with the input power level, and thereby minimize the total nonlinearities in the cascaded structure. The simulation results demonstrate that the performance of the optimized configurations for up to five PAs using the proposed framework can improve the linearity properties of the overall cascade.

eess.SP↗

Efficient Design and Implementation of Fast-Convolution-Based Variable-Bandwidth Filters

This paper introduces an efficient design approach for a fast-convolution-based variable-bandwidth (VBW) filter. The proposed approach is based on a hybrid of frequency sampling and optimization (HFSO), that offers significant computational complexity reduction compared to existing solutions for a given performance. The paper provides a design procedure based on minimax optimization to obtain the minimum complexity of the overall filter. A design example includes a comparison of the proposed design-based VBW filter and time-domain designed VBW filters implemented in the time domain and in the frequency domain. It is shown that not only the implementation complexity can be reduced but also the design complexity by excluding any computations when the bandwidth of the filter is adjusted. Moreover, memory requirements are also decreased compared to the existing frequency-domain implementations.

eess.SP↗

A General Approach to Fully Linearize the Power Amplifiers in mMIMO with Less Complexity

A radio frequency (RF) power amplifier (PA) plays an important role to amplify the message signal at higher power to transmit it to a distant receiver. Due to a typical nonlinear behavior of the PA at high power transmission, a digital predistortion (DPD), exploiting the preinversion of the nonlinearity, is used to linearize the PA. However, in a massive MIMO (mMIMO) transmitter, a single DPD is not sufficient to fully linearize the hundreds of PAs. Further, for the full linearization, assigning a separate DPD to each PA is complex and not economical. In this work, we address these challenges via the proposed low-complexity DPD (LC-DPD) scheme. Initially, we describe the fully-featured DPD (FF-DPD) scheme to linearize the multiple PAs and examine its complexity. Thereafter, using it, we derive the LC-DPD scheme that can adaptively linearize the PAs as per the requirement. The coefficients in the two schemes are learned using the algorithms that adopt indirect learning architecture based recursive prediction error method (ILA-RPEM) due to its adaptive and free from matrix inversion operations. Furthermore, for the LC-DPD structure, we have proposed three algorithms based on correlation of its common coefficients with the distinct coefficients. Lastly, the performance of the algorithms are quantified using the obtained numerical results.

cs.IT↗

A Low-Complexity Post-Weighting Predistorter in a mMIMO Transmitter Under Crosstalk

The beam-oriented digital predistortion (BO-DPD) is not sufficient to linearize the output from a subarray of power amplifiers (PAs) in different directions except the desired direction. Therefore, subsequent to the BO-DPD operation, we perform a post-weighting (PW) processing to minimize the nonlinear radiations in the wide range of directions under crosstalk. Here, the optimized PW coefficients are multiplied by the polynomial terms of the BO-DPD, then, the resultant signals are distributed to the PAs to compensate the nonlinear radiations. In this work, first, we propose fully-featured post-weighting (FF-PW) scheme, then, we derive a low-complexity post-weighting (LC-PW) scheme.

cs.NI↗

SPSA-Based Successive Beamforming for Mobile Satellite Receivers with Phased Arrays

Efficient and low-complexity beamforming design is an important element of satellite communication systems with mobile receivers equipped with phased arrays. In this work, we apply the simultaneous perturbation stochastic approximation (SPSA) method with successive sub-array selection for finding the optimal antenna weights that maximize the received signal power at a uniform plane array (UPA). The proposed algorithms are based on iterative gradient approximation by injecting some carefully designed perturbations on the parameters to be estimated. Additionally, the successive sub-array selection technique enhances the performance of SPSA-based algorithms and makes them less sensitive to the initial beam direction. Simulation results show that our proposed algorithms can achieve efficient and reliable performance even when the initial beam direction is not well aligned with the satellite direction.

eess.SP↗

Performance Analysis of Quantized Uplink Massive MIMO-OFDM With Oversampling Under Adjacent Channel Interference

Massive multiple-input multiple-output (MIMO) systems have attracted much attention lately due to the many advantages they provide over single-antenna systems. Owing to the many antennas, low-cost implementation and low power consumption per antenna are desired. To that end, massive MIMO structures with low-resolution analog-to-digital converters (ADC) have been investigated in many studies. However, the effect of a strong interferer in the adjacent band on quantized massive MIMO systems have not been examined yet. In this study, we analyze the performance of uplink massive MIMO with low-resolution ADCs under frequency selective fading with orthogonal frequency division multiplexing in the perfect and imperfect receiver channel state information cases. We derive analytical expressions for the bit error rate and ergodic capacity. We show that the interfering band can be suppressed by increasing the number of antennas or the oversampling rate when a zero-forcing receiver is employed.

cs.IT↗

Optimal Least-Squares Estimator and Precoder for Energy Beamforming over IQ-Impaired Channels

Usage of low-cost hardware in large antenna arrays and low-power wireless devices in Internet-of-Things (IoT) has led to the degradation of practical beamforming gains due to the underlying hardware impairments like in-phase-and-quadrature-phase imbalance (IQI). To address this timely concern, we present a new nontrivial closed-form expression for the globally-optimal least-squares estimator (LSE) for the IQI-influenced channel between a multiantenna transmitter and single-antenna IoT device. Thereafter, to maximize the realistic transmit beamforming gains, a novel precoder design is derived that accounts for the underlying IQI for maximizing received power in both single and multiuser settings. Lastly, the simulation results, demonstrating a significant -8dB improvement in the mean-squared error of the proposed LSE over existing benchmarks, show that the optimal precoder designing is more critical than accurately estimating IQI-impaired channels. Also, the proposed jointly-optimal LSE and beamformer outperforms the existing designs by providing 24% enhancement in the mean signal power received under IQI.

eess.SP↗

Optimal Channel Estimation for Hybrid Energy Beamforming under Phase Shifter Impairments

Smart multiantenna wireless power transmission can enable perpetual operation of energy harvesting (EH) nodes in the internet-of-things. Moreover, to overcome the increased hardware cost and space constraints associated with having large antenna arrays at the radio frequency (RF) energy source, the hybrid energy beamforming (EBF) architecture with single RF chain can be adopted. Using the recently proposed hybrid EBF architecture modeling the practical analog phase shifter impairments (API), we derive the optimal least-squares estimator for the energy source to EH user channel. Next, the average harvested power at the user is derived while considering the nonlinear RF EH model and a tight analytical approximation for it is also presented by exploring the practical limits on the API. Using these developments, the jointly global optimal transmit power and time allocation for channel estimation (CE) and EBF phases, that maximizes the average energy stored at the EH user is derived in closed form. Numerical results validate the proposed analysis and present nontrivial design insights on the impact of API and CE errors on the achievable EBF performance. It is shown that the optimized hybrid EBF protocol with joint resource allocation yields an average performance improvement of $37\%$ over benchmark fixed allocation scheme.

cs.IT↗