Very Low Rate Convolutional Codes for Maximum Theoretical Performance of Spread-Spectrum Multiple-Access Channels

A spread-spectrum multiple-access (SSMA) communication system is treated for which both spreading and error control is provided by binary PSK modulation with orthogonal convolution codes. Performance of spread-spectrum multiple access by a large number of users employing this type of coded modulation is determined in the presence of background Gaussian noise. With this approach and coordinated processing at a common receiver, it is shown that the aggregate data rate of all simultaneous users can approach the Shannon capacity of the Gaussian noise channel. >

[1]  Jr. G. Forney,et al.  The viterbi algorithm , 1973 .

[2]  J. Omura,et al.  On the Viterbi decoding algorithm , 1969, IEEE Trans. Inf. Theory.

[3]  Andrew J. Viterbi,et al.  Error bounds for convolutional codes and an asymptotically optimum decoding algorithm , 1967, IEEE Trans. Inf. Theory.

[4]  A. Viterbi.  Orthogonal Tree Codes for Communication in the Presence of White Gaussian Noise , 1967, IEEE Transactions on Communication Technology.

[5]  Aaron D. Wyner,et al.  Recent results in the Shannon theory , 1974, IEEE Trans. Inf. Theory.

[6]  Roberto Padovani,et al.  Increased Capacity Using CDMA for Mobile Satellite Communication , 1990, IEEE J. Sel. Areas Commun..

[7]  Andrew J. Viterbi,et al.  When not to spread spectrum - A sequel , 1985, IEEE Communications Magazine.

[8]  C.E. Shannon,et al.  Communication in the Presence of Noise , 1949, Proceedings of the IRE.