Communications systems, methods and devices

Patent metadata

Field	Value
Publication number	US-10892886-B2
Application number	US-201816054406-A
Country	US
Kind code	B2
Filing date	Aug 3, 2018
Priority date	Aug 3, 2018
Publication date	Jan 12, 2021
Grant date	Jan 12, 2021

Abstract

Systems and methods including a transmitter resource to transmit a message having one or more packets, each packet having a boundary identifier including a first placeholder generated based on or in response to data in a fixed-sized window of the message, and a second placeholder generated based on or in response to all data in a respective packet, and a receiver resource to receive the message and to detect the boundary identifiers of the respective packets.

First claim

The invention claimed is:

1. A method of confirming a packet boundary in a message at a receiver resource, the method comprising:
receiving, at a receiver, the message comprising one or more packets, each packet comprising a boundary identifier having a first placeholder calculated by transforming data in a fixed-sized rolling window of the message and a second placeholder calculated by transforming all data in the respective packet including the first placeholder;
detecting, at the receiver, a boundary identifier for a first packet; and
confirming the packet boundary for a first packet in the message based on or in response to detecting the boundary identifier for the first packet.

2. The method of claim 1 , wherein detecting the packet boundary identifier comprises:
generating, at the receiver, one or more first check-values based on or in response to data in a fixed-sized window of the received message; and
determining whether a check-value of the one or more first check-values matches a first placeholder of the first packet.

3. The method of claim 2 , further comprising:
generating, at the receiver, one or more second check-values based on or in response to data within a defined length of the received message; and
determining whether a check-value of the one more second check-values matches a second placeholder of the first packet.

4. The method of claim 3 , further comprising:
confirming the packet boundary for the first packet when the check-value of the one or more first check-values matches the first placeholder for the first packet and the check-value of the one more second check-values matches the second placeholder for the first packet.

5. The method of claim 1 , comprising:
confirming true packet boundaries for a plurality of packets of the message based on or in response to detecting boundary identifiers for respective packets of the plurality of packets.

6. The method of claim 1 , comprising:
confirming false packet boundaries for a plurality of packets of the message based on or in response to detecting false boundary identifiers for respective packets of the plurality of packets.

7. The method of claim 1 , comprising:
identifying a possible packet boundary for a packet of the message based on or in response to detecting a possible long placeholder.

8. The method of claim 7 , further comprising:
generating a data structure representative of one or more of: the confirmed packet boundaries and possible packet boundaries for the plurality of packets.

9. The method of claim 8 , further comprising:
processing the data structure to identify individual packets in the message.

10. The method of claim 8 , wherein the data structure comprises a confirmation chain having one or more nodes representative of one or more of: the confirmed packet boundaries and possible packet boundaries.

11. The method of claim 9 , wherein the confirmation chain comprises one of:
a singly-linked list and a graph.

12. The method of claim 2 , wherein generating the one or more first check-values comprises transforming the data in the fixed-sized window with a first transformation function.

13. The method of claim 3 , wherein generating the one or more second check-values comprises transforming the data within the defined length of the received message with a transformation function.

14. A method for transmitting a message from a transmitter resource, the method comprising:
generating, at the transmitter, a plurality of packets of data, each packet comprising:
a first placeholder calculated by transforming data in a fixed-sized rolling window of the message, and
a second placeholder calculated by transforming all data in the respective packet including the first placeholder; and

transmitting the message comprising the one or more packets to a receiver.

15. The method of claim 14 , wherein one or more packets of the plurality of packets comprise a data payload.

16. The method of claim 15 , wherein the data payload is an empty data payload.

17. The method of claim 16 , comprising stuffing a portion of the message with one or more packets having an empty data payload.

18. The method of claim 17 , wherein the total length of the portion of the message stuffed with one or more packets having an empty data payload is greater than or equal to the fixed-sized window of the message.

19. A system comprising:
a transmitter resource to transmit a message having one or more packets, each packet having a boundary identifier comprising:
a first placeholder calculated by transforming data in a fixed-sized rolling window of the message, and
a second placeholder calculated by transforming all data in a respective packet including the first placeholder; and

a receiver resource to receive the message and to detect the boundary identifiers of the respective packets.

20. The system of claim 19 , wherein the receiver is to confirm the packet boundaries for the respective packets based on or in response to boundary identifiers.

Assignees

• Advanced Risc Mach Ltd

Inventors

• Savelyev Roman
• Kayo Sila

Classifications

• H04L47/22

  Traffic shaping · CPC title

• H04L2007/045

  Fill bit or bits, idle words · CPC title

• H04L5/0048

  Allocation of pilot signals, i.e. of signals known to the receiver (allocation of control signalling H04L5/0053; use of control signalling H04L5/0091) · CPC title

• H04L7/041 Primary

  using special codes as synchronising signal · CPC title

• H04L7/048 Primary

  using the properties of error detecting or error correcting codes, e.g. parity as synchronisation signal · CPC title