TPThomas Paireder

Thomas Paireder

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Thomas Paireder has a total of 13 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    SICNet—Low Complexity Sample Adaptive Neural Network-Based Self-Interference Cancellation in LTE-A/5G Mobile Transceivers

    by Oliver Ploder, Christina Auer, Christian Motz, Thomas Paireder, Oliver Lang, Mario Huemer

    The limited transmitter-to-receiver stop-band isolation of the duplexers in long term evolution (LTE) and 5G/NR frequency division duplex transceivers induces leakage signals from the transmitter(s) (Tx) into the receiver(s) (Rx). These leakage signals are the root cause of a multitude of self-interference (SI) problems in the receiver path(s) diminishing a receiver’s sensitivity. Traditionally, these effects are counteracted by the use of various different SI cancellation (SIC) architectures which typically solely target one specific problem. In this paper, we propose two novel neural networks based architectures that can handle a variety of different SI effects without the need for a different architecture for each effect. We additionally show the suitability of the proposed architecture on SI effects occurring in in-band full duplex transceivers. Further, we introduce two novel low-cost training algorithms to enable online adaptation (as opposed to offline training currently proposed in literature). The combination of these two concepts is shown to not only beat existing algorithms in their cancellation performance, but also to provide sufficiently low computational complexity allowing on-chip implementations.


  • Open Access

    A new class of self‐normalising LMS algorithms

    by Oliver Ploder, Oliver Lang, Thomas Paireder, Christian Motz, Mario Huemer

    Many researchers and practitioners make heavy use of the least mean squares (LMS) algorithm as an efficient adaptive filter suitable for a multitude of problems. Despite being versatile and efficient, a drawback of this algorithm is that the adaptation rate, i.e. step‐size, has to be chosen very carefully in order to get the desired result (optimum compromise between fast adaptation and low steady state error). This choice was simplified by the invention of the normalised LMS, which bounds the step‐size and guarantees convergence. However, the optimum choice of the normalisation becomes non‐trivial if the system to be approximated is part of a bigger, non‐trivial model, e.g. cascaded filters or linear paths followed by nonlinearities. Such cases usually require approximations or worst‐case estimates in order to yield a normalised update algorithm, which might result in sub‐optimal performance. To counteract this problem, a new class of LMS algorithms which automatically choose their own normalisation terms, the so‐called self normalising LMS, is introduced. The simulations show that this new algorithm not only outperforms state‐of‐the‐art solutions in terms of steady state performance in a cascaded filter scenario but also converges just as fast as all other considered algorithms.


  • Open Access

    Adaptive System Identification via Low-Rank Tensor Decomposition

    by Christina Auer, Oliver Ploder, Thomas Paireder, Peter Kovacs, Oliver Lang, Mario Huemer

    Tensor-based estimation has been of particular interest of the scientific community for several years now. While showing promising results on system estimation and other tasks, one big downside is the tremendous amount of computational power and memory required – especially during training – to achieve satisfactory performance. We present a novel framework for different classes of nonlinear systems, that allows to significantly reduce the complexity by introducing a least-mean-squares block before, after, or between tensors to reduce the necessary dimensions and rank required to model a given system. Our simulations show promising results that outperform traditional tensor models, and achieve equal performance to comparable algorithms for all problems considered while requiring significantly less operations per time step than either of the state-of-the-art architectures.


  • Open Access

    Spline-Based Adaptive Cancellation of Even-Order Intermodulation Distortions in LTE-A/5G RF Transceivers

    by Thomas Paireder, Christian Motz, Mario Huemer

    Radio frequency transceivers operating in in-band full-duplex or frequency-division duplex mode experience strong transmitter leakage. Combined with receiver nonlinearities, this causes intermodulation products in the baseband, possibly with higher power than the desired receive signal. In order to restore the receiver signal-to-noise ratio in such scenarios, we propose two novel digital self-interference cancellation approaches based on spline interpolation. Both employ a Wiener structure, thereby matching the baseband model of the intermodulation effect. Unlike most state-of-the-art spline-based adaptive learning schemes, the proposed concept allows for complex-valued in- and out-put signals. The optimization of the model parameters is based on the stochastic gradient descent concept, where the convergence is supported by an appropriate step-size normalization. Additionally, we provide a gain control scheme and enable pipelining in order to facilitate a hardware implementation. An optional input transform improves the performance consistency for correlated sequences. In a realistic interference scenario, the proposed algorithms clearly outperform a state-of-the-art least mean squares variant with comparable complexity, which is specifically tailored to second-order intermodulation distortions. The high flexibility of the spline interpolation allows the spline-based Wiener models to match the performance of the kernel recursive least squares algorithm at less than 0.6% of the arithmetic operations.

  • Open Access

    Deep unfolding based hyper‐parameter optimisation for self‐interference cancellation in LTE‐A/5G‐transceivers

    by C. Motz, T. Paireder, M. Huemer

    Deep unfolding is a very promising concept that allows to combine the advantages of traditional estimation techniques, such as adaptive filters, and machine learning approaches, like artificial neural networks. Focusing on a challenging self‐interference problem occurring in frequency‐division duplex radio frequency transceivers, namely modulated spurs, it is shown that deep unfolding enables remarkable performance gains. Based on the hyper‐parameter optimisation of several least‐mean squares (LMS) variants and the recursive‐least squares algorithm, the importance of a well‐chosen loss function are highlighted. Especially the variable step‐size LMS and the transform‐domain LMS vastly benefit without increased runtime complexity.


  • Open Access

    Spline-Based Adaptive Cancellation of Even-Order Intermodulation Distortions in LTE-A/5G RF Transceivers

    by Thomas Paireder, Christian Motz, Mario Huemer

    Radio frequency transceivers operating in in-band full-duplex or frequency-division duplex mode experience strong transmitter leakage. Combined with receiver nonlinearities, this causes intermodulation products in the baseband, possibly with higher power than the desired receive signal. In order to restore the receiver signal-to-noise ratio in such scenarios, we propose two novel digital self-interference cancellation approaches based on spline interpolation. Both employ a Wiener structure, thereby matching the baseband model of the intermodulation effect. Unlike most state-of-the-art spline-based adaptive learning schemes, the proposed concept allows for complex-valued in- and output signals. The optimization of the model parameters is based on the stochastic gradient descent concept, where the convergence is supported by an appropriate step-size normalization. Additionally, we provide a gain control scheme and enable pipelining in order to facilitate a hardware implementation. An optional input transform improves the performance consistency for correlated sequences. In a realistic interference scenario, the proposed algorithms clearly outperform a state-of-the-art least mean squares variant with comparable complexity, which is specifically tailored to second-order intermodulation distortions. The high flexibility of the spline interpolation allows the spline-based Wiener models to match the performance of the kernel recursive least squares algorithm at less than 0.6 % of the arithmetic operations.


  • Open Access

    Enhanced Propriety-Based I/Q Imbalance Compensation in LTE/NR Receivers

    by Thomas Paireder, Christian Motz, Mario Huemer

    In mobile communications, radio-frequency receivers are mainly implemented using the direct-conversion architecture. A critical aspect in the design of this receiver type is the matching between the analog in-phase (I) and quadrature (Q) paths. Any gain or phase imbalance generates image components in the baseband, which distort the desired receive signal. Many digital solutions for online compensation of this effect have been proposed in the literature. A common statistical measure that is used by non-data-aided algorithms is the so-called propriety of the receive signal. This concept is suitable for most communication signals, but fails, for instance, in case of the real-valued binary phase-shift keying (BPSK) modulation. In this work, we provide a thorough statistical analysis of Long-Term Evolution (LTE) and New Radio (NR) up- and downlink sequences, which allows us to extend a propriety-based estimator to improper alphabets. This algorithm employs the method of moments. We show that the observed signal statistics can be altered by omitting a predefined set of samples. In a second step, we prove that this concept substantially enhances the imbalance compensation also for proper quadrature amplitude modulation (QAM) alphabets. All theoretical results are supported by simulations to evaluate the actual performance gains in practical scenarios. Depending on the resource block allocation and the noise levels, we obtain double-digit improvements of the image rejection ratio, while reducing the computational effort by about 6.6% compared to the standard moment-based I/Q imbalance estimator.


  • Open Access

    Normalized stochastic gradient descent learning of general complex‐valued models

    by T. Paireder, C. Motz, M. Huemer

    The stochastic gradient descent (SGD) method is one of the most prominent first‐order iterative optimisation algorithms, enabling linear adaptive filters as well as general nonlinear learning schemes. It is applicable to a wide range of objective functions, while featuring low computational costs for online operation. However, without a suitable step‐size normalisation, the convergence and tracking behaviour of the stochastic gradient descent method might be degraded in practical applications. In this letter, a novel general normalisation approach is provided for the learning of (non‐)holomorphic models with multiple independent parameter sets. The advantages of the proposed method are demonstrated by means of a specific widely‐linear estimation example.


  • Open Access

    Low-Complex Digital Cancellation of Transmitter Harmonics in LTE-A/5G Transceivers

    by Christian Motz, Thomas Paireder, Mario Huemer

    Nowadays, mobile communication radio frequency transceivers for LTE-A/5G usually operate in frequency-division duplex mode and support carrier aggregation. The resulting complexity requires compromises in the analog front-end. One consequence is a limited stop-band attenuation of the duplex filters that separate the transmit and the receive paths. The resulting transmit leakage signal combined with other non-idealities, like power amplifier (PA) harmonics, can create self-interference problems that desensitize the receivers. In this work, we propose an optimized digital self-interference cancellation scheme to mitigate the unacceptable performance degradation caused by PA induced harmonics. We derive an appropriate interference model and quantify the interference power levels for a specific PA. Based on these results, our low-complex cancellation approach solely targets the dominating components. Our algorithm relies on the auto-covariance matrix for the second and third power of LTE signals, which we derive for the first time in an analytic form. This statistical information can be combined with the transform-domain concept to noticeably improve the performance of a least-mean squares based cancellation algorithm. The capabilities of the approach are demonstrated by means of simulations and are validated on measurement data.


  • Open Access

    A Survey on Self-Interference Cancellation in Mobile LTE-A/5G FDD Transceivers

    by Christian Motz, Thomas Paireder, Harald Pretl, Mario Huemer

    This brief deals with self-interference (SI) effects in mobile communication radio frequency (RF) transceivers. The basics of current communication standards, namely Long-Term Evolution (LTE) and 5G, are outlined with a focus on carrier aggregation (CA). RF transceivers that support frequency-division duplex (FDD) and CA variants operate multiple receivers and transmitters simultaneously. We illustrate the resulting SI problems, present suitable models for different SI categories and discuss the associated interference estimation tasks. Moreover, we explain the basic architecture of two common countermeasures: digital and mixed-signal SI cancellation.