• DocumentCode
    2892490
  • Title

    Maximum a Posteriori Bit-Unstuffing

  • Author

    Hicks, James ; Meehan, Tim ; Kragh, Frank

  • Author_Institution
    Aerosp. Corp., Chantilly, VA, USA
  • fYear
    2009
  • fDate
    14-18 June 2009
  • Firstpage
    1
  • Lastpage
    6
  • Abstract
    Bit-stuffing is the procedure of introducing an extra bit in the transmitted stream after a fixed number of consecutive ones or zeros. This paper demonstrates that, for conventional unstuffing, the BER experienced by individual bits within a stuffed frame dramatically and monotonically degrades with its positional-index. We also show that when knowledge of the number of stuffed bits is applied to maximum a posteriori (MAP) bit-unstuffing (MAPBU) (through a BCJR algorithm), this trend is significantly mitigated.
  • Keywords
    encoding; error statistics; maximum likelihood estimation; BCJR algorithm; BER; MAPBU; encoding process; maximum a posteriori bit-unstuffing; Bit error rate; Communications Society; Context modeling; Degradation; Encoding; Equations; Protocols; Redundancy; USA Councils; Wireless sensor networks;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Communications, 2009. ICC '09. IEEE International Conference on
  • Conference_Location
    Dresden
  • ISSN
    1938-1883
  • Print_ISBN
    978-1-4244-3435-0
  • Electronic_ISBN
    1938-1883
  • Type

    conf

  • DOI
    10.1109/ICC.2009.5199172
  • Filename
    5199172