METHOD AND A SYSTEM FOR PACKET RECONSTRUCTION

• US 20160365948A1
• Filed: 06/09/2016
• Published: 12/15/2016
• Est. Priority Date: 06/12/2015
• Status: Abandoned Application

• Current Assignee: Hitachi, Ltd.
• Original Assignee: Hitachi, Ltd.
• Inventors: KALLE, Ritesh Kumar
• Application Number:
  US15/177,746
• Publication Number:
  US 20160365948A1
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 11/1004 to protect a block of data words, e.g. CRC or checksum G06F11/1076 takes precedence; security arrangements for protecting computers or computer systems against unauthorized activity G06F21/00
• CPC Class Codes: H04B 1/38 Transceivers, i.e. devices in which transmitter and receiver form a structural unit and in which at least one part is used for functions of transmitting and receiving
• CPC Class Codes: H04L 1/0045 Arrangements at the receiver end
• CPC Class Codes: H04L 1/0061 Error detection codes
• CPC Class Codes: H04L 1/08 by repeating transmission, e.g. Verdan system H04L1/1858 and H04L1/189 take precedence
• CPC Class Codes: H04L 69/324 in the data link layer [OSI layer 2], e.g. HDLC

Abstract

Embodiments of the present disclosure provide a system and a method for reconstruction of plurality of copies of data packets. The method comprising, receiving plurality of copies of data packets. The method further comprises generating a candidate packet from the plurality of copies of the data packets. Further, the method comprising, selecting at least two probable packets from the plurality of copies of data packets. For bye, the method comprises, receiving confidence factor of the at least two probable packets. Furthermore, the method comprising, determining the one or more common bits to be one of recovered bits and different bits, substituting each of the unrecovered bits of the candidate packet with one of the corresponding recovered bits and different bits of the probable packets. Lastly the method comprises, determining the unrecovered bits of the candidate packet using the packet Cyclic Redundancy Check (CRC) for reconstruction of the data packets.

Claims

1. A method for reconstruction of data packets received by a networking protocol, the method comprising:

receiving, by a packet processor of a transceiver system, plurality of copies of data packets;

generating, by the packet processor, a candidate packet from the plurality of copies of the data packets using bitwise majority voting, wherein every bit of the candidate packet is categorized as one of recovered bit and unrecovered bit;

selecting, by the packet processor, at least two probable packets from the plurality of copies of data packets based on hamming distance and energy levels between the plurality of copies of data packets;

identifying, by the packet processor, status of one or more unrecovered bits of the at least two probable packets as one of common bits and different bits;

receiving, by the packet processor, confidence factor of the at least two probable packets;

determining, by the packet processor, the one or more common bits to be one of recovered bits and different bits, based on the confidence factor of the at least two probable packets;

substituting, by the packet processor, each of the unrecovered bits of the candidate packet with one of the corresponding recovered bits and different bits of the probable packets; and

determining, by the packet processor, the unrecovered bits of the candidate packet using the packet Cyclic Redundancy Check (CRC) for reconstruction of the data packets.

2. The method as claimed in claim 1, wherein the bit wise majority voting comprises estimating number of zeros and ones across each of the plurality of copies of data packets.

3. The method as claimed in claim 1, wherein decoding confidence comprises binary values for every bit of the plurality of copies of data packets based on the Hamming distance.

4. A packet processor of a transceiver system for reconstruction of data packets received by a networking protocol, the packet processor is configured to:

receive plurality of copies of data packets;

generate a candidate packet from the plurality of copies of the data packets using bitwise majority voting, wherein every bit of the candidate packet is categorized as one of recovered bit and unrecovered bit;

select at least two probable packets from the plurality of copies of data packets based on hamming distance and energy levels between the plurality of copies of data packets;

identify status of one or more unrecovered bits of the at least two probable packets as one of common bits and different bits;

receive confidence factor of the at least two probable packets;

determine the one or more common bits to be one of recovered bits and different bits, based on the confidence factor of the at least two probable packets;

substitute each of the unrecovered bits of the candidate packet with one of the corresponding recovered bits and different bits of the probable packets; and

determine the unrecovered bits of the candidate packet using the packet Cyclic Redundancy Check (CRC) for reconstruction of the data packets.

5. The packet processor as claimed in claim 5, wherein the packet processor is configured in the link layer of the transceiver system.

6. The packet processor as claimed in claim 5, wherein bit wise majority voting performed by the packet processor comprises, estimating number of zeros and ones across each of the at least four copies of data packets.

7. The packet processor as claimed in claim 5, wherein the packet processor receives the confidence factor comprising binary values for every bit of the plurality of copies of data packets based on at least one of, bit energy level of the plurality of copies data packets, distance between reference energy level of the plurality of copies of data packets and received energy level between plurality of copies of data packets.