On Efficient Polyphase Network Implementation Using Successive Vector Approximation
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2026
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866917227236687872 |
|---|---|
| author | Coelho, Luiz F. da S. Ruyet, Didier Le Diniz, Paulo S. R. |
| author_facet | Coelho, Luiz F. da S. Ruyet, Didier Le Diniz, Paulo S. R. |
| contents | In this work, we explore an energy-efficient implementation of the polyphase network for a filter bank multicarrier (FBMC) system. The network is approximated using a greedy algorithm based on matching pursuits (MP) that converts the numerical representation directly from floating point to sum of signed powers of two (SOPOT), which is key for a multiplierless implementation. We compare this technique with other state-of-the-art methods for designing multiplierless hardware, and show that our technique achieves superior performance with similar computational complexity. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_20411 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | On Efficient Polyphase Network Implementation Using Successive Vector Approximation Coelho, Luiz F. da S. Ruyet, Didier Le Diniz, Paulo S. R. Information Theory In this work, we explore an energy-efficient implementation of the polyphase network for a filter bank multicarrier (FBMC) system. The network is approximated using a greedy algorithm based on matching pursuits (MP) that converts the numerical representation directly from floating point to sum of signed powers of two (SOPOT), which is key for a multiplierless implementation. We compare this technique with other state-of-the-art methods for designing multiplierless hardware, and show that our technique achieves superior performance with similar computational complexity. |
| title | On Efficient Polyphase Network Implementation Using Successive Vector Approximation |
| topic | Information Theory |
| url | https://arxiv.org/abs/2601.20411 |