# US 2004/0057466 A1 · Method for structuring a bitstream for binary multimedia descriptons and a method for parsing this bitstream

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2004/0057466 A1
- Document ID: US20040057466A1
- Status: Published application
- Kind: A1
- Application number: 10/399,633
- Filed: 2003-09-17
- Published: 2004-03-25
- Earliest claimed: 2000-10-20
- Assignees: Robert Bosch GmbH
- Inventors: Michael Wollborn
- Web page: https://patentgrep.com/patent/US20040057466A1

## CPC

- H04N 21/8543: using a description language, e.g. Multimedia and Hypermedia information coding Expert Group [MHEG], eXtensible Markup Language [XML] {(information retrieval of semistructured data, the underlying structure being taken into account, e.g. mark-up language structure data G06F16/80)}
- H04N 21/235: Processing of additional data, e.g. scrambling of additional data or processing content descriptors
- H04N 21/435: Processing of additional data, e.g. decrypting of additional data, reconstructing software from modules extracted from the transport stream
- H04N: PICTORIAL COMMUNICATION, e.g. TELEVISION

## Abstract

For structuring a bitstream for binary multimedia descriptions, binary identifiers (BIDs) are positioned on at least one regular positioning grid. Parsing is performed by checking these binary identifiers (BIDs) on the positions defined by the positioning grid.

## Claims

### Claim 1

Method for structuring a bitstream for binary multimedia descriptions, where binary identifiers (BIDS) representing opening and closing tags of descriptors (D) and/or description schemes (DS) are used, characterised in that said binary identifiers (BIDs) are positioned on at least one regular positioning grid within the bitstream.

### Claim 2 (depends on 1)

Method for parsing a bitstream structured according to claim 1, characterised in that parsing is carried out by checking said binary identifiers (BIDS) on the positions defined by said positioning grid

### Claim 3 (depends on 1)

Method according to one of claims 1 one or 2, wherein only one regular positioning grid is provided for both opening as well as closing binary identifiers (BIDs) and wherein opening and closing binary identifiers (BIDs) are marked in order to distinguish them when parsing.

### Claim 4 (depends on 1, 2)

Method according to one of claims 1 or 2, wherein different positioning grids are provided for the opening and closing binary identifiers (BIDs) and wherein these different positioning grids are structured in a way such that the different grids do not interfere with each other.

### Claim 5 (depends on 3)

Method according to claim 3, wherein the first binary identifier (BID) starts at bit number M (M>0) in the bitstream and the following binary identifiers (BIDs) at each following Nth bit (N>1).

### Claim 6 (depends on 4)

Method according to claim 4, wherein the first opening binary identifier (BID) starts at a bit number M in the bitstream and the following opening binary identifiers at each following Nth bit (N>1) and wherein the first closing binary identifier (BID) starts at bit number K (K>M) and the following closing binary identifiers at each following Lth bit (L>1).

### Claim 7 (depends on 6)

Method according to claim 6, wherein the parameters M, K, N and L are chosen such that the grids do not interfere with each other.

### Claim 8 (depends on 5, 6)

Method according to one of claims 5, 6, or 7, wherein the parameters M and N or M, N, K and L respectively are predetermined fixed parameters.

### Claim 9 (depends on 5, 6, 7)

Method according to claims 5, 6 or 7, wherein the parameters M and N or M, N, K and L respectively are adaptively selectable and transmitted at the very beginning of the bitstream, in particular in its header (1).

### Claim 10 (depends on 1, 2, 3, 4, 5, 6, 7, 8, 9)

Method according to one of claims 1 to 9, wherein a unique number is assigned to each opening binary identifier (BID) of the same type, i. e. corresponding to the same descriptor (D) or description scheme (DS), and the same unique number is assigned to the corresponding closing binary identifier (BID).

### Claim 11 (depends on 10)

Method according to claim 10, wherein the unique numbers are added to the opening and closing binary identifiers (BIDS) as fixed or variable length codes, and written into the bitstream.

### Claim 12 (depends on 10, 11)

Method according to one of claims 10 or 11, wherein a parser, who wants to skip a complete sub-description, just has to search for corresponding unique numbers for opening and closing binary identifiers (BIDs) in the bitstream.
