Binary sequences for spread-spectrum multiple-access communication (Ph.D. Thesis abstr.)


Methods for reducing the complexity of the Viterbi Algorithm for decoding of convolutional codes are considered, and appropriate codes for achieving the optimum performance are investigated. An upper bound on the bit error probability due to truncation of the path length in Viterbi decoding is obtained for any specific code. The length at which the… (More)
DOI: 10.1109/TIT.1978.1055871


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics