US20100153817A1 - Data correction apparatus, data correction method and tangible machine-readable medium thereof - Google Patents
Data correction apparatus, data correction method and tangible machine-readable medium thereof Download PDFInfo
- Publication number
- US20100153817A1 US20100153817A1 US12/486,305 US48630509A US2010153817A1 US 20100153817 A1 US20100153817 A1 US 20100153817A1 US 48630509 A US48630509 A US 48630509A US 2010153817 A1 US2010153817 A1 US 2010153817A1
- Authority
- US
- United States
- Prior art keywords
- packet
- crc
- remainder
- error pattern
- code
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/37—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
- H03M13/45—Soft decoding, i.e. using symbol reliability information
- H03M13/451—Soft decoding, i.e. using symbol reliability information using a set of candidate code words, e.g. ordered statistics decoding [OSD]
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/63—Joint error correction and other techniques
- H03M13/6306—Error control coding in combination with Automatic Repeat reQuest [ARQ] and diversity transmission, e.g. coding schemes for the multiple transmission of the same information or the transmission of incremental redundancy
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0056—Systems characterized by the type of code used
- H04L1/0061—Error detection codes
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
- H04L1/1829—Arrangements specially adapted for the receiver end
- H04L1/1835—Buffer management
- H04L1/1845—Combining techniques, e.g. code combining
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
- H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
- H03M13/09—Error detection only, e.g. using cyclic redundancy check [CRC] codes or single parity bit
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
- Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10S707/00—Data processing: database and file management or data structures
- Y10S707/99931—Database or file accessing
- Y10S707/99933—Query processing, i.e. searching
- Y10S707/99936—Pattern matching access
Definitions
- the present invention relates to a data correction apparatus, a data correction method and a tangible machine-readable medium thereof. More particularly, the present invention relates to a data correction apparatus, a data correction method and a tangible machine-readable medium thereof that use cyclic redundancy check (CRC) information to calculate a correct packet.
- CRC cyclic redundancy check
- networks have become indispensable in the daily life of modern people. Users can upload or download a wide variety of information via networks, and such information is transmitted via the networks in form of data packets.
- errors or even corruptions usually occur in the data packets when being received at the receiving end, thereby causing degradation in the performance of the network communications.
- CRC cyclic redundancy check
- MAC media access control
- the receiving end may further employ a retransmission mechanism, e.g., the automatic repeat request (ARQ) or hybrid automatic repeat request (HARQ) framework, to request the transmitting end to retransmit the previously transmitted data packet with the CRC code.
- a retransmission mechanism e.g., the automatic repeat request (ARQ) or hybrid automatic repeat request (HARQ) framework
- ARQ automatic repeat request
- HARQ hybrid automatic repeat request
- the receiving end can filter out erroneous data packets and acquire the correct data packet through retransmissions, thereby decreasing the error rate of data transmissions in network communications.
- the data transmitting end has to retransmit the data packet many times to ensure that the correct data packet has been received without error at the receiving end. This is effective in decreasing the error rate of data transmissions, but wastes network bandwidth resources. Accordingly, decreasing both the error rate of data transmissions and usage of network bandwidth resources at the same time in the network communications is still a problem.
- One objective of the present invention is to provide a data correction apparatus, which comprises a reception module, a determination module, a pattern generating module and a calculation module.
- the reception module is configured to receive a first packet, a second packet and a third packet.
- the first packet comprises a plurality of first data bits and CRC information
- the second packet comprises a plurality of second data bits and the CRC information
- the third packet comprises a plurality of third data bits and the CRC information.
- the determination module is configured to determine whether the first packet, the second packet and the third packet are erroneous packets according to the CRC information.
- the pattern generating module retrieves any number of pairs among each of the first data bits, each of the second data bits and each of the third data bits to perform an XOR logical operation thereon to generate a plurality of error patterns. Then, the pattern generating module further performs an OR logical operation on the plurality of error patterns to generate an overall error pattern. Finally, the calculation module is configured to calculate a correct packet according to the overall error pattern and either the first packet, the second packet or the third packet.
- Another objective of the present invention is to provide a data correction method, which comprises the following steps: receiving a first packet, wherein the first packet comprises a plurality of first data bits and CRC information; determining that the first packet is an erroneous packet according to the CRC information; receiving a second packet, wherein the second packet comprises a plurality of second data bits and the CRC information; determining that the second packet is an erroneous packet according to the CRC information; receiving a third packet, wherein the third packet comprises a plurality of third data bits and the CRC information; determining that the third packet is an erroneous packet according to the CRC information; retrieving any number of pairs among each of the first data bits, each of the second data bits and each of the third data bits to perform an XOR logical operation thereon to generate the same number of error patterns as the erroneous packets; performing an OR logical operation on the error patterns to generate an overall error pattern; and calculating a correct packet according to the overall error pattern and either the first packet, second
- This invention also provides a tangible machine-readable medium storing a computer program product for the data correction apparatus to perform the data correction method.
- the data correction apparatus, the data correction method and the tangible machine-readable medium thereof of the present invention further retrieves information of each bit in the packets that are determined to be erroneous to correct and calculate a correct packet.
- the present invention remarkably reduces the retransmissions of packets and consequently the usage of network bandwidth resources, thereby rendering the use of the network bandwidth resources more efficient.
- FIG. 1 is a schematic view of a first embodiment of the present invention
- FIG. 2 is a flowchart of a second embodiment of the present invention.
- FIG. 3 is a schematic view of a third embodiment of the present invention.
- FIG. 4 is a flowchart of a fourth embodiment of the present invention.
- FIG. 1 depicts a first embodiment of the present invention, which is a data correction apparatus 1 .
- the data correction apparatus 1 may be deployed at a receiving end of a wired or wireless communication system (not shown) with ARQ/HARQ or spatial multiplexing scheme.
- the data correction apparatus 1 comprises a reception module 11 , a determination module 12 , a calculation module 13 , a pattern generating module 14 and a transmission module 15 .
- the calculation module 13 comprises a packet generating unit 13 a.
- the determination module 12 further comprises a remainder calculation unit 12 a and a remainder determination unit 12 b.
- the transmitting end When a transmitting end of the wired/wireless communication system transmits the data packet to the data correction apparatus 1 at the receiving end, the transmitting end first generates a correct packet with a CRC code according to the conventional CRC mechanism. For example, if a bit string of the data packet to be transmitted is [1000], then through the CRC mechanism, the transmitting end can perform a calculation according to a generation polynomial (a bit string of which is [101]) to learn that a bit string of the correct packet with both the data packet and the CRC information is [100,011].
- the correct packet [100,011] comprises a plurality of data bits and the CRC information. Then, the transmitting end transmits the correct packet [100,011] to the data correction apparatus 1 at the receiving end.
- the remainder generating unit 12 a of the determination module 12 comprises one or more CRC circuits (not shown), and the remainder determination unit 12 b comprises one or more determination circuits (not shown). It should be appreciated that, in terms of structures and operations, both the remainder generating unit 12 a and the remainder determination unit 12 b of the determination module 12 are just the same as the conventional standard hardware circuits that implement the CRC mechanism.
- the present invention has no limitation on the number of CRC circuits included in the generating unit 12 a; similarly, the present invention has no limitation on the number of determination circuits included in the determination unit 12 b. Rather, those of ordinary skill in the art may arrange an appropriate number of such circuits depending on the practical needs, and thus, this will not be further described herein.
- Very poor channel conditions and interference from other communication signals may cause an erroneous packet to be received at the receiving end.
- the reception module 11 transmits the first packet 101 p ([100,111]) to the remainder generating unit 12 a of the determination module 12 .
- the remainder generating unit 12 a then calculates a first CRC remainder 101 r according to the aforesaid generation polynomial [101] and the first packet 101 p [100,111].
- the remainder generating unit 12 a performs a binary division operation to obtain a result of the first CRC remainder 101 r (a bit string of which is [100]).
- the remainder generating unit 12 a transmits the first CRC remainder 101 r [100] to the remainder determination unit 12 b, which then determines whether the first CRC remainder 101 r [100] is equal to zero. Because the first CRC remainder 101 r [100] calculated previously is not equal to zero, the determination module 12 determines that the first packet 101 p [100,111] is an erroneous packet, and the transmission module 15 transmits a reception failure message 161 to the transmitting end to request retransmission of the correct packet [100, 011]. Meanwhile, the remainder generating unit 12 a transmits the first packet 101 p [100,111] to the pattern generating module 14 to be stored therein.
- the reception module 11 receives a second packet 102 p (a bit string of which is [100,001]), which comprises a plurality of second data bits and the CRC information.
- the determination module 12 calculates and determines whether the second packet 102 p [100,001] is an erroneous packet according to the CRC information.
- the second packet 102 p [100,001] is transmitted to the remainder generating unit 12 a where a calculation is made according to the generation polynomial [101] to obtain a second CRC remainder 102 r (a bit string of which is [11]).
- the remainder generating unit 12 a transmits the second CRC remainder 102 r [11] to the remainder determination unit 12 b, which determines whether the second CRC remainder 102 r [11] is equal to zero. Because the second CRC remainder 102 r [11] is not equal to zero, the second packet 102 p [100,001] is also determined to be an erroneous packet. Then, the transmission module 15 transmits another reception failure message 162 to the transmitting end to request retransmission of the correct packet [100, 011]. Meanwhile, the remainder generating unit 12 a transmits the second packet 102 p [100,001] to the pattern generating module 14 to be stored therein.
- the pattern generating module 14 retrieves each of the first data bits of the first packet 101 p [100,111] and each of the second data bits of the second packet 102 p [100,001] to perform an XOR logical operation thereon to obtain a first error pattern 131 (a bit string of which is [000,110]).
- bits with a value of [1] represent bits where the first packet 101 p [100,111] is different from the second packet 102 p [100,001].
- bits with a value of [1] represent bits where an error arises in the first packet 101 p [100,111] and the second packet 102 p [100,001].
- the transmission module 15 transmits the reception failure message 162 to the transmitting end to request retransmission of the correct packet [100,011], the transmitting end retransmits the correct packet after receiving the reception failure message 162 .
- the reception module 11 receives a third packet 103 p (a bit string of which is [100,100]), which comprises a plurality of third data bits and the CRC information. Similar to what was described in connection with the first packet 101 p [100, 111] and the second packet 102 p [100,001], the determination module 12 determines whether the third packet 103 p [100,100] is an erroneous packet according to the CRC information.
- the third packet 103 p [100,100] is transmitted to the remainder generating unit 12 a where calculation is made according to the generation polynomial [101] to obtain a third CRC remainder 103 r (a bit string of which is [01]).
- the remainder generating unit 12 a transmits the third CRC remainder 103 r [01] to the remainder determination unit 12 b, which determines whether the third CRC remainder 103 r [01] is equal to zero. Because the third CRC remainder 103 r [01] is still not equal to zero, the third packet 103 p [100,100] is also determined to be an erroneous packet. Meanwhile, the remainder generating unit 12 a transmits the third packet 103 p [100,100] to the pattern generating module 14 to be stored therein.
- the present invention is not limited to use of the CRC error detection approach to determine whether the first packet 101 p, the second packet 102 p or the third packet 103 p is an erroneous packet. Rather, depending on the practical needs, those of ordinary skill in the art may choose other error detection approaches to determine whether the first packet 101 p, the second packet 102 p or the third packet 103 p is an erroneous packet and, therefore, this will not be further described herein.
- the pattern generating module 14 retrieves each data bit of two of the packets to perform a further XOR logical operation thereon to obtain a second error pattern.
- the pattern generating module 14 retrieves each of the first data bits of the first packet 101 p [100,111] and each of the third data bits of the third packet 103 p [100,100] to perform an XOR logical operation thereon to obtain a second error pattern 132 (a bit string of which is [000, 011]).
- bits with a value of [1] represent bits where the first packet 101 p [100,111] is different from the third packet 103 p [100,100].
- bits with a value of [1] represent bits where an error arises in the first packet 101 p [100,111] and the third packet 103 p [ 100,100].
- the pattern generating module 14 calculates all erroneous bits in the first packet 101 p [100,111], the second packet 102 p [100,001] and the third packet 103 p [100,100] to generate a third error pattern 133 (a bit string of which is [000,111]).
- the packet generating unit 13 a generates a plurality of target packets according to the third error pattern 133 [000,111] and either the first packet 101 p [ 100 , 111 ], the second packet 102 p [ 100 , 001 ] or the third packet 103 p [100,100].
- the packet generating unit 13 a generates eight target packets according to the first packet 101 p [100,111] and the third error pattern 133 [000,111], namely, 151 p [100,000], 152 p [ 100,001], 153 p [100,010], 154 p [ 100,011], 155 p [ 100,100], 156 p [ 100,101], 157 p [100,110] and 158 p [100,111].
- the remainder generating unit 12 a receives these target packets 151 p, 152 p, . . . , 158 p and, according to the generation polynomial [101], calculates target CRC remainders 151 r [10], 152 r [11], 153 r [100], 154 r [0], 155 r [01], 156 r [10], 157 r [11] and 158 r [100] corresponding to the target packets 151 p, 152 p, . . . , 158 p respectively. Then, the remainder determination unit 12 b receives the target CRC remainders 151 r, 152 r, . . . , 158 r and sequentially determines whether each of them is equal to zero.
- the remainder determination unit 12 b determines that the target packet 154 p [100,011] corresponding to the target CRC remainder 154 r [0] is the correct packet, thus completing the data correction method of the present invention.
- the transmission module 15 retransmits another reception failure message to the transmitting end to request retransmission of the correct packet [100,011], and operations described above are repeated again.
- the pattern generating module 14 only needs to retrieve (S-1) pairs of erroneous packets and performs an XOR logical operation on the data bits of each pair of erroneous packets to obtain (S-1) error patterns. Then, an OR logical operation is performed on the error patterns to generate an error pattern for calculating the target packets.
- the error pattern can be calculated through (E 1 XOR E 2 ) OR (E 2 XOR E 3 ) OR (E 3 XOR E 4 ) OR (E 4 XOR E 5 ), or through (E 1 XOR E 2 ) OR (E 1 XOR E 3 ) OR (E 1 XOR E 4 ) OR (E 1 XOR E 5 ).
- the packet generating unit 13 a then calculates each of the target packets, according to the error pattern for calculating the target packets, via one or more of the five erroneous packets E 1 , E 2 , E 3 , E 4 and E 5 . Based on the above description, those of ordinary skill in the art may calculate the error patterns and the target packets according to a different number of erroneous packets and calculate the correct packet through an exhaustive algorithm according to the target packets, and therefore, this will not be further described herein.
- FIG. 2 depicts a second embodiment of the present invention, which is a data correction method.
- This data correction method is adapted for a data correction apparatus, e.g., the data correction apparatus 1 described in the first embodiment.
- the data correction apparatus 1 may be deployed at a receiving end of a wired or wireless communication system (not shown) with an ARQ/HARQ or spatial multiplexing scheme.
- the data correction method of the second embodiment may be implemented by a tangible machine-readable medium. When the tangible machine-readable medium is loaded into the data correction apparatus 1 via a computer and a plurality of codes incorporated in the computer program product are executed, the data correction method of the second embodiment can be accomplished.
- This computer program product may be stored in a tangible machine-readable medium, such as a read only memory (ROM), a flash memory, a floppy disk, a hard disk, a compact disk, a mobile disk, a magnetic tape, a database accessible to networks, or any other storage media with the same function and well known to those skilled in the art.
- ROM read only memory
- flash memory a flash memory
- floppy disk a hard disk
- compact disk a mobile disk
- magnetic tape a database accessible to networks, or any other storage media with the same function and well known to those skilled in the art.
- step 201 is executed to receive a plurality of packets, for example, the first packet, the second packet and the third packet described in the first embodiment.
- the first packet comprises a plurality of first data bits and a CRC information;
- the second packet comprises a plurality of second data bits and the CRC information;
- the third packet comprises a plurality of third data bits and the CRC information.
- step 202 is executed to determine whether one of the packets is a correct packet according to the CRC information.
- step 203 is executed to transmit another packet.
- step 204 is executed to determine whether at least two of the packets are retransmitted. If all the packets are independent packets unrelated to each other, step 205 is executed to transmit a reception failure message.
- step 206 is executed to generate a plurality of error patterns according to the packets, e.g., the first error pattern, the second error pattern and the third error pattern described in the first embodiment.
- step 207 is executed to generate a plurality of target packets according to the error patterns and one or more of the packets.
- step 208 is executed to calculate a respective target CRC remainder of each of the target packets, and step 209 is executed to determine whether one of the target CRC remainders is equal to zero.
- step 210 is then executed to set the target packet corresponding to the target CRC remainder to be a correct packet.
- step 203 is executed to transmit another packet. Otherwise, if it is determined in step 208 that none of the target CRC remainders is equal to zero, this data correction method returns to step 205 to transmit a reception failure message anew to request the retransmission of the packet by the transmitting end.
- the second embodiment can also execute the operations and functions set forth with respect to the data correction apparatus 1 of the first embodiment.
- the method in which the second embodiment executes these operations and functions will be readily appreciated by those of ordinary skill in the art based on the explanation of the first embodiment and, thus, will not be further described herein.
- FIG. 3 depicts a third embodiment of the present invention, which is a data correction apparatus 3 .
- the data correction apparatus 3 comprises a reception module 11 , a determination module 12 , a calculation module 33 , a pattern generating module 14 and a transmission module 15 .
- the calculation module 33 comprises a vector processing unit 33 a and a logical processing unit 33 b, and the determination module 12 comprises a remainder generating unit 12 a and a remainder determination unit 12 b.
- This embodiment differs from the first embodiment in the way in which the correct packet is calculated. It should be appreciated that elements bearing the same reference numerals as those of FIG. 1 have already been described in the first embodiment, and thus will not be further described herein.
- the reception module 11 receives the first packet 101 p [100,111], the second packet 102 p [100,001] and the third packet 103 p [100,100] respectively, and the remainder generating unit 12 a calculates a first CRC remainder 101 r [100], a second CRC remainder 102 r [11] and a third CRC remainder 103 r [01] corresponding thereto respectively according to the generation polynomial [101]. Then, the remainder determination unit 12 b determines that the first packet 101 p, the second packet 102 p and the third packet 103 p are all erroneous packets.
- the transmission module 15 transmits reception failure messages 161 , 162 to the transmitting end.
- the pattern generating module 14 calculates a third error pattern 133 [000,111] according to the following operation: (the first packet 101 p XOR the second packet 102 p ) OR (the first packet 101 p XOR the third packet 103 p ).
- An erroneous packet may be considered as a result of performing an operation on the correct packet and an error pattern vector, so the correct packet can be deduced if the error pattern vector is known.
- the first packet 101 p [100,111] may be represented as a result of performing an XOR logical operation on the correct packet [100,011] and the error pattern vector [000,100], so if the error pattern vector [000,100] is obtained, the correct packet can be derived according to the first packet 101 p.
- the third error pattern 133 is calculated according to the first packet 101 p, the second packet 102 p and the third packet 103 p. Therefore, the third error pattern 133 is linearly correlated to the error pattern vector corresponding to the first packet 101 p, the second packet 102 p or the third packet 103 p.
- r represents a vector of the CRC remainders of the erroneous packets (e.g., the first CRC remainder 101 r, the second CRC remainder 102 r or the third CRC remainder 103 r ), (c 1 c 2 . . . c m ) T represents a vector of scalars associated with the error pattern vectors, and h 11 , h 12 , . . . , h 1m represent a vector of remainders associated with the error patterns (e.g., the third error pattern 133 ) and the generation polynomial respectively.
- the third error pattern 133 [000,111] can be represented as a polynomial of X 2 +X+1 which, in turn, can be represented by an inner product of a vector (X 5 X 4 X 3 X 2 X1) and a vector (000111) T .
- a vector (000111) T is used to represent the vector e* of the third error pattern 133 .
- a vector (101) T is used to represent the vector of the generation polynomial [101]
- a vector (100) T is used to represent the first CRC remainder 101 r [100]
- a vector (011) T is used to represent the second CRC remainder 102 r [11]
- a vector (001) T is used to represent the third CRC remainder 103 r [01].
- the vector processing unit 33 a has the vector e* of the third error pattern 133 represented as at least one vector.
- (000111) T (000001) T +(000010) T +(000100) T
- b 1 (000001) T
- b 2 (000010) T
- the error pattern vector e 1 corresponding to the first packet 1001 p can be represented as c 1 b 1 +c 2 b 2 +c 3 b 3 .
- the vector processing unit 33 a derives the remainder vectors h 11 , h 12 , . . . , h 1m thereof respectively.
- [h 11 h 12 . . . h 1m ] is not necessarily a square matrix.
- CRC-32 i.e., the CRC remainder it corresponds to has 32 bits
- the third error pattern 133 has three bits [1]
- [h 11 , h 12 h 13 ] is a 32 ⁇ 3 matrix.
- This embodiment will use the first packet 101 p and the error pattern vector e 1 thereof to calculate the correct packet; however, upon reviewing the description of this embodiment, those of ordinary skill in the art may also use the second packet 102 p and the error pattern vector thereof, or the third packet 103 p and the error pattern vector thereof to calculate the correct packet.
- m 3
- r (100) T (the vector of the first CRC remainder 101 r [100]).
- At least one error pattern is generated according to the remainder vectors h 11 , h 12 , h 13 and the vector r of the first CRC remainder 101 r, and an intersection operation is performed on the error patterns to obtain an error pattern vector e 1 .
- the vector processing unit 33 a then transmits the error pattern vector e 1 to the logical processing unit 33 b.
- the logical processing unit 33 b performs an XOR logical operation on the error pattern vector (000100) T and the vector of the first packet 101 p to obtain a vector (100011) T of the correct packet. In other words, the correct packet is [100,011]. If, subsequent to the intersection operation, the vector processing unit 33 a still fails to solve the (c 1 c 2 c 3 ) T , the transmission module 15 will a new retransmission request.
- this embodiment may further use a deletion approach.
- the deletion approach can delete impossible combinations rapidly.
- the deletion approach only needs to generate a single set of error patterns and then substitute the error patterns thereof into other equations to delete erroneous combinations therefrom. This saves more calculation time as compared to other solutions.
- the number of rows that the deletion approach observes increases, the number of erroneous bit combinations that can be deleted increases exponentially, so it is possible to shorten the time of finding out the correct packet by using the deletion approach in combination with an appropriate data structure (e.g., a tree structure).
- FIG. 4 is a fourth embodiment of the present invention, which is a data correction method.
- This data correction method is adapted for a data correction apparatus, e.g., the data correction apparatus 3 described in the third embodiment.
- the data correction apparatus 3 may be deployed at a receiving end of a wired or wireless communication system (not shown) with an ARQ/HARQ or spatial multiplexing scheme.
- the data correction method of the fourth embodiment may be implemented by a tangible machine-readable medium. When the tangible machine-readable medium is loaded into the data correction apparatus 3 via a computer and a plurality of codes incorporated in the computer program product are executed, the data correction method of the fourth embodiment can be accomplished.
- This computer program product may be stored in a tangible machine-readable medium, such as a read only memory (ROM), a flash memory, a floppy disk, a hard disk, a compact disk, a mobile disk, a magnetic tape, a database accessible to networks, or any other storage media with the same function and well known to those skilled in the art.
- ROM read only memory
- flash memory a flash memory
- floppy disk a hard disk
- compact disk a mobile disk
- magnetic tape a database accessible to networks, or any other storage media with the same function and well known to those skilled in the art.
- step 401 is executed to receive a plurality of packets, for example, the first packet, the second packet and the third packet described in the third embodiment.
- the first packet comprises a plurality of first data bits and a CRC information
- the second packet comprises a plurality of second data bits and the CRC information
- the third packet comprises a plurality of third data bits and the CRC information.
- step 402 is executed to determine whether one of the packets is a correct packet according to the CRC information.
- step 403 is executed to transmit another packet.
- step 404 is executed to determine whether at least two of the packets are retransmitted ones. If all the packets are independent packets unrelated to each other, step 405 is executed to transmit a reception failure message.
- step 406 is executed to generate a plurality of error patterns according to the packets, e.g., the third error pattern as described in the third embodiment.
- step 407 is executed to represent the last generated error pattern (e.g., the third error pattern) as at least one unit vector, e.g., the three unit vectors b 1 , b 2 , b 3 described in the third embodiment.
- step 408 is executed to calculate at least one remainder vector (e.g., the remainder vector h 11 , h 12 , h 13 as described in the third embodiment) by using the unit vectors obtained in step 407 as a dividend respectively and a generation polynomial as a divisor.
- step 409 is executed to determine whether at least one error pattern vector can be obtained according to the remainder vector and one or more of the first CRC remainder, the second CRC remainder and the third CRC remainder.
- step 409 fails to obtain an error pattern vector
- step 405 is executed to transmit a reception failure message.
- step 410 is executed to perform an XOR logical operation on the error pattern vector and the first, the second or the third packet to obtain the correct packet. Afterwards, this data correction method returns to step 403 to transmit another packet.
- the fourth embodiment can also execute the operations and functions set forth with respect to the data correction apparatus 3 of the third embodiment.
- the methods in which the fourth embodiment executes these operations and functions will be readily appreciated by those of ordinary skill in the art based on the explanation of the third embodiment and, thus, will not be further described herein.
- the data correction apparatus, the data correction method and the tangible machine-readable medium thereof of the present invention perform a varied number of XOR logical operations and OR logical operations according to the information of data bits of erroneous packets to generate an error pattern. Then, data correction is performed according to the error pattern and the original packet.
- the present invention is able to reduce retransmissions of packets to increase the utilization factor of the network bandwidth resources while also decreasing the error rate of data transmissions.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- Probability & Statistics with Applications (AREA)
- Theoretical Computer Science (AREA)
- Detection And Prevention Of Errors In Transmission (AREA)
- Error Detection And Correction (AREA)
Abstract
Description
- This application claims the benefit of priority based on Taiwan Patent Application No. 097148793, filed on Dec. 15, 2008, the contents of which are incorporated herein by reference in their entirety.
- Not applicable.
- 1. Field of the Invention
- The present invention relates to a data correction apparatus, a data correction method and a tangible machine-readable medium thereof. More particularly, the present invention relates to a data correction apparatus, a data correction method and a tangible machine-readable medium thereof that use cyclic redundancy check (CRC) information to calculate a correct packet.
- 2. Descriptions of the Related Art
- With the aid of network communications, users are able to exchange information, conduct voice communication or even conduct goods transactions. For this reason, networks have become indispensable in the daily life of modern people. Users can upload or download a wide variety of information via networks, and such information is transmitted via the networks in form of data packets. However, due to the noise in the network data transmission channel or communication interference from other data transmissions underway in the networks, errors or even corruptions usually occur in the data packets when being received at the receiving end, thereby causing degradation in the performance of the network communications.
- To improve this problem, network equipment manufacturers have used the cyclic redundancy check (CRC) mechanism that has been practiced for many years. CRC is a kind of error detection mechanism which has found wide application in media access control (MAC) layers of wired and wireless networks. To use the CRC mechanism, a data transmitting end adds, in the data to be transmitted, a CRC remainder to generate a data packet with a CRC code, and then transmits the resulting data packet with the CRC code. When receiving the data packet with the CRC code, the receiving end checks the packet against the CRC code, and if an error is found in the received data packet, the receiving end will abandon the data packet that is determined to be erroneous.
- In combination with the aforesaid CRC mechanism for error detection, the receiving end may further employ a retransmission mechanism, e.g., the automatic repeat request (ARQ) or hybrid automatic repeat request (HARQ) framework, to request the transmitting end to retransmit the previously transmitted data packet with the CRC code. In this way, the receiving end can filter out erroneous data packets and acquire the correct data packet through retransmissions, thereby decreasing the error rate of data transmissions in network communications.
- Unfortunately, in case the network data transmission channel experiences very poor conditions or suffers from very serious communication interference, the data transmitting end has to retransmit the data packet many times to ensure that the correct data packet has been received without error at the receiving end. This is effective in decreasing the error rate of data transmissions, but wastes network bandwidth resources. Accordingly, decreasing both the error rate of data transmissions and usage of network bandwidth resources at the same time in the network communications is still a problem.
- One objective of the present invention is to provide a data correction apparatus, which comprises a reception module, a determination module, a pattern generating module and a calculation module. The reception module is configured to receive a first packet, a second packet and a third packet. The first packet comprises a plurality of first data bits and CRC information, the second packet comprises a plurality of second data bits and the CRC information, and the third packet comprises a plurality of third data bits and the CRC information. The determination module is configured to determine whether the first packet, the second packet and the third packet are erroneous packets according to the CRC information. When the first packet, the second packet and the third packet are all erroneous packets, the pattern generating module retrieves any number of pairs among each of the first data bits, each of the second data bits and each of the third data bits to perform an XOR logical operation thereon to generate a plurality of error patterns. Then, the pattern generating module further performs an OR logical operation on the plurality of error patterns to generate an overall error pattern. Finally, the calculation module is configured to calculate a correct packet according to the overall error pattern and either the first packet, the second packet or the third packet.
- Another objective of the present invention is to provide a data correction method, which comprises the following steps: receiving a first packet, wherein the first packet comprises a plurality of first data bits and CRC information; determining that the first packet is an erroneous packet according to the CRC information; receiving a second packet, wherein the second packet comprises a plurality of second data bits and the CRC information; determining that the second packet is an erroneous packet according to the CRC information; receiving a third packet, wherein the third packet comprises a plurality of third data bits and the CRC information; determining that the third packet is an erroneous packet according to the CRC information; retrieving any number of pairs among each of the first data bits, each of the second data bits and each of the third data bits to perform an XOR logical operation thereon to generate the same number of error patterns as the erroneous packets; performing an OR logical operation on the error patterns to generate an overall error pattern; and calculating a correct packet according to the overall error pattern and either the first packet, second packet or the third packet.
- This invention also provides a tangible machine-readable medium storing a computer program product for the data correction apparatus to perform the data correction method.
- According to the above description, the data correction apparatus, the data correction method and the tangible machine-readable medium thereof of the present invention further retrieves information of each bit in the packets that are determined to be erroneous to correct and calculate a correct packet. In this way, the present invention remarkably reduces the retransmissions of packets and consequently the usage of network bandwidth resources, thereby rendering the use of the network bandwidth resources more efficient.
- The detailed technology and preferred embodiments implemented for the subject invention are described in the following paragraphs accompanying the appended drawings for people skilled in this field to well appreciate the features of the claimed invention.
-
FIG. 1 is a schematic view of a first embodiment of the present invention; -
FIG. 2 is a flowchart of a second embodiment of the present invention; -
FIG. 3 is a schematic view of a third embodiment of the present invention; and -
FIG. 4 is a flowchart of a fourth embodiment of the present invention. - In the following description, the present invention will be explained with reference to embodiments thereof. However, these embodiments are described only for purposes of illustration but not limitation. It should be appreciated that in the following embodiments and attached drawings, elements unrelated to the present invention are omitted from depiction; and the dimensional relationships among the individual elements depicted in the attached drawings are only for ease of understanding but not to limit the actual scales.
-
FIG. 1 depicts a first embodiment of the present invention, which is adata correction apparatus 1. Thedata correction apparatus 1 may be deployed at a receiving end of a wired or wireless communication system (not shown) with ARQ/HARQ or spatial multiplexing scheme. Thedata correction apparatus 1 comprises areception module 11, adetermination module 12, acalculation module 13, apattern generating module 14 and atransmission module 15. Thecalculation module 13 comprises apacket generating unit 13 a. Thedetermination module 12 further comprises aremainder calculation unit 12 a and aremainder determination unit 12 b. - When a transmitting end of the wired/wireless communication system transmits the data packet to the
data correction apparatus 1 at the receiving end, the transmitting end first generates a correct packet with a CRC code according to the conventional CRC mechanism. For example, if a bit string of the data packet to be transmitted is [1000], then through the CRC mechanism, the transmitting end can perform a calculation according to a generation polynomial (a bit string of which is [101]) to learn that a bit string of the correct packet with both the data packet and the CRC information is [100,011]. The correct packet [100,011] comprises a plurality of data bits and the CRC information. Then, the transmitting end transmits the correct packet [100,011] to thedata correction apparatus 1 at the receiving end. - The
remainder generating unit 12 a of thedetermination module 12 comprises one or more CRC circuits (not shown), and theremainder determination unit 12 b comprises one or more determination circuits (not shown). It should be appreciated that, in terms of structures and operations, both theremainder generating unit 12 a and theremainder determination unit 12 b of thedetermination module 12 are just the same as the conventional standard hardware circuits that implement the CRC mechanism. The present invention has no limitation on the number of CRC circuits included in the generatingunit 12 a; similarly, the present invention has no limitation on the number of determination circuits included in thedetermination unit 12 b. Rather, those of ordinary skill in the art may arrange an appropriate number of such circuits depending on the practical needs, and thus, this will not be further described herein. - Very poor channel conditions and interference from other communication signals may cause an erroneous packet to be received at the receiving end. In particular, when receiving a
first packet 101 p (a bit string of which is [100,111]), thereception module 11 transmits thefirst packet 101 p ([100,111]) to theremainder generating unit 12 a of thedetermination module 12. Theremainder generating unit 12 a then calculates afirst CRC remainder 101 r according to the aforesaid generation polynomial [101] and thefirst packet 101 p [100,111]. More specifically, by using thefirst packet 101 p [100,111] as a dividend and the generation polynomial [101] as a divisor, theremainder generating unit 12 a performs a binary division operation to obtain a result of thefirst CRC remainder 101 r (a bit string of which is [100]). - Thereafter, the
remainder generating unit 12 a transmits thefirst CRC remainder 101 r [100] to theremainder determination unit 12 b, which then determines whether thefirst CRC remainder 101 r [100] is equal to zero. Because thefirst CRC remainder 101 r [100] calculated previously is not equal to zero, thedetermination module 12 determines that thefirst packet 101 p [100,111] is an erroneous packet, and thetransmission module 15 transmits a reception failure message 161 to the transmitting end to request retransmission of the correct packet [100, 011]. Meanwhile, theremainder generating unit 12 a transmits thefirst packet 101 p [100,111] to thepattern generating module 14 to be stored therein. - After the transmitting end retransmits the aforesaid correct packet [100, 011], the
reception module 11 receives asecond packet 102 p (a bit string of which is [100,001]), which comprises a plurality of second data bits and the CRC information. Like the processing of thefirst packet 101 p [100,111], thedetermination module 12 calculates and determines whether thesecond packet 102 p [100,001] is an erroneous packet according to the CRC information. In particular, thesecond packet 102 p [100,001] is transmitted to theremainder generating unit 12 a where a calculation is made according to the generation polynomial [101] to obtain a second CRC remainder 102 r (a bit string of which is [11]). Next, theremainder generating unit 12 a transmits the second CRC remainder 102 r [11] to theremainder determination unit 12 b, which determines whether the second CRC remainder 102 r [11] is equal to zero. Because the second CRC remainder 102 r [11] is not equal to zero, thesecond packet 102 p [100,001] is also determined to be an erroneous packet. Then, thetransmission module 15 transmits another reception failure message 162 to the transmitting end to request retransmission of the correct packet [100, 011]. Meanwhile, theremainder generating unit 12 a transmits thesecond packet 102 p [100,001] to thepattern generating module 14 to be stored therein. - According to the
first packet 101 p [100,111] and thesecond packet 102 p [100,001] previously stored, thepattern generating module 14 retrieves each of the first data bits of thefirst packet 101 p [100,111] and each of the second data bits of thesecond packet 102 p [100,001] to perform an XOR logical operation thereon to obtain a first error pattern 131(a bit string of which is [000,110]). In the first error pattern 131 [000,110], bits with a value of [1] represent bits where thefirst packet 101 p [100,111] is different from thesecond packet 102 p [100,001]. In other words, in the first error pattern 131 [000,110], bits with a value of [1] represent bits where an error arises in thefirst packet 101 p [100,111] and thesecond packet 102 p [100,001]. - As the
transmission module 15 transmits the reception failure message 162 to the transmitting end to request retransmission of the correct packet [100,011], the transmitting end retransmits the correct packet after receiving the reception failure message 162. Afterwards, thereception module 11 receives athird packet 103 p (a bit string of which is [100,100]), which comprises a plurality of third data bits and the CRC information. Similar to what was described in connection with thefirst packet 101 p [100, 111] and thesecond packet 102 p [100,001], thedetermination module 12 determines whether thethird packet 103 p [100,100] is an erroneous packet according to the CRC information. In particular, thethird packet 103 p [100,100] is transmitted to theremainder generating unit 12 a where calculation is made according to the generation polynomial [101] to obtain athird CRC remainder 103 r (a bit string of which is [01]). Next, theremainder generating unit 12 a transmits thethird CRC remainder 103 r [01] to theremainder determination unit 12 b, which determines whether thethird CRC remainder 103 r [01] is equal to zero. Because thethird CRC remainder 103 r [01] is still not equal to zero, thethird packet 103 p [100,100] is also determined to be an erroneous packet. Meanwhile, theremainder generating unit 12 a transmits thethird packet 103 p [100,100] to thepattern generating module 14 to be stored therein. - It should be particularly noted herein that the present invention is not limited to use of the CRC error detection approach to determine whether the
first packet 101 p, thesecond packet 102 p or thethird packet 103 p is an erroneous packet. Rather, depending on the practical needs, those of ordinary skill in the art may choose other error detection approaches to determine whether thefirst packet 101 p, thesecond packet 102 p or thethird packet 103 p is an erroneous packet and, therefore, this will not be further described herein. - From the
first packet 101 p [100,111], thesecond packet 102 p [100,001] and thethird packet 103 p [100,100] previously stored, thepattern generating module 14 retrieves each data bit of two of the packets to perform a further XOR logical operation thereon to obtain a second error pattern. In this embodiment, thepattern generating module 14 retrieves each of the first data bits of thefirst packet 101 p [100,111] and each of the third data bits of thethird packet 103 p [100,100] to perform an XOR logical operation thereon to obtain a second error pattern 132 (a bit string of which is [000, 011]). Likewise, in the second error pattern 132 [000,011], bits with a value of [1] represent bits where thefirst packet 101 p [100,111] is different from thethird packet 103 p [100,100]. In other words, in the second error pattern 132 [000,011], bits with a value of [1] represent bits where an error arises in thefirst packet 101 p [100,111] and thethird packet 103 p [100,100]. - Thereafter, by performing an OR logical operation on the first error pattern 131 [000,110] and the second error pattern 132 [000,011], the
pattern generating module 14 calculates all erroneous bits in thefirst packet 101 p [100,111], thesecond packet 102 p [100,001] and thethird packet 103 p [100,100] to generate a third error pattern 133 (a bit string of which is [000,111]). - Afterwards, the
packet generating unit 13 a generates a plurality of target packets according to the third error pattern 133 [000,111] and either thefirst packet 101 p [100,111 ], thesecond packet 102 p [100,001 ] or thethird packet 103 p [100,100]. In this embodiment, thepacket generating unit 13 a generates eight target packets according to thefirst packet 101 p [100,111] and the third error pattern 133 [000,111], namely, 151 p [100,000], 152 p [100,001], 153 p [100,010], 154 p [100,011], 155 p [100,100], 156 p [100,101], 157 p [100,110] and 158 p [100,111]. - The
remainder generating unit 12 a receives thesetarget packets 151 p, 152 p, . . . , 158 p and, according to the generation polynomial [101], calculatestarget CRC remainders 151 r [10], 152 r [11], 153 r [100], 154 r [0], 155 r [01], 156 r [10], 157 r [11] and 158 r [100] corresponding to thetarget packets 151 p, 152 p, . . . , 158 p respectively. Then, theremainder determination unit 12 b receives thetarget CRC remainders 151 r, 152 r, . . . , 158 r and sequentially determines whether each of them is equal to zero. - Because the target CRC remainder 154 r [0] is equal to zero, the
remainder determination unit 12 b determines that the target packet 154 p [100,011] corresponding to the target CRC remainder 154 r [0] is the correct packet, thus completing the data correction method of the present invention. - If none of the aforesaid target CRC remainders is equal to zero, the
transmission module 15 retransmits another reception failure message to the transmitting end to request retransmission of the correct packet [100,011], and operations described above are repeated again. In more detail, if the receiving end receives S erroneous packets in total, thepattern generating module 14 only needs to retrieve (S-1) pairs of erroneous packets and performs an XOR logical operation on the data bits of each pair of erroneous packets to obtain (S-1) error patterns. Then, an OR logical operation is performed on the error patterns to generate an error pattern for calculating the target packets. - For example, when the receiving end receives five erroneous packets E1, E2, E3, E4 and E5, the error pattern can be calculated through (E1 XOR E2) OR (E2 XOR E3) OR (E3 XOR E4) OR (E4 XOR E5), or through (E1 XOR E2) OR (E1 XOR E3) OR (E1 XOR E4) OR (E1 XOR E5). The
packet generating unit 13 a then calculates each of the target packets, according to the error pattern for calculating the target packets, via one or more of the five erroneous packets E1, E2, E3, E4 and E5. Based on the above description, those of ordinary skill in the art may calculate the error patterns and the target packets according to a different number of erroneous packets and calculate the correct packet through an exhaustive algorithm according to the target packets, and therefore, this will not be further described herein. -
FIG. 2 depicts a second embodiment of the present invention, which is a data correction method. This data correction method is adapted for a data correction apparatus, e.g., thedata correction apparatus 1 described in the first embodiment. Thedata correction apparatus 1 may be deployed at a receiving end of a wired or wireless communication system (not shown) with an ARQ/HARQ or spatial multiplexing scheme. More specifically, the data correction method of the second embodiment may be implemented by a tangible machine-readable medium. When the tangible machine-readable medium is loaded into thedata correction apparatus 1 via a computer and a plurality of codes incorporated in the computer program product are executed, the data correction method of the second embodiment can be accomplished. This computer program product may be stored in a tangible machine-readable medium, such as a read only memory (ROM), a flash memory, a floppy disk, a hard disk, a compact disk, a mobile disk, a magnetic tape, a database accessible to networks, or any other storage media with the same function and well known to those skilled in the art. - The second embodiment comprises the following steps. Initially,
step 201 is executed to receive a plurality of packets, for example, the first packet, the second packet and the third packet described in the first embodiment. The first packet comprises a plurality of first data bits and a CRC information; the second packet comprises a plurality of second data bits and the CRC information; and the third packet comprises a plurality of third data bits and the CRC information. Then, step 202 is executed to determine whether one of the packets is a correct packet according to the CRC information. More particularly, by using the first packet, the second packet and the third packet as a dividend respectively and a generation polynomial as a divisor, a binary division operation is performed to obtain a first CRC remainder, a second CRC remainder and a third CRC remainder respectively. If the first CRC remainder, the second CRC remainder or the third CRC remainder is equal to zero, this means that one of the packets is the correct packet. Then, step 203 is executed to transmit another packet. - On the other hand, if none of the CRC remainders (i.e., the first CRC remainder, the second CRC remainder and the third CRC remainder) is equal to zero in
step 202, this means that all these packets are erroneous. Then, step 204 is executed to determine whether at least two of the packets are retransmitted. If all the packets are independent packets unrelated to each other, step 205 is executed to transmit a reception failure message. - Because both the second packet and the third packet are retransmitted packets,
step 206 is executed to generate a plurality of error patterns according to the packets, e.g., the first error pattern, the second error pattern and the third error pattern described in the first embodiment. Afterwards,step 207 is executed to generate a plurality of target packets according to the error patterns and one or more of the packets. Next,step 208 is executed to calculate a respective target CRC remainder of each of the target packets, and step 209 is executed to determine whether one of the target CRC remainders is equal to zero. - If it is determined in
step 209 that one of the target CRC remainders is equal to zero,step 210 is then executed to set the target packet corresponding to the target CRC remainder to be a correct packet. Next,step 203 is executed to transmit another packet. Otherwise, if it is determined instep 208 that none of the target CRC remainders is equal to zero, this data correction method returns to step 205 to transmit a reception failure message anew to request the retransmission of the packet by the transmitting end. - In addition to the aforesaid steps, the second embodiment can also execute the operations and functions set forth with respect to the
data correction apparatus 1 of the first embodiment. The method in which the second embodiment executes these operations and functions will be readily appreciated by those of ordinary skill in the art based on the explanation of the first embodiment and, thus, will not be further described herein. -
FIG. 3 depicts a third embodiment of the present invention, which is adata correction apparatus 3. Thedata correction apparatus 3 comprises areception module 11, adetermination module 12, acalculation module 33, apattern generating module 14 and atransmission module 15. Thecalculation module 33 comprises avector processing unit 33 a and a logical processing unit 33 b, and thedetermination module 12 comprises aremainder generating unit 12 a and aremainder determination unit 12 b. This embodiment differs from the first embodiment in the way in which the correct packet is calculated. It should be appreciated that elements bearing the same reference numerals as those ofFIG. 1 have already been described in the first embodiment, and thus will not be further described herein. - In reference to
FIG. 3 , as in the first embodiment, thereception module 11 receives thefirst packet 101 p [100,111], thesecond packet 102 p [100,001] and thethird packet 103 p [100,100] respectively, and theremainder generating unit 12 a calculates afirst CRC remainder 101 r [100], a second CRC remainder 102 r [11] and athird CRC remainder 103 r [01] corresponding thereto respectively according to the generation polynomial [101]. Then, theremainder determination unit 12 b determines that thefirst packet 101 p, thesecond packet 102 p and thethird packet 103 p are all erroneous packets. Thetransmission module 15 transmits reception failure messages 161, 162 to the transmitting end. Thepattern generating module 14 calculates a third error pattern 133 [000,111] according to the following operation: (thefirst packet 101 p XOR thesecond packet 102 p) OR (thefirst packet 101 p XOR thethird packet 103 p). - An erroneous packet may be considered as a result of performing an operation on the correct packet and an error pattern vector, so the correct packet can be deduced if the error pattern vector is known. For example, the
first packet 101 p [100,111] may be represented as a result of performing an XOR logical operation on the correct packet [100,011] and the error pattern vector [000,100], so if the error pattern vector [000,100] is obtained, the correct packet can be derived according to thefirst packet 101 p. - As can be seen from the first embodiment, the
third error pattern 133 is calculated according to thefirst packet 101 p, thesecond packet 102 p and thethird packet 103 p. Therefore, thethird error pattern 133 is linearly correlated to the error pattern vector corresponding to thefirst packet 101 p, thesecond packet 102 p or thethird packet 103 p. For example, assuming that thethird error pattern 133 may be represented as a vector e*=b1+b2+ . . . bm (b1, b2, . . . , bm each represent a unit vector respectively), then the error pattern vector e1 corresponding to thefirst packet 101 p can be represented as a linear relational expression: e1=c1b1+c2b2+ . . . +cmbm (c1, c2, . . . , cm each represent a scalar). Accordingly, this embodiment calculates the error pattern vector according to the following formula: - where m represents
-
- [1] in an error pattern vector (e.g., the third error pattern 133), r represents a vector of the CRC remainders of the erroneous packets (e.g., the
first CRC remainder 101 r, the second CRC remainder 102 r or thethird CRC remainder 103 r), (c1c2 . . . cm)T represents a vector of scalars associated with the error pattern vectors, and h11, h12, . . . , h1m represent a vector of remainders associated with the error patterns (e.g., the third error pattern 133) and the generation polynomial respectively. - From the perspective of linear algebra, the third error pattern 133 [000,111] can be represented as a polynomial of X2+X+1 which, in turn, can be represented by an inner product of a vector (X5X4X3X2X1) and a vector (000111)T. Hereinbelow, a vector (000111)T is used to represent the vector e* of the
third error pattern 133. Similarly, a vector (101)T is used to represent the vector of the generation polynomial [101], a vector (100)T is used to represent thefirst CRC remainder 101 r [100], a vector (011)T is used to represent the second CRC remainder 102 r [11], and a vector (001)T is used to represent thethird CRC remainder 103 r [01]. It should be understood that what is described above may all be readily understood by those of ordinary skill in the art and thus will not be further described herein. - The
vector processing unit 33 a has the vector e* of thethird error pattern 133 represented as at least one vector. In other words, (000111)T=(000001)T+(000010)T+(000100)T, where b1=(000001)T, b2=(000010)T and b3=(000100)T are all unit vectors. Also, for example, the error pattern vector e1 corresponding to the first packet 1001 p can be represented as c1b1+c2b2+c3b3. Next, by using the unit vectors b1, b2, b3 as a dividend respectively and the generation polynomial vector (101)T as a divisor, thevector processing unit 33 a derives the remainder vectors h11, h12, . . . , h1m thereof respectively. It should be emphasized that, [h11 h12 . . . h1m] is not necessarily a square matrix. For example, if CRC-32 (i.e., the CRC remainder it corresponds to has 32 bits) is used as the generation polynomial and thethird error pattern 133 has three bits [1], then [h11, h12h13] is a 32×3 matrix. - This embodiment will use the
first packet 101 p and the error pattern vector e1 thereof to calculate the correct packet; however, upon reviewing the description of this embodiment, those of ordinary skill in the art may also use thesecond packet 102 p and the error pattern vector thereof, or thethird packet 103 p and the error pattern vector thereof to calculate the correct packet. In this embodiment, m=3, and the remainder vectors derived by thevector processing unit 33 a are h11=(001)T, h12=(010)T and h13=(100)T respectively. Meanwhile, r=(100)T (the vector of thefirst CRC remainder 101 r [100]). Thus, by substituting the values of this embodiment, the aforesaid formula is simplified as: -
- There are a number of approaches to calculate (c1c2c3)T in the prior art, such as the pseudo inverse approach, the Gaussian elimination approach and etc. In this embodiment, at least one error pattern is generated according to the remainder vectors h11, h12, h13 and the vector r of the
first CRC remainder 101 r, and an intersection operation is performed on the error patterns to obtain an error pattern vector e1. - In particular, three equations can be derived from the above formula through observation, namely, c3=1, c2=0 and c1=0 respectively. For c3=1, the
vector processing unit 33 a generates an error pattern S1={(c1c2c3)T=(001)T, (011)T, (101)T, (111)T}. Next, for c2=0, thevector processing unit 33 a generates an error pattern S2={(c1c2c3)T=(001)T, (101)T, (100)T, (000)}, and for c1=0, thevector processing unit 33 a generates an error pattern S3={(c1c2c3)T=(001)T, (011)T, (010)T, (000)T}. Afterwards, thevector processing unit 33 a performs an intersection operation on the error patterns S1, S2, S3 to obtain (c1c2c3)T=(001), which means that the error pattern vector corresponding to thefirst packet 101 p is e1=c1(000001)T+c2(000010)T+c3(000100)T=(000100)T. Thevector processing unit 33 a then transmits the error pattern vector e1 to the logical processing unit 33 b. Then, the logical processing unit 33 b performs an XOR logical operation on the error pattern vector (000100)T and the vector of thefirst packet 101 p to obtain a vector (100011)T of the correct packet. In other words, the correct packet is [100,011]. If, subsequent to the intersection operation, thevector processing unit 33 a still fails to solve the (c1c2c3)T, thetransmission module 15 will a new retransmission request. - In a preferred example, this embodiment may further use a deletion approach. In particular, the
vector processing unit 33 a initially calculates the error pattern S1={(c1c2c3)T=(001)T, (011)T, (101)T, (111)T}. Next, thevector processing unit 33 a substitutes the error pattern S1 into the second equation c2=0 to delete impossible solutions thereof, thereby yielding the error pattern S2={(c1c2c3)T=(001)T, (101)T}. Finally, thevector processing 33 a substitutes the error pattern S2 into the equation c1=0 to delete impossible solutions thereof, thereby yielding the error pattern S3={(c1c2c3)T=(001)T}. - When there are too many possibilities for (c1c2c3)T, the deletion approach can delete impossible combinations rapidly. In other words, for an error pattern with many bits of [1], the deletion approach only needs to generate a single set of error patterns and then substitute the error patterns thereof into other equations to delete erroneous combinations therefrom. This saves more calculation time as compared to other solutions. Because the number of rows that the deletion approach observes increases, the number of erroneous bit combinations that can be deleted increases exponentially, so it is possible to shorten the time of finding out the correct packet by using the deletion approach in combination with an appropriate data structure (e.g., a tree structure).
-
FIG. 4 is a fourth embodiment of the present invention, which is a data correction method. This data correction method is adapted for a data correction apparatus, e.g., thedata correction apparatus 3 described in the third embodiment. Thedata correction apparatus 3 may be deployed at a receiving end of a wired or wireless communication system (not shown) with an ARQ/HARQ or spatial multiplexing scheme. More specifically, the data correction method of the fourth embodiment may be implemented by a tangible machine-readable medium. When the tangible machine-readable medium is loaded into thedata correction apparatus 3 via a computer and a plurality of codes incorporated in the computer program product are executed, the data correction method of the fourth embodiment can be accomplished. This computer program product may be stored in a tangible machine-readable medium, such as a read only memory (ROM), a flash memory, a floppy disk, a hard disk, a compact disk, a mobile disk, a magnetic tape, a database accessible to networks, or any other storage media with the same function and well known to those skilled in the art. - The fourth embodiment comprises the following steps. Initially,
step 401 is executed to receive a plurality of packets, for example, the first packet, the second packet and the third packet described in the third embodiment. The first packet comprises a plurality of first data bits and a CRC information; the second packet comprises a plurality of second data bits and the CRC information; and the third packet comprises a plurality of third data bits and the CRC information. Then, step 402 is executed to determine whether one of the packets is a correct packet according to the CRC information. More particularly, by using the first packet, the second packet and the third packet as a dividend respectively and a generation polynomial as a divisor, a binary division operation is performed to obtain a first CRC remainder, a second CRC remainder and a third CRC remainder respectively. If either the first CRC remainder, the second CRC remainder or the third CRC remainder is equal to zero, this means that one of the packets is the correct packet. Then, step 403 is executed to transmit another packet. - On the other hand, if none of the CRC remainders (i.e., the first CRC remainder, the second CRC remainder and the third CRC remainder) is equal to zero in
step 402, this means that all these packets are erroneous. Then, step 404 is executed to determine whether at least two of the packets are retransmitted ones. If all the packets are independent packets unrelated to each other, step 405 is executed to transmit a reception failure message. - Because both the second packet and the third packet are retransmitted packets in the third embodiment,
step 406 is executed to generate a plurality of error patterns according to the packets, e.g., the third error pattern as described in the third embodiment. Afterwards,step 407 is executed to represent the last generated error pattern (e.g., the third error pattern) as at least one unit vector, e.g., the three unit vectors b1, b2, b3 described in the third embodiment. Next,step 408 is executed to calculate at least one remainder vector (e.g., the remainder vector h11, h12, h13 as described in the third embodiment) by using the unit vectors obtained instep 407 as a dividend respectively and a generation polynomial as a divisor. Thereafter,step 409 is executed to determine whether at least one error pattern vector can be obtained according to the remainder vector and one or more of the first CRC remainder, the second CRC remainder and the third CRC remainder. - More specifically, by substituting the remainder vector and one or more of the first CRC remainder, the second CRC remainder and the third CRC remainder into the formula described in the third embodiment, the error pattern vectors c1, c2, c3 are calculated, the detailed calculation process of which has been described in the third embodiment. If
step 409 fails to obtain an error pattern vector,step 405 is executed to transmit a reception failure message. Otherwise, if at least one error pattern vector is generated instep 409, then according to the error pattern vector,step 410 is executed to perform an XOR logical operation on the error pattern vector and the first, the second or the third packet to obtain the correct packet. Afterwards, this data correction method returns to step 403 to transmit another packet. - In addition to the aforesaid steps, the fourth embodiment can also execute the operations and functions set forth with respect to the
data correction apparatus 3 of the third embodiment. The methods in which the fourth embodiment executes these operations and functions will be readily appreciated by those of ordinary skill in the art based on the explanation of the third embodiment and, thus, will not be further described herein. - According to the above description, the data correction apparatus, the data correction method and the tangible machine-readable medium thereof of the present invention perform a varied number of XOR logical operations and OR logical operations according to the information of data bits of erroneous packets to generate an error pattern. Then, data correction is performed according to the error pattern and the original packet. In this way, the present invention is able to reduce retransmissions of packets to increase the utilization factor of the network bandwidth resources while also decreasing the error rate of data transmissions.
- The above disclosure is related to the detailed technical contents and inventive features thereof. People skilled in this field may proceed with a variety of modifications and replacements based on the disclosures and suggestions of the invention as described without departing from the characteristics thereof. Nevertheless, although such modifications and replacements are not fully disclosed in the above descriptions, they have substantially been covered in the following claims as appended.
Claims (24)
Applications Claiming Priority (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
TW097148793 | 2008-12-15 | ||
TW97148793A | 2008-12-15 | ||
TW097148793A TWI371928B (en) | 2008-12-15 | 2008-12-15 | Data correction apparatus, data correction method and computer program product thereof |
Publications (2)
Publication Number | Publication Date |
---|---|
US20100153817A1 true US20100153817A1 (en) | 2010-06-17 |
US8073825B2 US8073825B2 (en) | 2011-12-06 |
Family
ID=42194272
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US12/486,305 Expired - Fee Related US8073825B2 (en) | 2008-12-15 | 2009-06-17 | Data correction apparatus, data correction method and tangible machine-readable medium thereof |
Country Status (4)
Country | Link |
---|---|
US (1) | US8073825B2 (en) |
KR (1) | KR101120593B1 (en) |
DE (1) | DE102009032640B4 (en) |
TW (1) | TWI371928B (en) |
Families Citing this family (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2015184315A (en) * | 2014-03-20 | 2015-10-22 | 株式会社Screenホールディングス | Data correction device, drawing device, data correction method, and drawing method |
Citations (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5481566A (en) * | 1993-12-29 | 1996-01-02 | At&T Corp. | Method and apparatus to increase efficiency of systematic codes |
US6003151A (en) * | 1997-02-04 | 1999-12-14 | Mediatek Inc. | Error correction and detection system for mass storage controller |
US20020046382A1 (en) * | 1998-06-24 | 2002-04-18 | Ganning Yang | Method and apparatus for detecting and correcting errors using cyclic redundancy check |
US20040153945A1 (en) * | 2002-11-22 | 2004-08-05 | Isao Takami | Error correction circuit employing cyclic code |
US20080022185A1 (en) * | 2006-06-28 | 2008-01-24 | Fujitsu Limited | Remainder calculating apparatus for cyclic redundancy check |
US7426679B2 (en) * | 2002-05-20 | 2008-09-16 | Pmc-Sierra, Inc. | Cyclic redundancy check circuit for use with self-synchronous scramblers |
US20080288845A1 (en) * | 2007-05-15 | 2008-11-20 | Texas Instruments Incorporated | Range Extension and Noise Mitigation For Wireless Communication Links Utilizing a CRC Based Single and Multiple Bit Error Correction Mechanism |
US20090006922A1 (en) * | 2007-06-29 | 2009-01-01 | Kabushiki Kaisha Toshiba | Error correcting apparatus and error correcting method |
Family Cites Families (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
FI972987A (en) * | 1997-07-14 | 1999-01-15 | Nokia Telecommunications Oy | Reconstructing the transmitted data frame |
-
2008
- 2008-12-15 TW TW097148793A patent/TWI371928B/en not_active IP Right Cessation
-
2009
- 2009-06-17 US US12/486,305 patent/US8073825B2/en not_active Expired - Fee Related
- 2009-07-06 KR KR1020090061020A patent/KR101120593B1/en active IP Right Grant
- 2009-07-10 DE DE102009032640A patent/DE102009032640B4/en not_active Expired - Fee Related
Patent Citations (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5481566A (en) * | 1993-12-29 | 1996-01-02 | At&T Corp. | Method and apparatus to increase efficiency of systematic codes |
US6003151A (en) * | 1997-02-04 | 1999-12-14 | Mediatek Inc. | Error correction and detection system for mass storage controller |
US20020046382A1 (en) * | 1998-06-24 | 2002-04-18 | Ganning Yang | Method and apparatus for detecting and correcting errors using cyclic redundancy check |
US7426679B2 (en) * | 2002-05-20 | 2008-09-16 | Pmc-Sierra, Inc. | Cyclic redundancy check circuit for use with self-synchronous scramblers |
US20040153945A1 (en) * | 2002-11-22 | 2004-08-05 | Isao Takami | Error correction circuit employing cyclic code |
US20080022185A1 (en) * | 2006-06-28 | 2008-01-24 | Fujitsu Limited | Remainder calculating apparatus for cyclic redundancy check |
US20080288845A1 (en) * | 2007-05-15 | 2008-11-20 | Texas Instruments Incorporated | Range Extension and Noise Mitigation For Wireless Communication Links Utilizing a CRC Based Single and Multiple Bit Error Correction Mechanism |
US20090006922A1 (en) * | 2007-06-29 | 2009-01-01 | Kabushiki Kaisha Toshiba | Error correcting apparatus and error correcting method |
Also Published As
Publication number | Publication date |
---|---|
DE102009032640A1 (en) | 2010-06-24 |
TW201023529A (en) | 2010-06-16 |
KR101120593B1 (en) | 2012-03-09 |
DE102009032640B4 (en) | 2012-12-06 |
US8073825B2 (en) | 2011-12-06 |
KR20100069546A (en) | 2010-06-24 |
TWI371928B (en) | 2012-09-01 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN112425103B (en) | Method and system for retransmitting data using systematic polarization encoding | |
KR101143282B1 (en) | Systematic encoding and decoding of chain reaction codes | |
US8327232B2 (en) | Apparatus and method for improved reliability of wireless communications using packet combination-based error correction | |
US8086929B2 (en) | Method of executing LDPC coding using parity check matrix | |
JP3911263B2 (en) | Adaptive hybrid automatic retransmission request method and apparatus | |
KR101299124B1 (en) | Coding schemes for wireless communication transmissions | |
US8418015B2 (en) | Method, apparatus and system for coding and decoding of LDPC codes | |
WO2017177926A1 (en) | Data transmission processing method and apparatus | |
WO2017133580A1 (en) | Data packet coding processing method and device, base station, and user equipment | |
US20060262925A1 (en) | Quantum key delivery method and communication device | |
JP2023547596A (en) | Method and apparatus for encoding and decoding data using concatenated polarity adjusted convolutional codes | |
CN112152754A (en) | Method and device for retransmitting polarization code | |
EP2264930B1 (en) | Distributed code generation method and device | |
US8386877B2 (en) | Communication system, transmitter, error correcting code retransmitting method, and communication program | |
US8073825B2 (en) | Data correction apparatus, data correction method and tangible machine-readable medium thereof | |
US9054741B2 (en) | Method and apparatus for transmitting and receiving in a communication/broadcasting system | |
US20230208555A1 (en) | Permutated extension and shortened low density parity check codes for hybrid automatic repeat request | |
US20040181740A1 (en) | Communicating method, transmitting apparatus, receiving apparatus, and communicating system including them | |
Cabrera et al. | Taking the trash back in: practical joint channel and network coding for improving ieee 802.11 networks | |
KR102570190B1 (en) | A Method and apparatus for transmitting information using polar code | |
CN102684843B (en) | Obtaining method of optimal generation polynomial in type-II hybrid automatic repeat request (HARQ) system and repeat system adopting method | |
KR101753971B1 (en) | Network-channel coding method for providing improved error correction function, network-channel coding device and network-channel coding system using thereof | |
Paul et al. | Throughput analysis on a scheme of product codes for ARQ protocol | |
Pahlevani | Hosein K. Nazari | |
EP1770895A1 (en) | Transmission rate adaptation with incremental redundancy |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: INSTITUTE FOR INFORMATION INDUSTRY,TAIWAN Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:SHEU, SHIANN-TSONG;TSAI, TSUNG-YU;CHENG, KAI-FANG;AND OTHERS;SIGNING DATES FROM 20090206 TO 20090226;REEL/FRAME:022885/0841 Owner name: INSTITUTE FOR INFORMATION INDUSTRY, TAIWAN Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:SHEU, SHIANN-TSONG;TSAI, TSUNG-YU;CHENG, KAI-FANG;AND OTHERS;SIGNING DATES FROM 20090206 TO 20090226;REEL/FRAME:022885/0841 |
|
STCF | Information on status: patent grant |
Free format text: PATENTED CASE |
|
FPAY | Fee payment |
Year of fee payment: 4 |
|
FEPP | Fee payment procedure |
Free format text: MAINTENANCE FEE REMINDER MAILED (ORIGINAL EVENT CODE: REM.); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY |
|
LAPS | Lapse for failure to pay maintenance fees |
Free format text: PATENT EXPIRED FOR FAILURE TO PAY MAINTENANCE FEES (ORIGINAL EVENT CODE: EXP.); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY |
|
STCH | Information on status: patent discontinuation |
Free format text: PATENT EXPIRED DUE TO NONPAYMENT OF MAINTENANCE FEES UNDER 37 CFR 1.362 |
|
FP | Lapsed due to failure to pay maintenance fee |
Effective date: 20191206 |