• DocumentCode
    2655003
  • Title

    Probabilities of long sequences of identical bits after data scrambling

  • Author

    Zimmermann, Gerd

  • Author_Institution
    Philips Kommunikations Ind. AG, Nurnberg, Germany
  • Volume
    3
  • fYear
    1993
  • fDate
    23-26 May 1993
  • Firstpage
    1521
  • Abstract
    The automaton approach is used to obtain a theoretical basis and a fast algorithm for analytically calculating the probability of receiving any distinct encoded data sequence, where it is assumed that the data source and the encoder can be modeled as finite stochastic and deterministic automatons, respectively. This algorithm is used for calculating the probabilities of receiving long sequences of identical bits (which are normally seen to be disadvantageous for data communication systems) encoded by various types of data scramblers
  • Keywords
    binary sequences; data communication; deterministic automata; finite automata; memoryless systems; probability; stochastic automata; data scrambling; encoded data sequence; fast algorithm; finite deterministic automation; finite stochastic automation; long sequences of identical bits; probability; Algorithm design and analysis; Automata; Data communication; Probability; Statistical distributions; Stochastic processes; Timing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Communications, 1993. ICC '93 Geneva. Technical Program, Conference Record, IEEE International Conference on
  • Conference_Location
    Geneva
  • Print_ISBN
    0-7803-0950-2
  • Type

    conf

  • DOI
    10.1109/ICC.1993.397538
  • Filename
    397538