Mostrar el registro sencillo del ítem
DFT-Based Spectral Precoding for Scalable Unique-Word OFDM
| dc.contributor.author | Sharma, Salil | |
| dc.contributor.author | Waqas Haider Shah, Syed | |
| dc.contributor.author | Lacruz, Jesús Omar | |
| dc.contributor.author | Widmer, Joerg | |
| dc.date.accessioned | 2026-06-15T10:26:11Z | |
| dc.date.available | 2026-06-15T10:26:11Z | |
| dc.date.issued | 2026-05 | |
| dc.identifier.uri | https://hdl.handle.net/20.500.12761/2040 | |
| dc.description.abstract | Unique-word orthogonal frequency division multiplexing (UW-OFDM) addresses the spectral inefficiency of cyclic prefix (CP) OFDM by embedding the guard interval within the symbol period. However, its practical adoption is hindered by a prohibitive computational bottleneck. Conventional methods for embedding unique word within the DFT window rely on complex matrix inversions at the transmitter (Tx). While alternative zero-padded (ZP) schemes avoid this complexity, they place guard interval outside DFT window, breaking natural circularity and necessitating noise-enhancing Overlap-Add receiver (Rx). This letter proposes a scalable, closed-form isometric Spectral Precoding architecture that resolves this trade-off. By exploiting frequency-domain interpolation, we implicitly construct the required near-zero-energy tail within the DFT window using only deterministic linear transformations. We prove this construction reduces Tx complexity to log-linear order while preserving standard single-tap equalization without Rx noise enhancement. Validated with 5G-NR numerologies, the scheme matches | es |
| dc.language.iso | eng | es |
| dc.title | DFT-Based Spectral Precoding for Scalable Unique-Word OFDM | es |
| dc.type | journal article | es |
| dc.journal.title | IEEE Communication Letters | es |
| dc.type.hasVersion | AO | es |
| dc.rights.accessRights | open access | es |
| dc.identifier.doi | 10.1109/LCOMM.2026.3698599 | es |
| dc.description.refereed | TRUE | es |
| dc.description.status | inpress | es |


