Patent Grant
10187085
The present invention generally relates to data communication field, and more specifically, to decoding method, decoding apparatus and decoder for correcting burst errors.
Recently, with the continual increasing of data transferring rate in communication and networking areas such as high-speed SERDES etc, forward error correction (FEC) tech based on burst error correction cyclic codes is gaining more and more widespread application.
For example, IEEE 802.3ap standard calls for shortened cyclic codes (2112, 2080) capable of correcting burst error of up to 11-bits, wherein 2080 bits are information bits and the remaining 32 bits are parity bits. Typically, the burst error correction codes includes Fire Code, with the generation polynomial g(x)=(x2−1+1) p(x). Where all of the Galois field arithmetic is performed in GF(2m), where m is the order of the primitive polynomial p(x) and L is a positive integer such that L<=m and 2L−1 is not divisible by the period of p(x).
At encoder side, by employing linear sequential circuits, the encoding computation can be implemented by using t(x)=b(x)+xn−ku(x), where t(x) is the transmitted encoded data, u(x) is information bits and b(x)=xn−ku(x) mod g(x). Where n is the length of encoded data, k is the length of information bits, and n−k is the length of parity bits.
At decoder side, the decoder generally decodes cyclic codes by the following method.
First, syndrome is generated. For example, the syndrome may be generated by using s(x)=r(x) mod g(x), wherein r(x) is the received code word, and r(x)=t(x)+e(x). Where e(x) is the errors contained in the received data. In particular, when generating syndrome, it is required that the received data is stored into data buffer. Not until the entire frame is received, the syndrome can be generated. It brings about one frame decoding latency for syndrome generation.
Next, the syndrome is detected and is tested for corresponding error pattern. The relationship between the syndrome and error pattern is as below:
s(x)=r(x)mod g(x)={t(x)+e(x)} mod G(x)=e(x)mod G(x)
If e(x) is gotten, corrected data will be denoted as c(x)=r(x)+e(x).
Finally, after the frame is decoded, the decoder will send the data with a flag indicating correctable or uncorrectable to upper layer. In IEEE802.3ap standard, if it is determined that the current frame is uncorrectable, FEC layer will modify the related sync head of 64B/66B block, e.g., by adding a flag indicating that the error is uncorrectable, such that the upper PCS layer will know that the ongoing frame is corrupted, and then take corresponding reactions. Thus, it's also very important to determine whether the frame is correctable or uncorrectable immediately before sending the data to upper layers.
In prior art, based on different ways to get e(x), many branches of error decoding scheme is developed. A decoding schema, such as Meggitt decoder, requires that not until the error pattern of the entire frame is determined, the correctability of error can be determined. Then the frame is further processed based on the error pattern and whether the frame is correctable. However, the error pattern determining procedure will introduce about one frame latency. Thus, if one wants to determine whether the frame is correctable or uncorrectable before sending it to the upper layer, it requires two frame decoding latency from the reception of the data. Moreover, it further requires a bigger buffer to store 2 complete frames of data.
Another decoder is designed based on Fire Code. Typical Fire Code decoder can be found on book “Error-Correcting Codes”, published by MIT press in 1972. Generally, the decoding scheme based on Fire Code requires relatively higher computation capability for receiver, and the decoding latency of using said decoding scheme will generally be more than one frame, the exact latency is related to the period of primitive polynomial p(x).
Thus, a decoding schema that overcomes the above problems of the prior art is needed.
An objective of the present invention is to provide an improved decoding schema that overcomes the above problems of the prior art.
Thus, the present invention proposes a decoding method, decoding apparatus, and decoder for correcting burst errors. With the decoding method, decoding apparatus, and decoder of the present invention, error correctability of burst errors contained in a data frame can be determined before the data is send out, while having smaller decoding latency through determining the error correctability and error pattern of the burst errors contained in the data frame using initial syndrome of the data frame.
According to one embodiment of the present invention, there is provided a decoding method for correcting burst errors, the method comprising: computing an initial syndrome of a received data frame, wherein the data frame is encoded according to cyclic codes for correcting burst errors; determining error correctability of burst error contained in the data frame based on the computed initial syndrome; and processing the burst error in the data frame and outputting the processed data frame based on the determined error correctability.
According to another embodiment of the present invention, there is provided a decoding apparatus for correcting burst errors, the apparatus comprising: an initial syndrome computing unit, configured for computing an initial syndrome of a received data frame, wherein the data frame is encoded according to cyclic codes for correcting burst errors; an error correctability determining unit, configured for determining error correctability of the burst error contained in the data frame based on the computed initial syndrome; and an error processing unit, configured for processing the burst error in the data frame and output the processed data frame based on the determined error correctability.
According to another embodiment of the present invention, there is provided a decoder for correcting burst errors, the decoder comprising: a data buffer, configured for storing a received data frame, wherein the data frame is encoded according to cyclic codes for correcting burst error; an initial syndrome computing circuit, configured for reading out the data frame from the data buffer and computing an initial syndrome of the data frame; an error correctability determining circuit, comprising a plurality of multiplexers and a XOR gate, and configured for determining error correctability of burst error contained in the data frame based on the initial syndrome computed by the initial syndrome computing circuit; and an error processing circuit, configured for processing the burst error in the data frame and outputting the processed data frame based on the error correctability determined by the error correctability determining circuit.
With the decoding method, decoding apparatus, and decoder of the present invention, error correctability of burst errors contained in a data frame can be determined before the data is send out, while having smaller decoding latency, through determining the error correctability and error pattern of the burst errors contained in the data frame using initial syndrome of the data frame.
Through the more detailed description of some embodiments of the present disclosure in the accompanying drawings, the above and other objects, features and advantages of the present disclosure will become more apparent, wherein the same reference generally refers to the same components in the embodiments of the present disclosure.
Some preferable embodiments will be described in more detail with reference to the accompanying drawings, in which the preferable embodiments of the present disclosure have been illustrated. However, the present disclosure can be implemented in various manners, and thus should not be construed to be limited to the embodiments disclosed herein. On the contrary, those embodiments are provided for the thorough and complete understanding of the present disclosure, and completely conveying the scope of the present disclosure to those skilled in the art.
As will be appreciated by one skilled in the art, aspects of the present invention may be embodied as a system, method or computer program product. Accordingly, aspects of the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment (including firmware, resident software, micro-code, etc.) or an embodiment combining software and hardware aspects that may all generally be referred to herein as a “circuit,” “module” or “system.” Furthermore, aspects of the present invention may take the form of a computer program product embodied in one or more computer readable medium(s) having computer readable program code embodied thereon.
Any combination of one or more computer readable medium(s) may be utilized. The computer readable medium may be a computer readable signal medium or a computer readable storage medium. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this document, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
A computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.
Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
Computer program code for carrying out operations for aspects of the present invention may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C++ or the like and conventional procedural programming languages, such as the “C” programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider).
Aspects of the present invention are described below with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer readable medium that can direct a computer, other programmable data processing apparatus, or other devices to function in a particular manner, such that the instructions stored in the computer readable medium produce an article of manufacture including instructions which implement the function/act specified in the flowchart and/or block diagram block or blocks.
The computer program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other devices to cause a series of operational steps to be performed on the computer, other programmable apparatus or other devices to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide processes for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
Referring now to
As shown in
Bus 18 represents one or more of any of several types of bus structures, including a memory bus or memory controller, a peripheral bus, an accelerated graphics port, and a processor or local bus using any of a variety of bus architectures. By way of example, and not limitation, such architectures include Industry Standard Architecture (ISA) bus, Micro Channel Architecture (MCA) bus, Enhanced ISA (EISA) bus, Video Electronics Standards Association (VESA) local bus, and Peripheral Component Interconnect (PCI) bus.
Computer system/server 12 typically includes a variety of computer system readable media. Such media may be any available media that is accessible by computer system/server 12, and it includes both volatile and non-volatile media, removable and non-removable media.
System memory 28 can include computer system readable media in the form of volatile memory, such as random access memory (RAM) 30 and/or cache memory 32. Computer system/server 12 may further include other removable/non-removable, volatile/non-volatile computer system storage media. By way of example only, storage system 34 can be provided for reading from and writing to a non-removable, non-volatile magnetic media (not shown and typically called a “hard drive”). Although not shown, a magnetic disk drive for reading from and writing to a removable, non-volatile magnetic disk (e.g., a “floppy disk”), and an optical disk drive for reading from or writing to a removable, non-volatile optical disk such as a CD-ROM, DVD-ROM or other optical media can be provided. In such instances, each can be connected to bus 18 by one or more data media interfaces. As will be further depicted and described below, memory 28 may include at least one program product having a set (e.g., at least one) of program modules that are configured to carry out the functions of embodiments of the invention.
Program/utility 40, having a set (at least one) of program modules 42, may be stored in memory 28 by way of example, and not limitation, as well as an operating system, one or more application programs, other program modules, and program data. Each of the operating system, one or more application programs, other program modules, and program data or some combination thereof, may include an implementation of a networking environment. Program modules 42 generally carry out the functions and/or methodologies of embodiments of the invention as described herein.
Computer system/server 12 may also communicate with one or more external devices 14 such as a keyboard, a pointing device, a display 24, etc.; one or more devices that enable a user to interact with computer system/server 12; and/or any devices (e.g., network card, modem, etc.) that enable computer system/server 12 to communicate with one or more other computing devices. Such communication can occur via Input/Output (I/O) interfaces 22. Still yet, computer system/server 12 can communicate with one or more networks such as a local area network (LAN), a general wide area network (WAN), and/or a public network (e.g., the Internet) via network adapter 20. As depicted, network adapter 20 communicates with the other components of computer system/server 12 via bus 18. It should be understood that although not shown, other hardware and/or software components could be used in conjunction with computer system/server 12. Examples, include, but are not limited to: micro-code, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data archival storage systems, etc.
An objective of the present invention is to provide a decoding scheme, which can determine correctability of burst errors (if there is any) contained in a data frame before the data frame is send out to upper layers, and which also has smaller decoding latency.
With reference now to
As shown in
It should be noted that data frame and cyclic codes can be used exchangeable below. Those in the art will appreciate that if the received code word r(x) (which also can be written in the form of r(n, k) (wherein n denotes the length of the code word, and k denotes the length of information bits)) is divided by generation polynomial g(x) (with its order n−k), the resulting remaining polynomial, also can be referred to as syndrome polynomial s(x) (referred to as initial syndrome hereafter) will be gotten, that is: s(x)=r(x) mod g(x)
Thus, the order of s(x) is lower than that of g(x), that is, s(x) is a polynomial with the order of n−k−1 or less. For example, s(x) may take the form of: s(x)=a0+a1x1+a2x2+ . . . +an−k−ixn−k−q
In an example, the cyclic codes is Fire Code with generation polynomial g(x)=(x2L−1+1) p(x), wherein p(x) is primitive polynomial, all of the Galois field arithmetic is performed in GF(2m), where m is the order of p(x) and L is a positive integer such that L<=m and 2L−1 is not divisible by the period of p(x). Where x2L−+1 is defined as error pattern polynomial and p(x) is defined as error location polynomial. L represents the number of the bits of the burst error that can be corrected by said cyclic codes.
Next, at step S204, error correctability of the burst error contained in the data frame is determined based on the initial syndrome computed at step S202. As stated above, the initial syndrome has been obtained at step S202. Thus, it will be beneficial if the relationship between the initial syndrome and the error correctability can be determined, thereby determining whether the error is correctable based on the computed initial syndrome. For the ease of description, IEEE 802.3ap standard will be taken as an example, to derive the relationship between the initial syndrome and the error correctability, thus, it can be determined whether the burst error is correctable based on the initial syndrome.
For IEEE 802.3ap standard, its generate polynomial is:
g(x)=x32+x23+x21+x11+x2+1,
it can be factored as:
g(x)=(x21+1)(x11+x2+1),
wherein x11+x2+1 is a irreducible primitive polynomial over GF(2), referred to as error location polynomial, and x21+1 is error pattern polynomial. This codes can correct a burst error with the length of equal or less than 11.
Suppose there is a burst error with length of 11 bits or less, let the error pattern be e(x)=xjB(x), where B(x) is a polynomial of degree 10 or less and j is not bigger than n−1. Thus, polynomial B(x) and (x21+1), B(x) and (x11+x2+1) are relative prime, and obviously, xj and (x21+1), xj and (x11+x2+1) are also relative prime. Then, r(x)mod g(x)={t(x)+xjB(x)} mod g(x)=xjB(x) mod g(x)≠0
On the other hand, when and only when r(x) is a code word, r(x) can be divided by g(x) with no reminder, so r(x) mod g(x)=0; Now, let
s1(x)=r(x)mod(x21+1),
s2(x)=r(x)mod(x11+x2+1),
wherein s1(x) and s2(x) are referred to as a first syndrome and a second syndrome respectively. The existing study already shows that the relationship between error correctability of burst error and the first syndrome s1(x) and the second syndrome s2(x) is as below:
if s1(x)=0 and s2(x)=0, it shows that no error is detected with the received code word r(x);
if s1(x)=0 and s2(x)≠0, or s1(x)≠0 and s2(x)=0, it shows that the burst error is uncorrectable;
if s1(x)≠0 and s2(x)≠0; and the successive 0s in s1(x) is no more than 10, it shows that the burst error is uncorrectable, otherwise it is correctable.
There is similar deduction for general g(x)=(x21−1+1) p(x).
With the above derivation, it can be seen that if the first syndrome s1(x) and the second syndrome s2(x) can be obtained, whether the burst error contained in the current frame is correctable or uncorrectable can be determined based on the relationship as stated above.
The above explanation shows that the first syndrome s1(x) and the second syndrome s2(x) can be computed by applying module operation to the received code word r(x). However, the length of the received code word r(x) is n bits, which causes a large quantity of computations to compute the first syndrome s1(x) and the second syndrome s2(x), thereby causing a large latency. It will explain how to compute the first syndrome s1(x) and the second syndrome s2(x) based on the initial syndrome s(x) below.
Since s(x)=r(x)mod g(x)=e(x) mod g(x), let e(x)=a(x)g(x)+s(x), then, s1(x)=r(x)mod (x21+1)=e(x) mod (x21+1)=[a(x)g(x)+s(x)] mod (x21+1). Since (x21+1) is a factor of g(x), s1(x)=s(x) mod (x21+1).
For the same reason, s2(x)=r(x) mod (x11+x2+1)=e(x)mod(x11+x2+1)=[a(x)g(x)+s(x)] mod (x11+x2+1). Since (x11+x2+1) is a factor of g(x), s2(x)=s(x) mod (x11+x2+1).
From the above, it can be seen that after the initial syndrome s(x) is gotten, the first syndrome s1(x) and the second syndrome s2(x) can be computed by applying two module operations to the initial syndrome s(x). For a specific module operation, shift and subtract operations can be used to reduce computation complexity. Thus, after the whole frame is received, some combinational logic can be employed to calculate the first syndrome s1(x) and the second syndrome s2(x) when the initial syndrome s(x) is gotten.
In implementation, dividing the initial syndrome computed at step S202 by the error pattern polynomial comprises: performing shift operation on terms in the initial syndrome computed at step S202 with order higher than the highest order in the error pattern polynomial; and performing subtract operation on results of the shift operation and terms in the initial syndrome with order not higher than the highest order of the error pattern polynomial.
For example, for items in the initial syndrome with order higher than the order 2L−1, shifting them by 2L−1 bits. In particular, in IEEE 802.3ap standard, the term with the highest order of 31 is shifted 21 bits, and so on. The term with order of 21 is also shifted by 21 bits. Then subtract operations are performed on results of the shift operation and items in the initial syndrome with order not higher than the order of 2L−1. For example, the subtract operation can be performed by XOR operation.
At step S304, computing a second syndrome with an error location polynomial based on the initial syndrome computed at step S202. In particular, computing the second syndrome comprises: dividing the initial syndrome computed at step S202 by the error location polynomial, and determining the remaining polynomial as the second syndrome.
In implementation, dividing the initial syndrome computed at step S202 by the error location polynomial comprises: performing shift operation on terms in the initial syndrome computed at step S202 with order higher than the highest order in the error location polynomial; and performing subtract operation on results of the shift operation and items in the initial syndrome with order not higher than the highest order of the error location polynomial.
Shift and subtract operations herein are similar as those described with respect to computing the first syndrome. The difference lies in that, more than one shift operations may be required to shift items in the initial syndrome with order higher than the highest order of the error location polynomial, and that shift and subtract operations may be required to perform iteratively.
At step S306, the error correctability of the burst error contained in the data frame is determined with a predetermined rule, based on the computed first syndrome s1(x) and second syndrome s2(x).
In an example, the predetermined rule is as below: if both the first and second syndrome are 0, it shows that no error is detected with the received code word; if only one of the first syndrome and the second syndrome is 0, it shows that the burst error is uncorrectable; if neither of the first syndrome or the second syndrome is 0, and the successive 0s in the first syndrome is no more than the length of the burst error that the cyclic codes can correct minuses 1, it shows that the burst error is uncorrectable, otherwise it is correctable.
In particular, if s1(x)=0 and s2(x)=0, it shows that no error is detected with r(x); if s1(x)=0 and s2(x)≠0, or s1(x)≠0 and s2(x)=0, it shows that the burst error is uncorrectable; if s1(x)≠0 and s2(x)≠0, and the successive 0s in s1(x) is no more than L−1, it shows that the burst error is uncorrectable, otherwise it is correctable.
Given the above, it can be seen that two module operations can be performed to obtain the first syndrome s1(x) and second syndrome s2(x), on the basis of the obtained initial syndrome s(x). Then a predetermined rule may be applied to determine whether the burst error contained in the data frame is correctable or uncorrectable. For a specific module operation, in concrete implementation, shift and subtract operations can be used to reduce computation complexity. Thus, after the whole frame is received, some combinational logic can be employed to calculate the first syndrome s1(x) and the second syndrome s2(x) when the initial syndrome s(x) is gotten, which will not cause any decoding latency (and which will be small, if there is any). Then a flag indicating whether the data frame is correctable can be send out while the head of the data frame is send out.
The method 208 may also comprise step S208, in which the burst error in the data frame is processed and the processed data frame is outputted based on the determined error correctability. For example, in response to determining that burst error contained in the data frame is correctable, the error is processed and the processed data frame is outputted. In response to determining that burst error contained in the data frame is uncorrectable, a flag indicating that the burst error contained in the data frame is uncorrectable is added to the head of the data frame, and the processed data frame is outputted.
The method 208 may also comprise step S206, in which error pattern of the burst error contained in the data frame is determined based on the initial syndrome computed at step S202. Since the initial syndrome is already gotten, now the relationship between the initial syndrome and the error pattern will be explained, such that the error pattern can be determined based on the initial syndrome computed at step S202.
Let t(x) be the transmitted code word and r(x)=t(x)+xze(x) be the received word which is corrupted by an error e(x) starting at the zth bit of t(x). Here, e(x) is a degree m−1 polynomial representing an m-bit burst error pattern. Let s(x) be the initial syndrome generated by r(x). Then, the relationship between s(x) and error pattern is as below:
s(x)=r(x)mod g(x)={t(x)+e(x)} mod g(x)=e(x) mod g(x)
the matrix theory representation of above is:
s(x)=Tz·e(x).
T is a nonsingular matrix, the error pattern e(x) is simply given by
e(x)=T−z·s(x)
Thus e0(x)=e(x)=s(x), e1(x)=T−1·s(x)=T−1e(x) and so on, the general form will be ei+1(x)=T−1·ei(x).
Below will describe steps of computing error pattern after describing the relationship between s(x) and e(x).
where gi is the coefficient of generation polynomial g(x). T is a 32*32 matrix. Since the generation polynomial g(x) is known in advance, T and Ti can be pre-calculated.
In one example, processing the burst error in the data frame may comprise processing the burst error in the data frame based on the determined error correctability and error pattern.
In an example, at step S208, the burst error in the data frame is processed based on the determined error correctability and error pattern, and the processed data frame is outputted.
The processing may comprise: in response to determining that burst error contained in the data frame is correctable, the data frame is corrected based on the error pattern e(x) determined at step S206, and the processed data frame is outputted. For example, XOR operations is performed on the received code word r(x) with the error pattern e(x), thereby, the burst error is corrected.
The processing may also comprise: in response to determining that burst error contained in the data frame is uncorrectable, a flag indicating that the burst error contained in the data frame is uncorrectable is added to the head of the data frame, and the processed data frame is outputted with the flag. In an example, if it is determined that the current frame is uncorrectable, the head of the data frame is modified, for example, by adding a flag indicating that the burst error is uncorrectable, such that the upper layer will know that the ongoing frame is corrupted, and take corresponding reactions, such as discard said frame or request for retransmission.
With the decoding method of the present invention, two module operations can be performed to obtain the first syndrome s1(x) and second syndrome s2(x), on the basis of the obtained initial syndrome s(x). Then a predetermined rule may be applied to determine whether the burst error contained in the data frame is correctable. Moreover, error pattern can be determined by using matrix multiplication, when the initial syndrome s(x) is gotten, thus, a flag indicating whether the data frame is correctable can be send out while the head of the data frame is send out.
It should be noted that for shorted cyclic codes, carefulness need be taken for fake error which is introduced due to crossing boundary of a shorten frame. Take IEEE 802.3ap standard as an example, as shown in
In order to solve the above problem, when the cyclic codes is a shorten cyclic codes, the error correctability determined with the predetermined rule is defined as a first error correctability, and the method 200 further comprises: judging whether the burst error occurs at boundary of the shorten frame of the shorten cyclic codes based on location of the burst error in the data frame; in response to judging that the burst error occurs at boundary of the shorten frame of the shorten cyclic codes, determining a second error correctability; and determining the error correctability of the burst error contained in the data frame based on the determined first and second error correctability.
In the above steps, determining the first and second error correctability can be performed in parallel, and when either of the first and second error correctability is determined as uncorrectable, it is determined that burst error in the data frame is uncorrectable. Alternatively, the first error correctability can be determined first, and in response to the first error correctability is uncorrectable, it is determined that burst error in the data frame is uncorrectable; and in response to the first error correctability is correctable, then the second error correctability is determined, and it is determined that burst error contained in the data frame is correctable or uncorrectable based on whether the second error correctability is correctable or uncorrectable respectively.
Where locations of the burst error in the data frame can be determined based on the error pattern determined at step S206. In particular, it is judged whether there are fakes errors at boundary of the shorten frame based on the valid error pattern determined in first several computations of the error pattern determining.
Fake errors may only exist at several limited locations, for example boundary of the shorten frame. Thus, the second error correctability can be determined by using the valid error pattern determined in first several computations of the error pattern determining, thus, the above steps will not result in much additional computations, and thus, will not result a large additional decoding latency. For example, when the data width is 32 bits, the second error correctability and thus a fake error can be determined by using the valid error pattern determined for the first 32 bits.
Given the above, it can be seen that for shorten cyclic codes, it can determine whether the burst error contained in the data frame is correctable based on the first and second error correctability after the initial syndrome is gotten. However, it will not result in many additional complex computations and a large decoding latency when compared with non-shorten cyclic codes.
Given the above, both for cyclic codes and shorten cyclic codes, the error correctability of burst error contained in a data frame can be determined with a small amount of computations and a small decoding latency. Thus, a flag indicating whether the burst error contained in the data frame is correctable can be send out while the head of the data frame is send out. Thus, with the decoding method of the present invention, the error correctability of burst error contained in a data frame can be determined before the data frame is send out, and the decoding latency is also smaller.
In an example, the error correctability determining unit 504 comprises: a first syndrome computing sub-unit 503, configured for computing a first syndrome with an error pattern polynomial based on the initial syndrome computed by the initial syndrome computing unit 502; a second syndrome computing sub-unit 505, configured for computing a second syndrome with an error location polynomial based on the initial syndrome computed by the initial syndrome computing unit 502, wherein the error pattern polynomial and the error location polynomial are associated with generation polynomial of the cyclic codes; and an error correctability determining sub-unit 507, configured for determining error correctability of the burst error contained in the data frame with a predetermined rule based on the first syndrome computed by the first syndrome computing sub-unit 503 and the second syndrome computed by the second syndrome computing sub-unit 505.
In an example, the first syndrome computing sub-unit 503 comprises: a unit configured for dividing the initial syndrome computed by the initial syndrome computing unit 502 by the error pattern polynomial, and a unit configured for determining the remaining polynomial as the first syndrome. In an example, the unit configured for dividing the initial syndrome computed by the initial syndrome computing unit 502 by the error pattern polynomial comprises: a unit configured for performing shift operation on terms in the initial syndrome computed by the initial syndrome computing unit 502 with order higher than the highest order in the error pattern polynomial; and a unit configured for performing subtract operation on results of the shift operation and terms in the initial syndrome with order not higher than the highest order of the error pattern polynomial.
In an example, the second syndrome computing sub-unit 505 comprises: a unit configured for dividing the initial syndrome computed by the initial syndrome computing unit 502 by the error location polynomial, and a unit configured for determining the remaining polynomial as the second syndrome. In an example, the unit configured for dividing the initial syndrome computed by the initial syndrome computing unit 502 by the error location polynomial comprises: a unit configured for performing shift operation on terms in the initial syndrome computed by the initial syndrome computing unit 502 with order higher than the highest order in the error location polynomial; and a unit configured for performing subtract operation on results of the shift operation and items in the initial syndrome with order not higher than the highest order of the error location polynomial.
In an example, the decoding apparatus 500 further comprises an error pattern determining unit 506, configured for determining error pattern of the burst error contained in the data frame based on the computed initial syndrome. In an example, processing the burst error in the data frame comprises processing the burst error in the data frame based on the error correctability determined by the error correctability determining unit 504 and the error pattern determined by the error pattern determining unit 506.
In an example, when the cyclic codes is shorten cyclic codes, the error correctability determined with the predetermined rule is defined as a first error correctability, and the error correctability determining unit 504 further comprises: a burst error location judging unit, configured for judging whether the burst error occurs at boundary of the shorten frame of the shorten cyclic codes based on location of the burst error in the data frame; a second error correctability determining unit, configured for in response to judging that the burst error occurs at boundary of the shorten frame of the shorten cyclic codes, determining a second error correctability; and an error correctability executing unit, configured for determining error correctability of the burst error contained in the data frame based on the determined first and second error correctability. However, it will not result in many additional complex computations and a large additional decoding latency when compared with non-shorten cyclic codes.
Given the above, both in the case of cyclic codes and shorten cyclic codes, the error correctability of burst error contained in data frame can be determined with a small amount of computations and a small decoding latency. Thus, a flag indicating whether the data frame is correctable can be send out while the head of the data frame is send out. Thus, with the decoding apparatus of the present invention, the error correctability of burst error contained in a data frame can be determined before the data frame is send out, and the decoding latency is also smaller.
The operations of apparatus 500 are same with those of the method 200 described with respect to
It is appreciated that in an embodiment, steps of the method 200 in
According to another aspect of the present invention, burst errors can be corrected mainly by hardware, such as by using application specific integrated circuit (ASIC). Thus, the embodiments of the present invention also provide a decoder for correcting burst errors.
The data buffer 601 can be implemented with any appropriate existing technology and thus, its internal structure will be not be detained herein. In the present example, the size of the data buffer 601 is equal to the length of one data frame, i.e., n bits.
The decoder 600 may further comprise an error pattern determining circuit 606, configured for determining error pattern of the burst error contained in the data frame based on the initial syndrome computed by the initial syndrome computing circuit 602.
In an example, the error processing circuit 608 is further configured for processing the burst error in the data frame based on the error correctability determined by the error correctability circuit 604 and the error pattern determined by the error pattern determining circuit 606.
In an example, the first syndrome computing circuit 703 is further configured for: dividing the initial syndrome computed by the initial syndrome computing circuit 602 by the error pattern polynomial through using the one or more multiplexers and XOR gate, and determining the remaining polynomial as the first syndrome. In an example, dividing the initial syndrome computed by the initial syndrome computing circuit 602 by the error pattern polynomial comprises: performing shift operation on terms in the initial syndrome computed by the initial syndrome computing circuit 602 with order higher than the highest order in the error pattern polynomial through using the multiplexer; and performing subtract operation on results of the shift operation and terms in the initial syndrome with order not higher than the highest order of the error pattern polynomial through using the XOR gate.
In an example, the second syndrome computing circuit 705 is further configured for: dividing the initial syndrome computed by the initial syndrome computing circuit 602 by the error location polynomial through using the one or more multiplexers and XOR gate; and determining the remaining polynomial as the second syndrome. In an example, dividing the initial syndrome computed by the initial syndrome computing circuit 602 by the error location polynomial comprises: performing shift operation on terms in the initial syndrome computed by the initial syndrome computing circuit 602 with order higher than the highest order in the error location polynomial through using the one or more multiplexers; and performing subtract operation on results of the shift operation and items in the initial syndrome with order not higher than the highest order of the error location polynomial through using the XOR gate.
Below, IEEE 802.3ap will be taken as an example to describe a first syndrome computing circuit and a second syndrome computing circuit according to an embodiment of the present invention with respect to
In
The concrete operations used to implement the above computations will be described with respect to the circuit shown in
First, terms in s(x) with the order equal and higher than 21 will be used as gate signal of the 11 multiplexers respectively. Take the term x31 as an example, when x31 exists in s(x), the corresponding multiplexers will choose a 21 bits signal with the 10th bit being 1, while the other bits being 0 as its output. When x31 does not exist in s(x), the corresponding multiplexers will choose a 21 bits signal with all 0 as its output. For the other terms x30˜x21, there are similar computations.
Then the outputs of the multiplexers (all are 21 bits data) are inputted to respective inputs of the XOR gate, and the additional input of the XOR gate is the terms in s(x) with order less than 21, i.e., x20˜1, which is also a 21 bits data. Finally, the XOR gate performs XOR operations on the respective inputs, and thus, a first syndrome s1(x) is gotten.
It should be noted that the operations are performed for terms in s(x) with order larger than 20 (i.e., x31˜x21) in parallel in the above, that is, 11 (i.e. L) multiplexers are used, such that the first syndrome s1(x) is gotten. However, those skilled in the art will appreciate that other number of multiplexers can be used, for example one multiplexer. In such a case, operations are performed for terms in s(x) with order larger than 20 one by one. Then after 11 (i.e. L) times of operations, the final results (the first syndrome s1(x)) will be obtained. The circuit structure in such a case is similar with that as shown in
Similarly, the circuits shown in
After similar processing of the third time, the remainder of s(x) modulo (x11+x2+1) can be calculated, which is the second syndrome s2(x).
It should be noted that the operations are performed for terms in s(x) with order larger than 22 (i.e., x31˜x23) in parallel in the above, that is, 9 (i.e. L−2) multiplexers are used, such that the second syndrome s2(x) is gotten. However, those skilled in the art will appreciate that other number of multiplexers can be used, for example, one multiplexer. In such a case, operations are performed for terms in s(x) with order larger than 2L one by one. Then after 9 (i.e. L−2) times of operations, the final results will be obtained, that is, the second syndrome s2(x). The circuit structure in such a case is similar with that in
The above is described by taking IEE 802.3ap as an example, that is with its generation polynomial g(x)=(x21+1)(x21+x2+1). However, those skilled in the art will appreciate that similar methods can be used for the general from of the generation polynomial g(x)=(x2L−1+1)p(x).
After obtaining the first syndrome s1(x) and the second syndrome s2(x) by using the first syndrome computing circuit 703 and the second syndrome computing circuit 705, a zero detect circuit 707 can be used to determine error correctability of bust error according to a predetermined rule.
If it is determined by the zero detect circuit 707 that s1(x)=0 and s2(x)=0, it shows that no error is detected with the received code word r(x), thereby outputting a flag indicating that no error is detected.
If it is determined by the zero detect circuit 707 that s1(x)=0 and s2(x)≠0, or s1(x)≠0 and s2(x)=0, it shows that burst error is detected and the burst error is uncorrectable, thereby outputting a flag indicating the burst error is detected, and the burst error is uncorrectable.
If it is determined by the zero detect circuit 707 that s1(x)≠0 and s2(x)≠0, then it is determined whether the successive 0 in s1(x) is less or equal to L−1 at first, if yes, it shows that the burst error is uncorrectable, and thereby outputting a flag indicating that the burst error is uncorrectable; otherwise, it shows that the burst error is correctable, and thereby outputting a flag indicating the burst error is correctable. It should be noted that when determining whether the successive 0s in s1(x) is less or equal to L−1, it might be required to perform cyclic shift operations on the first syndrome s1(x), and determine whether the successive 0s in shifted s1(x) is less or equal to L−1. Since the highest order in s1(x) is 2L−1, 2L−2 shift operations are needed at most.
From the above, it can be seen that with the decoder of the present invention, two module operations and 2L−2 shift operations are need to determine the error correctability of the burst error.
Given the above, with the decoder of the present invention, two module operations can be performed to obtain the first syndrome and second syndrome, thus determining whether the burst error contained in the data frame is correctable with a predetermined rule. Where the module operation of the first syndrome is implemented by using L2−1 multiplexers and one XOR gate, and the module operation of the second syndrome is implemented by using L−22−1 multiplexers and one XOR gate. It can be seen that the scheme of the decoder according to the present invention is simple and has smaller decoding latency.
The concrete implementation of the first and second syndrome computing circuits are shown in
Those skilled in the art will appreciate that when using multiplexers and XOR gate to implement the module operation, the number and connections of the multiplexers and XOR gate are not limited to those as shown in
First, candidate error patterns are computed based on the equation ei+1(x)=T−1·ei(x), wherein the initial value of ei(x) is the computed initial syndrome s(x) of the data frame; i equals to integral times of the data width w, such as 1, w, 2w . . . ; the data width w is determined by the lower and upper levels. For example, w can be 16, 32, 64, etc.
Next, the obtained candidate error patterns ei(x), ei+1(x), . . . , ei+w−1(x) are send to a threshold detect circuit. The threshold detect circuit determines whether there is an e(x) in the candidate error patterns which has at least 2L−1 successive 0s.
If there is such a candidate error pattern, said candidate error pattern will be determined as the error pattern of the data frame and the iteration will be stopped.
Otherwise, if there is not such as a candidate error pattern, then ei+w(x) will be feed back to the input and the above steps will be repeated, until a valid error pattern e(x) is found.
Thus, it can be seen that with the present invention, the error pattern can be determined by multiplication of matrix. Those skilled in the art will appreciate that in combination logic, multiplication on GF (2) can be implemented by XOR gate. Thus the implementation is convenient.
Thus, with the decoder of the present invention, error correctability and error pattern of burst error contained in data frame can be determined by using initial syndrome of the data frame, such that a flag indicating whether the data frame is correctable can be send out while the head of the data frame is send out. With the decoder of the present invention, the overall decoding latency can be controlled to be a slightly larger than one frame latency.
The above is applicable to non-shorten cyclic codes. For shorten cyclic codes, the error correctability determined by the zero detect circuit 707 with the predetermined rule is defined as a first error correctability, and the decoder 600 also comprises a fake error elimination circuit 609, configured for: judging whether the burst error occurs at boundary of the shorten frame of the shorten cyclic codes based on location of the burst error in the data frame; in response to judging that the burst error occurs at boundary of the shorten frame of the shorten cyclic codes, determining a second error correctability; and determining the error correctability of the burst error contained in the data frame based on the determined first and second error correctability. However, it will not result in many additional complex computations and a large decoding latency when compared with non-shorten cyclic codes.
Given the above, both in the case of cyclic codes and shorten cyclic codes, error correctability of burst error contained in a data frame can be determined with a small amount of computations and a small decoding latency. Thus, a flag indicating whether the data frame is correctable can be send out while the head of the data frame is send out. That is, with the decoder of the present invention, the error correctability of burst error contained in the data frame can be determined before the data frame is send out, and the decoding latency is also smaller.
It should be noted that a data frame is comprised of data words, and that data width w of the data word can be determined by lower and upper levels. For example, data word can be 16, 32 or 64 bits in length. For example, for cyclic codes (i.e., data frame) with 2112 bits in length, it is comprised of 66 32-bits data words. In such an instance, i equals to integral times of the data width w, such as 0, 32, 64 . . . ; the data width w is determined by lower and upper levels, such as 16, 32 or 64 etc. j is natural number equal or larger than 1 and less than 66.
Based on the pipeline controls in
Table 1 as below shows the comparisons between the decoding scheme of the present invention and that of the prior art.
In table 1, n is the length of the data frame, L is the maximum length of the burst errors that the cyclic codes according to which the data frame is encoded can correct, and P is associated with the period of primitive polynomial p(x).
With the decoding method, decoding apparatus and decoder of the present invention, error correctability of burst error contained in a data frame can be determined before the data is send out, while having smaller decoding latency, through determining error correctability and error pattern of the burst error contained in the data frame using initial syndrome of the data frame.
The flowchart and block diagrams in the Figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The descriptions of the various embodiments of the present invention have been presented for purposes of illustration, but are not intended to be exhaustive or limited to the embodiments disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the described embodiments. The terminology used herein was chosen to best explain the principles of the embodiments, the practical application or technical improvement over technologies found in the marketplace, or to enable others of ordinary skill in the art to understand the embodiments disclosed herein.
| Number | Date | Country | Kind |
|---|---|---|---|
| 2013 1 0064254 | Feb 2013 | CN | national |
| Number | Name | Date | Kind |
|---|---|---|---|
| 640327 | Schaffer | Jan 1900 | A |
| 4059825 | Greene | Nov 1977 | A |
| 4782490 | Tenengolts | Nov 1988 | A |
| 5381423 | Turco et al. | Jan 1995 | A |
| 5691994 | Acosta et al. | Nov 1997 | A |
| 6427219 | Yang | Jul 2002 | B1 |
| 6640327 | Hallberg | Oct 2003 | B1 |
| 7127660 | Blaum | Oct 2006 | B2 |
| 7231579 | Pines et al. | Jun 2007 | B1 |
| 8136013 | Valliappan et al. | Mar 2012 | B2 |
| 8151165 | Belogolovy et al. | Apr 2012 | B2 |
| 8458560 | Nichols | Jun 2013 | B2 |
| 20020046382 | Yang | Apr 2002 | A1 |
| 20090049362 | Mudulodu et al. | Feb 2009 | A1 |
| 20090187808 | Nichols | Jul 2009 | A1 |
| 20140245104 | Song | Aug 2014 | A1 |
| Number | Date | Country |
|---|---|---|
| 101621299 | Jan 2010 | CN |
| 03104320 | Jan 1991 | JP |
| Number | Date | Country | |
|---|---|---|---|
| 20170134051 A1 | May 2017 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 14193272 | Feb 2014 | US |
| Child | 15412802 | US |
