Error bounds for multi-h phase codes

Upper and lower bounds for the probability of a decoding error event and for symbol error probability are developed for the class of time-varying phase codes known as multi- h codes. The effect of finite decoder memory is also treated. The analysis is illustrated with numerical examples, and simulation results are compared.

[1]  Daniel J. Costello,et al.  Truncation Error Probability in Viterbi Decoding , 1977, IEEE Transactions on Communications.

[2]  John B. Anderson.  Simulated error performance of multi-h phase codes , 1981, IEEE Trans. Inf. Theory.

[3]  Stephen G. Wilson,et al.  Power Spectra of Multi-h Phase Codes , 1981, IEEE Trans. Commun..

[4]  John B. Anderson,et al.  A bandwidth-efficient class of signal-space codes , 1978, IEEE Trans. Inf. Theory.

[5]  Carl-Erik W. Sundberg,et al.  On the minimum Euclidean distance for a class of signal space codes , 1982, IEEE Trans. Inf. Theory.