Decoder using a finite state machine in decoding an abstract syntax notation-message and an encoder for carrying out encoding operation at a high speed
US6081212A · kind A · utility
Assignee
Inventors
Key dates
| Filing date | Feb 26, 1998 |
| Grant date | Jun 27, 2000 |
| Priority date | — |
| Expiry date | Feb 26, 2018 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L69/22
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
In a message decoder (1) including a message decoding section (102) which is supplied with an encoded message given by encoding, according to the Basic Encoding Rule, an objective message defined by an abstract syntax description described in accordance with the Abstract Syntax Notation and which decodes the encoded message into a decoded message corresponding to the objective message, the message decoder further includes a finite state machine generator (2). Alternatively, the message decoder is for use in combination with the finite state machine generator. The finite state machine generator includes a parse tree generating section supplied with the abstract syntax description for generating a parse tree corresponding to the abstract syntax description and a finite state machine generating section for generating a finite state machine (105) on the basis of the parse tree. The message decoding section is connected to the finite state machine generating section to decode the encoded message into the decoded message by the use of the finite state machine.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.