Metraipolis › archive › dc_be666f476233
Energy-Oriented CGLA Mapping of a Memory-Polynomial Digital Predistortion Kernel — arXiv:2609.27438
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.27438
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T10:07:10.829Z
- SHA-256 of the archived text
482917e21b1aafb7d211c1350b6006f4cbe9b5617ff3071d68724687cc302c1c- Stable URL of this page
https://metraipolis.com/documento/dc_be666f476233
How to cite
Energy-Oriented CGLA Mapping of a Memory-Polynomial Digital Predistortion Kernel — arXiv:2609.27438 — arXiv (en), https://arxiv.org/abs/2609.27438 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_be666f476233 (Metraipolis archive dc_be666f476233, sha256 482917e21b1aafb7d211c1350b6006f4cbe9b5617ff3071d68724687cc302c1c)
BibTeX
@misc{dcbe666f476233,
title = {Energy-Oriented CGLA Mapping of a Memory-Polynomial Digital Predistortion Kernel — arXiv:2609.27438},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.27438},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_be666f476233; sha256 482917e21b1aafb7d211c1350b6006f4cbe9b5617ff3071d68724687cc302c1c},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.27438. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Memory-polynomial digital predistortion (DPD) evaluates a small fixed coefficient set over a sliding input history, so its reduction step is a complex-MAC workload with local reuse. We map this DPD reduction kernel onto In-Memory Accelerator eXtension (IMAX), a programmable CPU-Grounded Linear Array (CGLA) composed of a one-dimensional processing-element/local-memory pipeline. For a (P,M)=(5,5) odd-order memory-polynomial instance, the mapping keeps the 120 B coefficient set in local memory, advances the five-tap history over 1024-sample tiles, and realizes the 15 order-delay terms as a 33-stage streaming complex-MAC reduction. The evaluation measures kernel latency and modeled energy. All measured paths use the same single-precision complex workload of 32 sequences, each with 2048 complex samples, across an IMAX FPGA prototype, a CUDA implementation on an RTX 4090 system, and an ARM-NEON implementation on Jetson AGX Orin. With this 1024-sample tile configuration, the IMAX FPGA prototype reports 20.201 ms end-to-end latency and 1.948 ms kernel-only latency. Using the previously reported 28 nm IMAX frequency and power model, the projected IMAX configuration gives 3.14 ms end-to-end latency and 0.34 ms kernel-only latency. The RTX 4090 baseline has the lowest end-to-end latency at 0.484 ms. Under model-based platform power accounting and the stated power assumptions, the projected IMAX configuration gives 169.1 times smaller modeled end-to-end energy per batch than the RTX 4090 baseline. This value uses platform power assumptions rather than workload-dependent runtime power or a direct silicon power measurement. A controlled synthetic PA-model validation checks that the same 15-term form improves test-set NMSE by 26.1 dB and ACLR by 26.0 dB. These results characterize the mapped memory-polynomial DPD reduction on IMAX for the evaluated tile configuration and power model. Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-24 in cs.AR). Categorie arXiv: Hardware Architecture (cs.AR). Pagina del lavoro: https://arxiv.org/abs/2609.27438 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-08T09:14:39.461Z dalla pagina https://arxiv.org/catchup/cs.AR/2026-09-24?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).