Abstract
In this contribution the problem of computing the codeword with the highest peak-to-average power ratio in a coded OFDM system is addressed. An approach recently published by Tarokh et. al. is revisited and it is shown that its polynomial complexity in the length of the code can he reduced to linear complexity. The new algorithm is illustrated with some examples.
| Originalsprache | Englisch |
|---|---|
| Seiten (von - bis) | 273-280 |
| Seitenumfang | 8 |
| Fachzeitschrift | ITG-Fachbericht |
| Ausgabenummer | 170 |
| Publikationsstatus | Veröffentlicht - 2002 |
| Extern publiziert | Ja |
| Veranstaltung | 4th International ITG Conference on Source and Channel Coding - Berlin, Deutschland Dauer: 28 Jan. 2002 → 30 Jan. 2002 |