Invention Grant
- Patent Title: Method for correcting messages containing bit stuffing
-
Application No.: US13977787Application Date: 2012-01-03
-
Publication No.: US09484956B2Publication Date: 2016-11-01
- Inventor: Raoul Prevost , David Bonacci , Martial Coulon , Jean-Yves Tourneret , Julia Le Maitre , Jean-Pierre Millerioux
- Applicant: Raoul Prevost , David Bonacci , Martial Coulon , Jean-Yves Tourneret , Julia Le Maitre , Jean-Pierre Millerioux
- Applicant Address: FR Paris
- Assignee: CENTRE NATIONAL D'ETUDES SPATIALES ( C.N.E.S.)
- Current Assignee: CENTRE NATIONAL D'ETUDES SPATIALES ( C.N.E.S.)
- Current Assignee Address: FR Paris
- Agency: Cantor Colburn LLP
- Priority: FR1150019 20110103
- International Application: PCT/EP2012/050047 WO 20120103
- International Announcement: WO2012/093116 WO 20120712
- Main IPC: H03M13/03
- IPC: H03M13/03 ; H03M13/25 ; H03M13/39 ; H03M13/41 ; H03M13/00

Abstract:
The invention relates to a method for correcting a message the generation of which involves transforming an initial message and inserting bit stuffing into the transformed message, which method comprises providing an observation sequence containing the message to be corrected. A number of path hypotheses are generated via a trellis diagram associated with the transformation. The nodes of the trellis diagram each represent a state of a finite-state machine capable of transforming the initial message and the branches represent the possible transitions between nodes. Among the branches of the trellis diagram, certain represent conditional transitions that may be made only when bit stuffing is present. During the generation of a path hypothesis, bit stuffing is detected and the branches taken are those associated with the detected bit stuffing. The most likely path hypothesis relative to the observation sequence is finally retained.
Public/Granted literature
- US20130290817A1 Method for correcting messages containing bit stuffing Public/Granted day:2013-10-31
Information query
IPC分类: