A Reduced Complexity Moment Algorithm for Correlated Digital Signals
Manny Meyers · IEEE Transactions on Communications · 1982
The Cariolaro-Pupolin algorithm for computing the moments of correlated digital signals has a complexity proportional to the cube of the number of states of the finite state coding device. By rearranging the Cariolaro-Pupolin procedure, the author obtains an algorithm whose complexity is proportional to the square of the number of states and yields a vector recursion in place of the original matrix recursion. Running time is reduced by a factor of 2 for the two-state bipolar code (AMI) and a factor of 4 for the four-state Franaszek (4B3T) code. Storage requirements are also significantly reduced.