Power density spectrum of binary block codes with polarity sign
Abstract
The highspeed algorithm developed converts M1 bits of a message into blocks of M bits by adding a Mth bit of value plus 1, with rules for transfer of the entire block, using a sequential finitestate stochastic model based on Markov chain theory. Properties of the transition probability matrix and of the state vector, the normalized expression of the power density spectrum (PDS), and a computational technique using the dimensionality M of the code block, the initial state of the encoder (unless M is odd), and the probability of a digit showing up in the coding sequence, are discussed. Results of normalized PDS calculations are reported for various input values.
 Publication:

Alta Frequenza
 Pub Date:
 November 1976
 Bibcode:
 1976AlFr...45..695B
 Keywords:

 Binary Codes;
 Data Conversion Routines;
 Markov Chains;
 Power Spectra;
 Signal Encoding;
 Algorithms;
 Computer Programs;
 Pulse Communication;
 Sequential Analysis;
 State Vectors;
 Transition Probabilities;
 Communications and Radar