Reduced order RLS polynomial predistortion

Author

JIN, Minglu ; Shin, Sooyoung Kim ; Oh, Deockgil ; Kim, Jaemoung

Author_Institution

Dept. of Broadband Wireless Commun., ETRI, Daejeon, South Korea

Volume

4

fYear

2003

fDate

25-28 May 2003

Abstract

In this paper, a modified recursive least square (RLS) based polynomial predistortion algorithm is proposed by reducing the order of the polynomials used in the RLS algorithm. The basic idea of the reduced order RLS based polynomial predistortion algorithm is to approximate the target function with two simpler functions (with a smaller number of coefficients) instead of a single function. A complex function is decomposed into two simpler functions so that we can compute the RLS algorithm with much less complexity. The proposed reduced order RLS polynomial predistortion shows superior performance compared to the conventional RLS polynomial predistortion with the same number of coefficients or with the same computational complexity.

Keywords

computational complexity; function approximation; least squares approximations; polynomials; reduced order systems; signal processing; RLS algorithm; approximate target function; complex function RLS algorithm complexity; computational complexity; modified recursive least square based polynomial predistortion algorithm; reduced order RLS based polynomial predistortion algorithm; reduced order RLS polynomial predistortion; Broadband communication; Computational complexity; Convergence; Least squares approximation; Polynomials; Power amplifiers; Predistortion; Resonance light scattering; Transfer functions; Wireless communication;

fLanguage

English

Publisher

ieee

Conference_Titel

Circuits and Systems, 2003. ISCAS '03. Proceedings of the 2003 International Symposium on

Print_ISBN

0-7803-7761-3

Type

conf

DOI

10.1109/ISCAS.2003.1205841

Filename

1205841