Signal codes
Authors:
- M. FederMFM. Feder
- 29 June 2008
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 332-336
Abstract
Motivated by signal processing, we present a new class of channel codes, called signal codes, for continuous-alphabet channels. We analyze the codes and provide simulation results indicating that these codes can be practical and are an attractive alternative to trellis-code techniques.Keywords
All Related Versions
This publication has 8 references indexed in Scilit:
- On the complexity of bounded distance decoding for the AWGN channelIEEE Transactions on Information Theory, 2002
- Breadth-first maximum likelihood sequence detection: basicsIEEE Transactions on Communications, 1999
- Modulation and coding for linear Gaussian channelsIEEE Transactions on Information Theory, 1998
- Sequential decoding of trellis codes at high spectral efficienciesIEEE Transactions on Information Theory, 1997
- Reduced-state sequence estimation with set partitioning and decision feedbackIEEE Transactions on Communications, 1988
- The minimum distance for MLSE digital data systems of limited complexityIEEE Transactions on Information Theory, 1975
- Maximum-likelihood sequence estimation of digital sequences in the presence of intersymbol interferenceIEEE Transactions on Information Theory, 1972
- New automatic equaliser employing modulo arithmeticElectronics Letters, 1971