A Low Complexity Modified Decomposition Vector Rotation Model
A low complexity decomposition vector rotation model for digital predistortion is proposed in this paper. In the case of not changing the number of decomposition vector rotation models, the multiplication operation required for parameter extraction can be effectively reduced by increasing the number of zero values in the operator matrix. Through simulation, it can be found that the multiplication operation required for parameter extraction in the proposed model is only 35.24% of that in the DVR model under the same linearization effect. Thus, the proposed nodel can significantly reduce the computational complexity in parameter extraction while maintaining the linearization accuracy.
Authors
- Xu Lu (ORCID: https://orcid.org/0000-0001-8786-2831)
- Han Xiong (ORCID: https://orcid.org/0000-0002-5950-4102)
- Zhang Chen (ORCID: https://orcid.org/0000-0002-1412-2709)
- Liang Chen (ORCID: https://orcid.org/0000-0002-0938-2880)
- Cheng Deng (ORCID: https://orcid.org/0000-0002-7128-3162)
- Yaqi Wu (ORCID: https://orcid.org/0000-0002-0056-4207)
- XinYue Zhu
Institutions
- National University of Defense Technology (CN)
- Nanjing University of Information Science and Technology (CN)
Publication Details
- Published
- 2024-10-18
- DOI
- https://doi.org/10.1109/icct62411.2024.10946469
- Primary Topic
- Matrix Theory and Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00