DocumentCode :
942635
Title :
Euclidean distance for combinations of some Hamming codes and binary CPFSK modulation (Corresp.)
Author :
Benelli, G. ; Fantacci, R.
Volume :
33
Issue :
2
fYear :
1987
fDate :
3/1/1987 12:00:00 AM
Firstpage :
290
Lastpage :
293
Abstract :
The integration of channel coding and modulation in a communication system to increase the Euclidean distance between modulated signals is analyzed. Systems using binary continuous-phase frequency-shift keying modulation and some block codes, such as Hamming codes and shortened Hamming codes, are considered. It is shown that the minimum Euclidean distance depends on the configuration of the parity-check matrix 
of the code. For the examined codes the optimum configurations of , which give the maximum values of the minimum Euclidean distance, are determined.
of the code. For the examined codes the optimum configurations of , which give the maximum values of the minimum Euclidean distance, are determined.Keywords :
Continuous phase modulation; Hamming coding; Block codes; Channel coding; Decoding; Demodulation; Digital communication; Euclidean distance; Frequency modulation; Frequency shift keying; Hamming distance; Modulation coding;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1987.1057279
Filename :
1057279
Link To Document :
