Abstract
We investigate the bandwidth and distance of codes created by ordinary lowpass filtering of a pulse stream. The encoder is thus a convolution, but over the reals. Performance of these codes is compared to the TCM and PRS code families; despite their simplicity, the new codes perform equally well. Since a simple decoder exists,
these are attractive codes.
these are attractive codes.
| Original language | English |
|---|---|
| Title of host publication | Proceedings 2002 IEEE International Symposium on Information Theory (Cat. No.02CH37371) |
| Publisher | IEEE - Institute of Electrical and Electronics Engineers Inc. |
| Pages | 471-471 |
| Number of pages | 1 |
| ISBN (Print) | 0-7803-7501-7 |
| DOIs | |
| Publication status | Published - 2002 |
| Event | IEEE International Symposium on Information Theory (ISIT), 2002 - Lausanne, Switzerland Duration: 2002 Jun 30 → 2002 Jul 5 |
Conference
| Conference | IEEE International Symposium on Information Theory (ISIT), 2002 |
|---|---|
| Country/Territory | Switzerland |
| City | Lausanne |
| Period | 2002/06/30 → 2002/07/05 |
Subject classification (UKÄ)
- Electrical Engineering, Electronic Engineering, Information Engineering
Free keywords
- lowpass filtering
- coded modulation
- outright filtering
- channel coding
- PRS code family
- filtering
- Codes
- bandwidth efficiency
- pulse stream
- TCM code family
- Butterworth filter codes