IP Library Patent Application 12102058
Patent Application
App. No. 12/102,058

Method of Decoding A Bit Sequence, Network Element Apparatus And PDU Specification Tool Kit

Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US None
App. No.
12/102,058
Abstract

In the field of data communications, it is desirable to track bits of a bit sequence remaining to be decoded by a decoder. A method of decoding the bit sequence that corresponds to a PDU comprises reading-in a bit sequence and processing the bit sequence. In order to maintain a record of the bits reaming to be processed, a data stack is used during decoding of the bit sequence.

Claims (30)

1 . A method of decoding a bit sequence, the method comprising:

reading-in the bit sequence corresponding to a PDU;

processing the bit sequence;

during the processing of the bit sequence, using a data stack to maintain a record of a quantity of bits remaining to be processed.

2 . A method as claimed in claim 1 , wherein processing the bit sequence comprises decoding the bit sequence.

3 . A method as claimed in claim 2 , wherein the PDU conforms to a predefined data type definition, the bit sequence being decoded in accordance with the predefined data type definition.

4 . A method as claimed in claim 3 , wherein the PDU comprises a first field having a first length defined by the data type definition.

5 . A method as claimed in claim 3 , wherein the PDU comprises a second field having a second length defined by the data type definition.

6 . A method as claimed in claim 5 , wherein the second field is disposed within the first field.

7 . A method as claimed in claim 5 , wherein the first length of the first field is dependent upon the second length of the second field.

8 . A method as claimed in claim 1 , further comprising:

decoding a number of bits of the bit sequence to obtain size constraint data; and

manipulating the data stack in response to obtaining the size constraint data.

9 . A method as claimed in claim 1 , wherein the data stack is manipulated with respect of a topmost entry thereof.

10 . A method as claimed in claim 9 , wherein the topmost entry of the data stack is manipulated to the exclusion of other entries in the data stack below the topmost entry.

11 . A method as claimed in claim 1 , wherein relative positions in the data stack signify relative positions of fields in the PDU.

12 . A method as claimed in claim 1 , further comprising manipulating the data stack by execution of an operation in relation to the data stack.

13 . A method as claimed in claim 8 , wherein manipulation of the data stack has a side-condition associated therewith, breach of the side-condition being indicative of an error and/or fault.

14 . A network element apparatus comprising:

an input for reading-in, when in use, a bit sequence corresponding to a PDU;

a decoder unit coupled to the input, the decoder unit being arranged to process the bit sequence; wherein

the decoder unit is further arranged to use during the processing of the bit sequence, a data stack to maintain a record of a quantity of bits remaining to be processed.

15 . A PDU specification language toolkit comprising:

a library of operations in order to maintain a data stack having a data entry relating to a constraint of a field for a PDU;

a compiler arranged to use the library of operations in order to compile, when in use, code expressed in an implementation language into object code constituting a PDU decoder for execution by a network element; wherein an operation of the library of operations is executable, when in use, so as to manipulate the data stack during decoding of a bit sequence in order to maintain a record of a quantity of bits of the bit sequence remaining to be processed.

16 . A toolkit as claimed in claim 14 , wherein the operation is arranged to add a data entry to the data stack.

17 . A toolkit as claimed in claim 14 , wherein the operation is arranged to remove a data entry from the data stack.

18 . A toolkit as claimed in claim 14 , wherein the operation is arranged to modify a data entry of the data stack.

19 . A computer program element embodied on a computer readable medium, comprising computer program code means to make a computer execute the method as claimed in claim 1 .

20 - 23 . (canceled)

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 25, 2010
From: AGILENT TECHNOLOGIES, INC.
To: JDS UNIPHASE CORPORATION
Reel/Frame 024433/0138 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 23, 2008
From: MITCHELL, KEVIN; KIRKHAM, TONY
To: AGILENT TECHNOLOGIES, INC.
Reel/Frame 020841/0666 →