# US 2012/0250700 A1 · Method, apparatus, and system for data transmission

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

- Number: US 2012/0250700 A1
- Document ID: US20120250700A1
- Status: Published application
- Kind: A1
- Application number: 13/432,861
- Filed: 2012-03-28
- Published: 2012-10-04
- Earliest claimed: 2011-03-28
- Assignees: Huawei Technologies Co., Ltd.
- Inventors: Bo Wu; Rong Deng; Zhen Long
- Web page: https://patentgrep.com/patent/US20120250700A1

## CPC

- H04L 7/10: Arrangements for initial synchronisation
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

The present invention provides a method for locating a data frame. The method mainly includes: allocating a framing state machine to each byte of a data stream within a current clock cycle; respectively starting, by the framing state machines, hunting for data frames from respective corresponding bytes, and obtaining a plurality of data frame hunt results; and selecting one hunt result from the plurality of data frame hunt results according to a data frame hunt result within a previous clock cycle as a data frame hunt result within the current clock cycle.

## Claims

### Claim 1

A method for locating a data frame, comprising:
obtaining a data stream within a current clock cycle and allocating a framing state machine to each byte of the date stream within the current clock cycle;
respectively starting, by the framing state machines, hunting for data frames from respective corresponding bytes, and obtaining a plurality of data frame hunt results, wherein the hunt result comprises a starting byte of a first data frame hunted out by each framing state machine;
determining a starting byte of a first data frame within the current clock cycle according to a data frame hunt result within a previous clock cycle; and
matching the plurality of data frame hunt results respectively with the starting byte of the first data frame within the current clock cycle and using a successfully-matched hunt result as a data frame hunt result within the current clock cycle.

### Claim 2 (depends on 1)

The method for locating a data frame according to claim 1, wherein the respectively starting, by the framing state machines, hunting for the data frames from the respective corresponding bytes comprises:
after receiving each byte of a data stream within a clock cycle, first performing a hybrid error control HEC calculation on values of every two adjacent bytes of the data stream and storing obtained HEC calculation results of the values of every two adjacent bytes;
selecting, by each framing state machine, four consecutive adjacent bytes starting from a first byte of starting a hunt, comparing HEC calculation results of values of first two adjacent bytes in the four consecutive adjacent bytes with values of last two adjacent bytes, and in case of equivalence, determining that a first byte in the first two adjacent bytes is the starting byte of the first data frame;
determining a length of the first data frame according to the values of the first two adjacent bytes, then determining a starting byte of a second data frame according to the length of the first data frame and the starting byte of the first data frame, comparing HEC calculation results of values of first two adjacent bytes with values of last two adjacent bytes starting from the starting byte of the second data frame, and in case of equivalence, determining that positions of the first data frame and the second data frame are correct, and recording the starting bytes and length information of the first data frame and the second data frame in the hunt result; and
continuing the data frame hunting process starting from the starting byte of the second data frame until a set hunt period corresponding to the current clock cycle ends.

### Claim 3 (depends on 1)

The method for locating a data frame according to claim 1, wherein the determining the starting byte of the first data frame within the current clock cycle according to the data frame hunt result within the previous clock cycle comprises:
obtaining a value of a payload length indicator field of a header of a last data frame within the previous clock cycle and a starting byte of the last data frame according to the data frame hunt result within the previous clock cycle and determining a length of the last data frame within the previous clock cycle according to the value of the payload length indicator field; and
determining the starting byte of the first data frame within the current clock cycle according to the length and the starting byte of the last data frame within the previous clock cycle.

### Claim 4 (depends on 1)

The method for locating a data frame according to claim 1, wherein the matching the plurality of data frame hunt results respectively with the starting byte of the first data frame within the current clock cycle and using the successfully-matched hunt result as the data frame hunt result within the current clock cycle comprises:
when the starting byte of the first data frame in the hunt result is the same as the starting byte of the first data frame within the current clock cycle, and the hunt result is obtained by starting the hunt from the starting byte of the first data frame, determining that the hunt result is the data frame hunt result within the current clock cycle; and
transmitting the data frame hunt result within the current clock cycle and a state of the framing state machine when the hunt ends to a next clock cycle.

### Claim 5

An apparatus for locating a data frame, comprising:
a hunt processing module, configured to obtain a data stream within a current clock cycle and allocate a framing state machine to each byte of the data stream within the current clock cycle, wherein the framing state machines respectively start hunting for data frames from respective corresponding bytes and obtain a plurality of data frame hunt results, and the hunt result comprises a starting byte of a first data frame hunted out by each framing state machine; and
a hunt result determining module, configured to determine a starting byte of a first data frame within the current clock cycle according to a data frame hunt result within a previous clock cycle, match the plurality of data frame hunt results obtained by the hunt processing module respectively with the starting byte of the first data frame within the current clock cycle, and use a successfully-matched hunt result as a data frame hunt result within the current clock cycle.

### Claim 6 (depends on 5)

The apparatus for locating a data frame according to claim 5, wherein the hunt processing module comprises:
a preprocessing module, configured to, after receiving each byte of a data stream within a clock cycle, first perform a hybrid error control HEC calculation on values of every two adjacent bytes of the data stream and store obtained HEC calculation results of the values of every two adjacent bytes; and
an HEC authentication module, configured to enable each framing state machine to select four consecutive adjacent bytes starting from a first byte of starting a hunt, compare HEC calculation results of values of first two adjacent bytes in the four consecutive adjacent bytes with values of last two adjacent bytes, and in case of equivalence, determine that a first byte in the first two adjacent bytes is the starting byte of the first data frame;
determine a length of the first data frame according to the values of the first two adjacent bytes, then determine a starting byte of a second data frame according to the length of the first data frame and the starting byte of the first data frame, comparing HEC calculation results of values of first two adjacent bytes with values of last two adjacent bytes starting from the starting byte of the second data frame, and in case of equivalence, determine that positions of the first data frame and the second data frame are correct, and record the starting bytes and length information of the first data frame and the second data frame in the hunt result; and
continue the data frame hunting process starting from the starting byte of the second data frame until a set hunt period corresponding to the current clock cycle ends.

### Claim 7 (depends on 5)

The apparatus for locating a data frame according to claim 5, wherein the hunt result determining module comprises:
a previous hunt result processing module, configured to obtain a value of a payload length indicator field of a header of a last data frame within the previous clock cycle and a starting byte of the last data frame according to the data frame hunt result within the previous clock cycle, and determine a length of the last data frame within the previous clock cycle according to the value of the payload length indicator field; and
determine the starting byte of the first data frame within the current clock cycle according to the length and the starting byte of the last data frame within the previous clock cycle; and
a match processing module, configured to, when the starting byte of the first data frame in the hunt result obtained by the hunt processing module is the same as the starting byte of the first data frame within the current clock cycle obtained by the previous hunt result processing module, and the hunt result is obtained by starting the hunt from the starting byte of the first data frame, determine that the hunt result is the data frame hunt result within the current clock cycle.

### Claim 8 (depends on 7)

The apparatus for locating a data frame according to claim 7, wherein the hunt result determining module further comprises:
a hunt result transmitting module, configured to deliver the data frame hunt result within the current clock cycle and a state of the framing state machine when the hunt ends to a next clock cycle.
