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 H of the code. For the examined codes the optimum configurations of H , which give the maximum values of the minimum Euclidean distance, are determined.
Benelli, G., Fantacci, R. (1987). Euclidean Distance for Combinations of Some Hamming Codes and Binary CPFSK Modulation. IEEE TRANSACTIONS ON INFORMATION THEORY, 33(2), 290-293 [10.1109/TIT.1987.1057279].
Euclidean Distance for Combinations of Some Hamming Codes and Binary CPFSK Modulation
BENELLI, GIULIANO;
1987-01-01
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 H of the code. For the examined codes the optimum configurations of H , which give the maximum values of the minimum Euclidean distance, are determined.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11365/22144
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo