Title :
A Reduced Complexity Moment Algorithm for Correlated Digital Signals
Author_Institution :
Bell Labs., North Andover, MA, USA
fDate :
7/1/1982 12:00:00 AM
Abstract :
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.
Keywords :
digital signals; error statistics; signal processing; Cariolaro-Pupolin procedure; code; correlated digital signals; finite state coding device; matrix recursion; reduced complexity moment algorithm; vector recursion; Ambient intelligence; Closed-form solution; Communications Society; Density functional theory; Digital systems; Error probability; Intersymbol interference; Phase change materials; Random variables; Resists;
Journal_Title :
Communications, IEEE Transactions on
DOI :
10.1109/TCOM.1982.1095631
