Protected communication link with improved protection indication

Information

  • Patent Grant
  • 8001445
  • Patent Number
    8,001,445
  • Date Filed
    Monday, August 13, 2007
    18 years ago
  • Date Issued
    Tuesday, August 16, 2011
    14 years ago
Abstract
A method for communication includes receiving first and second data frames over first and second communication links, respectively, the first and second data frames containing respective first and second replicas of data, which has been encoded with a Forward Error Correction (FEC) code. The FEC code in the received first and second data frames is decoded, and respective first and second soft quality ranks of the first and second data frames are computed based on the decoded FEC code. One of the first and second replicas of the data are selected based on the first and second soft quality ranks. The selected one of the first and second replicas of the data is provided as output.
Description
FIELD OF THE INVENTION

The present invention relates generally to communication systems, and particularly to methods and systems for operating protected communication links.


BACKGROUND OF THE INVENTION

Some communication systems transmit and receive data over redundant communication links, in order to improve error performance and provide protection against equipment failures and adverse channel conditions. For example, U.S. Pat. No. 6,611,942, whose disclosure is incorporated herein by reference, describes a method of protecting the transmission of cells in a telecommunication system. On the transmitter side, two identical flows of cells are transmitted on two distinct physical links. Cells serving as markers, and thus delimiting blocks of cells or sets of blocks of cells, are inserted regularly into each of the flows at the transmitter. On the receiver side, the two flows of cells are received and the block or group of blocks from the flow having the fewer transmission errors is selected.


U.S. Pat. No. 5,631,896, whose disclosure is incorporated herein by reference, describes a path switching method without bit loss. The same digital line signals on a working path and on a protection path are continuously monitored independently for bit errors. If a bit error occurs in the working path and no bit error occurs in the protection path, a switching trigger is produced and a switching operation from the working path to the protection path is performed on a data block basis. Only correct data are transferred to downstream apparatuses. The method uses data blocks of one frame length with an indicator for bit error checking placed at the beginning or top of the block.


SUMMARY OF THE INVENTION

Embodiments of the present invention provide a method for communication, including:


receiving first and second data frames over first and second communication links, respectively, the first and second data frames containing respective first and second replicas of data, which has been encoded with a Forward Error Correction (FEC) code;


decoding the FEC code in the received first and second data frames;


computing respective first and second soft quality ranks of the first and second data frames based on the decoded FEC code;


selecting one of the first and second replicas of the data based on the first and second soft quality ranks; and


outputting the selected one of the first and second replicas of the data.


In some embodiments, the first communication link serves as a primary link, and the second communication link serves as backup to the primary link. In another embodiment, the data in the first and second data frames is further encoded with an error detection code, and computing the first and second soft quality ranks includes computing the ranks based on both the decoded FEC code and on the error detection code. The error detection code may include a Cyclic Redundancy Check (CRC). The FEC code may include a Reed Solomon code.


In a disclosed embodiment, selecting the one of the first and second replicas includes selecting the first replica when the first soft quality rank is better than the second soft quality rank, and selecting the second replica when the second soft quality rank is better than the first soft quality rank. In another embodiment, selecting the one of the first and second replicas includes changing a currently-selected replica when a respective soft quality rank of the currently selected replica violates a predetermined threshold.


In yet another embodiment, the first and second soft quality ranks are based on indications derived respectively from the first and second data frames, the indications including at least one indication type selected from a group of types consisting of successful/failed decoding of the FEC code, a number of errors present before decoding the FEC code and a number of bytes containing the errors present before decoding the FEC code.


In still another embodiment, computing the soft quality ranks and selecting the one of the first and second replicas include:


when at least one of the first and second replicas does not contain errors before decoding of the FEC code, selecting one of the replicas that does not contain errors; and


when both the first and the second replicas contain errors before decoding of the FEC code, selecting the one of the first and second replicas that is closer to a valid codeword of the FEC code.


In an embodiment, selecting the one of the first and second replicas that is closer to the valid codeword includes selecting the one of the first and second replicas having a smaller number of the errors. Additionally or alternatively, selecting the one of the first and second replicas that is closer to the valid codeword includes selecting the one of the first and second replicas having a smaller number of bytes containing the errors. In some embodiments, computing the soft quality ranks includes computing the ranks responsively to a comparison between inputs of first and second decoders that respectively decode the FEC code in the first and second data frames to respective outputs of the decoders.


There is additionally provided, in accordance with an embodiment of the present invention, a communication apparatus, including:


first and second receivers, which are arranged to receive first and second data frames over first and second communication links, respectively, the first and second data frames containing respective first and second replicas of data, which has been encoded with a Forward Error Correction (FEC) code, and to decode the FEC code in the received first and second data frames;


a multiplexer (MUX), which is operative to receive the first and second data frames from the first and second receivers and to select one of the first and second data frames, so as to provide a respective one of the first and second replicas of the data as output; and


a controller, which is coupled to compute respective first and second soft quality ranks of the first and second data frames based on the decoded FEC code, and to control the MUX to select the one of the first and second replicas of the data based on the first and second soft quality ranks.


There is further provided, in accordance with an embodiment of the present invention, a communication link, including:


a transmitter, which is arranged to encode data with a Forward Error Correction (FEC) code and to transmit first and second replicas of the encoded data in respective first and second data frames over first and second communication channels; and


a receiver, including:


first and second receiver channels, which are respectively arranged to receive the first and second data frames transmitted by the transmitter, and to decode the FEC code in the received first and second data frames;


a multiplexer (MUX), which is operative to receive the first and second data frames from the first and second receiver channels and to select one of the first and second data frames, so as to provide a respective one of the first and second replicas of the data as output; and


a controller, which is coupled to compute respective first and second soft quality ranks of the first and second data frames based on the decoded FEC code, and to control the MUX to select the one of the first and second replicas of the data based on the first and second soft quality ranks.


The present invention will be more fully understood from the following detailed description of the embodiments thereof, taken together with the drawings in which:





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 is a block diagram that schematically illustrates a protected communication link, in accordance with an embodiment of the present invention;



FIG. 2 is a diagram that schematically illustrates data frame processing in a receiver of a protected communication link, in accordance with an embodiment of the present invention;



FIG. 3 is a flow chart that schematically illustrates a method for operating a protected communication link, in accordance with an embodiment of the present invention; and



FIG. 4 is a flow chart that schematically illustrates a method for comparing data frame quality in a protected communication link, in accordance with an embodiment of the present invention.





DETAILED DESCRIPTION OF EMBODIMENTS
Overview

In some protected link configurations that use Forward Error Correction (FEC) codes, switching between the primary and secondary links is based on indications regarding the success or failure of decoding the FEC code. In many practical cases, however, these indications are often inaccurate or unreliable and may result in sub-optimal or even erroneous selection decisions. FEC code indications tend to be particularly undependable when the FEC code rate is high, when the links operate under difficult channel conditions and/or when multi-level FEC coding is used.


In view of the unreliability that is sometimes associated with FEC code indications, embodiments of the present invention provide improved methods and systems for switching between redundant links in protected link configurations. In the embodiments that are described hereinbelow, switching decisions are based on soft quality ranks that are related to the FEC code. The term “soft quality rank” is used to describe any rank or metric having a resolution or granularity that is finer than one bit, i.e., finer than a mere binary pass/fail indication. The soft quality ranks are typically represented by binary numbers having two or more bits.


In some embodiments, a transmitter transmits identical replicas of data to a receiver over primary and secondary communication links, in respective sequences of data frames. The data in each data frame is encoded with a FEC code. The two parallel sequences of data frames are received by the receiver, which decodes the FEC code. The receiver comprises a multiplexer (MUX), which is switched to select the data frames of one of the primary and secondary links, typically on a frame-by-frame basis. The data is extracted from the selected data frames and provided as output.


The MUX is controlled by a controller, which computes a soft quality rank for each data frame based on the decoding performance of the FEC code. For a given pair of parallel data frames (i.e., data frames received over the primary and secondary links carrying the same data), the controller compares the soft quality ranks of the two frames, and selects the data frame having the better soft quality rank. Several exemplary quality ranks and selection criteria are described further below.


In some embodiments, the data transmitted over the primary and secondary links is encoded with an error detection code, such as a Cyclic Redundancy Check (CRC), in addition to the FEC. As will be shown below, although the error detection code does not correct errors, it is often able to provide reliable quality indications even when the FEC code fails to do so. In these embodiments, the controller computes the soft quality ranks based on both the FEC and the error detection code. Note that allocating link resources (e.g., transmission time or bandwidth) to the error detection code usually comes at the expense of some performance degradation, since other link parameters (e.g., symbol rate or FEC code rate) are compromised. In most cases, however, this degradation is more than compensated for by the performance improvement caused by better switching decisions. The overall link performance is thus considerably improved.


Unlike known protection methods in which the selection between the primary and secondary links is based on a binary indication, e.g., on the presence or absence of errors, the methods and systems described herein can determine which of the two links perform better, even when both links contain errors. Thus, the disclosed quality ranks and selection methods improve the overall error performance of the protected link.


System Description


FIG. 1 is a block diagram that schematically illustrates a protected communication link 20, in accordance with an embodiment of the present invention. In the present example, link 20 comprises a point-to-point microwave or millimeter wave link. In alternative embodiments, link 20 may comprise any other suitable wireless link. In order to protect the data transmitted over the link, link 20 comprises a primary link and a secondary link, over which the data is transferred in parallel.


Link 20 comprises a dual transmitter 24, which transmits the data to a dual receiver 28. Data entering the dual transmitter is formatted and encapsulated in data frames by a framer 36. The data frames are provided in parallel to a primary transmitter 40 and a secondary transmitter 44. Each transmitter comprises a transmit (TX) modem 45, which encodes the data using a Forward Error Correction (FEC) code and an error detection code, and modulates the encoded data. Typically but not necessarily, the FEC code comprises a block code, and the data of each data frame corresponds to a single FEC block. The FEC code may comprise, for example, a Reed-Solomon (RS) code, a Low Density Parity Check (LDPC) code or any other suitable FEC code. The error detection code may comprise any suitable scheme that enables detection of errors, such as a Cyclic Redundancy Check (CRC) or various parity or checksum schemes.


In each of the primary and secondary transmitters, a transmitter front end (TX FE) 46 converts the modulated digital signal produced by the TX modem to an analog signal, and then filters and up-converts the signal to a suitable Radio Frequency (RF) and performs power amplification. The primary and secondary transmitters transmit the respective RF signals via transmit antennas 48 and 52, respectively.


The data transmitted by transmitters 40 and 44 is identical. Therefore, in alternative embodiments, dual transmitter 24 may comprise only a single TX modem 45, whose output is provided in parallel to two TX front ends 46 of the primary and secondary transmitters.


The signals transmitted by the primary and secondary transmitters respectively traverse primary and secondary wireless communication channels. The two channels differ from one another in frequency, polarization and/or antenna position. Since the two channels typically have different characteristics and conditions, poor channel conditions that may cause transmission errors are unlikely to be correlated between the channels. Thus, the two channels provide a certain amount of communication diversity and protection.


The signals transmitted over the primary and secondary channels are respectively received by receive antennas 56 and 60 and provided to a primary receiver 64 and a secondary receiver 68 in dual receiver 28. Receivers 64 and 68 process the received signals to reconstruct the transmitted data frames. Primary TX 40, antennas 48 and 56, and primary RX 64 are referred to as the primary link. Secondary TX 44, antennas 52 and 60, and secondary RX 68 are referred to as the secondary link.


Each of receivers 64 and 68 comprises a receiver front end (RX FE) 69, which down-converts, filters and digitizes the received RF signal. The RX FE may also perform functions such as gain control. The digital signal produced by the RX FE is provided to a receive (RX) modem 70, which demodulates the signal and decodes the FEC and error detection codes. The modem may also perform functions such as synchronization and carrier recovery.


Each of receivers 64 and 68 provides the reconstructed data frames to a multiplexer (MUX) 72, typically comprising a switch matrix. Thus, MUX 72 is provided with two parallel sequences of data frames, which were received over the primary and secondary links and carry the same data. The output of MUX 72 is de-formatted by a de-framer 76, which extracts the data from the data frames and provides the data as output. Thus, the setting of MUX 72 selects whether the data transmitted over the primary or the secondary link is to be used as output. Typically, MUX 72 comprises a high-speed switching matrix that is able to alternate between the primary and secondary receivers on a frame-by-frame basis.


Dual receiver 28 comprises a controller 80, which controls the operation of the receiver. In particular, controller 80 determines the appropriate setting of MUX 72, i.e., whether to use the data from the primary or secondary receiver, and controls MUX 72 accordingly. Controller 80 selects between the primary and secondary receivers based on indications related to the FEC code, and optionally to the error detection code, which are provided by RX modems 70 in the two receivers.


The frame-by-frame selection provides protection against failure in one of the links. Even when both links are operational, the selection enables the dual receiver to choose the link having the better performance (e.g., lower bit error rate), providing an overall improvement of performance. The switching operation is often hitless, i.e., performed without loss of data.


Typically, each RX modem 70 produces indications related to the progress, success and/or quality of decoding of the FEC and error detection codes per each received data frame. These indications are provided to controller 80. The controller computes a soft quality rank for each data frame, based on the indications provided by the modems. For a given pair of parallel data frames (i.e., a data frame received by the primary receiver and a data frame received by the secondary receiver carrying the same data), the controller compares the soft quality ranks of the two frames, and sets MUX 72 to select the data frame having the better rank. Several exemplary quality ranks and selection criteria are described further below.


In some embodiments, controller 80 selects the better-performing data frame on a frame-by-frame basis, i.e., regardless of the selection of previous frames. Alternatively, the controller may apply any other suitable logic based on the soft quality ranks. For example, in some embodiments a minimum threshold is defined for the soft quality rank. The controller selects the data frames of the primary link, as long as their quality ranks are higher than the threshold. When the quality ranks of the data frames of the primary link drop below the threshold, the controller switches MUX 72 to select the data frames of the secondary link, provided their quality ranks have higher values.


Note that the definition of the two links as primary and secondary may be arbitrary and may change with time. For example, at any given time, the link whose frames are currently selected can be regarded as being the primary link, and the other link defined as the secondary link and serves as backup. When controller 80 begins to select the frames of the other link, the link roles may be reversed.


Typically, controller 80 comprises a general-purpose processor, which is programmed in software to carry out the functions described herein. The software may be downloaded to the processor in electronic form, over a network or over link 20, for example, or it may alternatively be supplied to the processor on tangible media, such as CD-ROM.


Some additional aspects of protection switching, referring in particular to links having variable data rates, are described in U.S. patent application Ser. No. 11/634,781, filed Dec. 5, 2006, entitled “Data Rate Coordination in Protected Variable-Rate Links,” which is assigned to the assignee of the present patent application and whose disclosure is incorporated herein by reference.



FIG. 2 is a diagram that schematically illustrates data frame processing in receiver 28 of protected communication link 20, in accordance with an embodiment of the present invention. The figure shows data frames 90A . . . 90C, which are produced by the primary receiver, and data frames 94A . . . 94C, which are produced by the secondary receiver. Corresponding data frames in the two sequences (e.g., frames 90A and 94A, and frames 90B and 94B) carry the same data. Each data frame has a certain time interval (i.e., a certain number of symbols) allocated for data encoded using the FEC code, and another time interval allocated to CRC.


Controller 80 uses indications related to the decoding of the FEC code and the CRC in each frame in order to make frame-by-frame decisions whether to use the data frames provided by the primary receiver or the secondary receiver. The selected data frames are provided to de-framer 76, which extracts the data to produce an output sequence comprising output frames 98A . . . 98C. For example, when the quality rank of data frame 90A is better than the quality rank of data frame 94A, output frame 98A comprises the data of data frame 90A.


Switching Between Primary and Secondary Links Based on Soft Quality Ranks

It is possible in principle to compute the quality ranks of the data frames based only on binary, or pass/fail indications related to the decoding of the FEC code. For example, some Reed-Solomon (RS) decoders provide an “uncorrectable errors” indication when uncorrectable byte errors are present in the decoded block. Some iterative LDPC decoders provide a “parity satisfied” indication, which indicates whether the decoder was able to converge to a valid codeword. Some aspects of switching between the primary and secondary links based on metrics derived from FEC codes are described in U.S. patent application Ser. No. 11/483/078, filed Jul. 6, 2006, entitled “Communication Link Control using Iterative Code Metrics,” which is assigned to the assignee of the present patent application and whose disclosure is incorporated herein by reference.


In some systems and scenarios, however, binary FEC code indications may be inaccurate or unreliable and may result in sub-optimal or even erroneous selection decisions. For example, the FEC decoder in one of the receivers may output a valid but erroneous codeword. In such a case, the FEC decoder will typically indicate that the decoding was successful, but the decoded data will contain errors. Such binary FEC code indications are more likely to be undependable when the FEC code rate is high, when the Signal-to-Noise Ratio (SNR) is poor and/or when multi-level FEC coding is used.


In view of the difficulties associated with FEC code indications, embodiments of the present invention provide improved methods and systems for switching between redundant links in protected link configurations. In the embodiments that are described below, controller 80 computes soft quality ranks that are related to the FEC code. The soft quality ranks have a finer resolution and lower error probability in comparison with binary FEC code indication, and therefore provide better means for selection between the primary and secondary communication links.


In some embodiments, part of each data frame is reserved for an error detection code, which is often able to provide reliable quality indications even when the FEC code fails to do so. In these embodiments, controller 80 computes the soft quality rank of each data frame based on both the FEC code and the error detection code. Note that allocating link resources (e.g., time, bandwidth) to the CRC usually causes some performance degradation, since other link parameters (e.g., symbol rate or FEC code rate) are compromised. In most cases, however, this degradation is more than compensated for by the performance improvement caused by better switching decisions. The overall link performance is thus improved.



FIG. 3 is a flow chart that schematically illustrates a method for operating protected communication link 20, in accordance with an embodiment of the present invention. The method begins with dual transmitter 24 encoding the data using both FEC and error detection codes, at an encoding step 100. The primary and secondary transmitters transmit the data in respective sequences of data frames over the primary and secondary channels, at a transmission step 104. The primary and secondary receivers of dual receiver 28 receive and decode the signals transmitted over the primary and secondary channels, at a reception step 108, to produce two parallel sequences of data frames carrying the same data. Each of the primary and secondary RX modems produce indications related to the decoding of the FEC and error detection codes in each data frame.


Controller 80 of receiver 28 computes a soft quality rank for each data frame, based on the FEC and error detection code indications, at a rank computation step 112. Controller 80 controls MUX 72 to select the data frames from either the primary or the secondary link, at a switching step 116. The selection is typically performed in a hitless manner, frame-by-frame. The selected data frames are provided to de-framer 76, which extracts and outputs the data, at an output step 120.


Controller 80 can use any suitable indication of the FEC code, and possibly of the error detection codes, and any suitable logic based on these indications, for computing and comparing the soft quality ranks of the data frames.



FIG. 4 is a flow chart that schematically illustrates an exemplary method for comparing data frame qualities of two parallel data frames received from the primary and secondary receivers of link 20, in accordance with an embodiment of the present invention. The method of FIG. 4 can be used to carry out steps 112 and 116 of the method of FIG. 3 above.


The method begins with controller 20 examining the hard-decoded data, before performing FEC decoding, at a pre-decoding comparison step 130. In the present example, the bits in each data frame are divided into uncoded data bits and parity (redundancy) bits. The CRC or other error detection code is calculated over the uncoded bits in the data frame. For each of the two data frames, the controller checks whether the CRC of the uncoded bits in the frame is correct, i.e., whether the uncoded bits correspond to a valid codeword without the FEC code having to correct any errors, at a CRC checking step 134. In some embodiments, the controller checks whether the uncoded bits comprise a valid codeword directly, without evaluating the CRC. If the uncoded bits in one of the frames already comprise a valid codeword, the controller selects this frame, at a selection step 150, and the method terminates. If both frames comprise valid codewords, the controller may select any of the frames, such as maintain the MUX setting used in the previous frame.


If, on the other hand, neither frame comprises a valid codeword before FEC decoding, controller 80 selects the frame whose data is closer to a valid codeword in accordance with a certain distance metric. For example, some RS decoders provide indications as to the number of bytes that contain errors, and/or the number of bit errors corrected. The distance metric can be based on these indications. In an alternative embodiment, controller 80 can calculate the number of bit errors and/or number of error-containing bytes in a certain data frame by comparing the input and output of the FEC decoder.


In some embodiments, controller 80 checks the number of bytes containing errors in the two frames, at a byte checking step 138. If the number of bytes containing errors is not equal in the two data frames, as checked at a byte comparison step 142, the controller selects the data frame having a smaller number of error-containing bytes, at selection step 150.


If controller 80 concludes that the two data frames have the same number of bytes containing errors, the controller compares the number of bit errors in the two frames, at a bit error comparison step 146. The controller selects the frame having the fewest bit errors at selection step 150. If the number of bit errors is equal, the selection can be arbitrary according to convenience or based on any other condition. In an alternative embodiment, steps 138 and 142 above can be omitted. In other words, the controller can compare the number of bit errors without first comparing the number of error-containing bytes.


Although the embodiments described herein mainly address link configurations having a primary and a secondary link, the principles of the present invention can also be used for switching among any number of redundant links.


It will thus be appreciated that the embodiments described above are cited by way of example, and that the present invention is not limited to what has been particularly shown and described hereinabove. Rather, the scope of the present invention includes both combinations and sub-combinations of the various features described hereinabove, as well as variations and modifications thereof which would occur to persons skilled in the art upon reading the foregoing description and which are not disclosed in the prior art.

Claims
  • 1. A method for communication, comprising: receiving first and second data frames over first and second communication links, respectively, the first and second data frames containing respective first and second replicas of data, which has been encoded with a Forward Error Correction (FEC) code;decoding the FEC code in the received first and second data frames;computing respective first and second soft quality ranks of the first and second data frames based on the decoded FEC code;selecting one of the first and second replicas of the data based on the first and second soft quality ranks; andoutputting the selected one of the first and second replicas of the data,wherein computing the soft quality ranks and selecting the one of the first and second replicas comprise, when at least one of the first and second replicas does not contain errors before decoding of the FEC code, selecting one of the replicas that does not contain errors, and when both the first and the second replicas contain errors before decoding of the FEC code, selecting the one of the first and second replicas that is closer to a valid codeword of the FEC code.
  • 2. The method according to claim 1, wherein the first communication link serves as a primary link, and wherein the second communication link serves as backup to the primary link.
  • 3. The method according to claim 1, wherein the data in the first and second data frames is further encoded with an error detection code, and wherein computing the first and second soft quality ranks comprises computing the ranks based on both the decoded FEC code and on the error detection code.
  • 4. The method according to claim 3, wherein the error detection code comprises a Cyclic Redundancy Check (CRC).
  • 5. The method according to claim 1, wherein the FEC code comprises a Reed Solomon code.
  • 6. The method according to claim 1, wherein selecting the one of the first and second replicas comprises selecting the first replica when the first soft quality rank is better than the second soft quality rank, and selecting the second replica when the second soft quality rank is better than the first soft quality rank.
  • 7. The method according to claim 1, wherein selecting the one of the first and second replicas comprises changing a currently-selected replica when a respective soft quality rank of the currently selected replica violates a predetermined threshold.
  • 8. The method according to claim 1, wherein the first and second soft quality ranks are based on indications derived respectively from the first and second data frames, the indications comprising at least one indication type selected from a group of types consisting of successful/failed decoding of the FEC code, a number of errors present before decoding the FEC code and a number of bytes containing the errors present before decoding the FEC code.
  • 9. The method according to claim 1, wherein selecting the one of the first and second replicas that is closer to the valid codeword comprises selecting the one of the first and second replicas having a smaller number of the errors.
  • 10. The method according to claim 1, wherein selecting the one of the first and second replicas that is closer to the valid codeword comprises selecting the one of the first and second replicas having a smaller number of bytes containing the errors.
  • 11. The method according to claim 1, wherein computing the soft quality ranks comprises computing the ranks responsively to a comparison between inputs of first and second decoders that respectively decode the FEC code in the first and second data frames to respective outputs of the decoders.
  • 12. A communication apparatus, comprising: first and second receivers, which are arranged to receive first and second data frames over first and second communication links, respectively, the first and second data frames containing respective first and second replicas of data, which has been encoded with a Forward Error Correction (FEC) code, and to decode the FEC code in the received first and second data frames;a multiplexer (MUX), which is operative to receive the first and second data frames from the first and second receivers and to select one of the first and second data frames, so as to provide a respective one of the first and second replicas of the data as output; anda controller, which is coupled to compute respective first and second soft quality ranks of the first and second data frames based on the decoded FEC code, and to control the MUX to select the one of the first and second replicas of the data based on the first and second soft quality ranks,wherein the controller is coupled, when at least one of the first and second replicas does not contain errors before decoding of the FEC code, to select one of the replicas that does not contain errors, and when both the first and the second replicas contain errors before decoding of the FEC code, to select the one of the first and second replicas that is closer to a valid codeword of the FEC code.
  • 13. The apparatus according to claim 12, wherein the first communication link serves as a primary link, and wherein the second communication link serves as backup to the primary link.
  • 14. The apparatus according to claim 12, wherein the data in the first and second data frames is further encoded with an error detection code, and wherein the controller is coupled to compute the first and second soft quality ranks based on both the decoded FEC code and on the error detection code.
  • 15. The apparatus according to claim 14, wherein the error detection code comprises a Cyclic Redundancy Check (CRC).
  • 16. The apparatus according to claim 12, wherein the FEC code comprises a Reed Solomon code.
  • 17. The apparatus according to claim 12, wherein the controller is coupled to control the MUX to select the first replica when the first soft quality rank is better than the second soft quality rank, and to select the second replica when the second soft quality rank is better than the first soft quality rank.
  • 18. The apparatus according to claim 12, wherein the controller is coupled to control the MUX to change a currently-selected replica when a respective soft quality rank of the currently selected replica violates a predetermined threshold.
  • 19. The apparatus according to claim 12, wherein the first and second receivers are arranged to respectively derive from the first and second data frames indications comprising at least one indication type selected from a group of types consisting of successful/failed decoding of the FEC code, a number of errors present before decoding the FEC code and a number of bytes containing the errors present before decoding the FEC code, and wherein the controller is coupled to compute the first and second soft quality ranks based on the indications.
  • 20. The apparatus according to claim 12, wherein the controller is coupled to select the one of the first and second replicas that is closer to the valid codeword by selecting the one of the first and second replicas having a smaller number of the errors.
  • 21. The apparatus according to claim 12, wherein the controller is coupled to select the one of the first and second replicas that is closer to the valid codeword by selecting the one of the first and second replicas having a smaller number of bytes containing the errors.
  • 22. The apparatus according to claim 12, wherein the first and second receivers comprise respective decoders, which are arranged to decode the FEC code in the first and second data frames, and wherein the controller is coupled to compute the soft quality ranks based on a comparison between inputs of the decoders to respective outputs of the decoders.
  • 23. A communication link, comprising: a transmitter, which is arranged to encode data with a Forward Error Correction (FEC) code and to transmit first and second replicas of the encoded data in respective first and second data frames over first and second communication channels; anda receiver, comprising: first and second receiver channels, which are respectively arranged to receive the first and second data frames transmitted by the transmitter, and to decode the FEC code in the received first and second data frames;a multiplexer (MUX), which is operative to receive the first and second data frames from the first and second receiver channels and to select one of the first and second data frames, so as to provide a respective one of the first and second replicas of the data as output; anda controller, which is coupled to compute respective first and second soft quality ranks of the first and second data frames based on the decoded FEC code, and to control the MUX to select the one of the first and second replicas of the data based on the first and second soft quality ranks,wherein the controller is coupled, when at least one of the first and second replicas does not contain errors before decoding of the FEC code, to control the MUX to select one of the replicas that does not contain errors, and when both the first and the second replicas contain errors before decoding of the FEC code, to control the MUX to select the one of the first and second replicas that is closer to a valid codeword of the FEC code.
US Referenced Citations (170)
Number Name Date Kind
4288658 Bieber et al. Sep 1981 A
4291196 Spaniol et al. Sep 1981 A
4292465 Wilson et al. Sep 1981 A
4310813 Yuuki et al. Jan 1982 A
4321705 Namiki Mar 1982 A
4367555 Namiki et al. Jan 1983 A
4397022 Weng et al. Aug 1983 A
4438530 Steinberger Mar 1984 A
4479258 Namiki Oct 1984 A
4557330 Russell et al. Dec 1985 A
4575862 Tahara et al. Mar 1986 A
4606054 Amitay et al. Aug 1986 A
4627045 Olson et al. Dec 1986 A
4631734 Foschini Dec 1986 A
4644562 Kavehrad et al. Feb 1987 A
4688235 Tahara et al. Aug 1987 A
4761784 Srinivasagopalan et al. Aug 1988 A
4857858 Tahara Aug 1989 A
4910468 Ohtsuka et al. Mar 1990 A
4914676 Iwamatsu et al. Apr 1990 A
4992798 Nozue et al. Feb 1991 A
4995040 Best et al. Feb 1991 A
5023620 Matsuura Jun 1991 A
5068667 Mizoguchi Nov 1991 A
5075697 Koizumi et al. Dec 1991 A
5237318 Auclair et al. Aug 1993 A
5241320 Mizoguchi Aug 1993 A
5247541 Nakai Sep 1993 A
5268685 Fujiwara Dec 1993 A
5311545 Critchlow May 1994 A
5311546 Paik et al. May 1994 A
5313467 Varghese et al. May 1994 A
5383224 Mizoguchi Jan 1995 A
5406589 Iwamatsu et al. Apr 1995 A
5432522 Kurokami Jul 1995 A
5471508 Koslov Nov 1995 A
5495502 Andersen Feb 1996 A
5506956 Cohen Apr 1996 A
5524027 Huisken Jun 1996 A
5541955 Jacobsmeyer Jul 1996 A
5614914 Bolgiano et al. Mar 1997 A
5631896 Kawase et al. May 1997 A
5663990 Bolgiano et al. Sep 1997 A
5684810 Nakamura et al. Nov 1997 A
5694438 Wang et al. Dec 1997 A
5710799 Kobayashi Jan 1998 A
5727032 Jamal et al. Mar 1998 A
5742640 Haoui et al. Apr 1998 A
5742646 Woolley et al. Apr 1998 A
5809070 Krishnan et al. Sep 1998 A
5838224 Andrews Nov 1998 A
5838740 Kallman et al. Nov 1998 A
5844950 Aono et al. Dec 1998 A
5862186 Kumar Jan 1999 A
5901343 Lange May 1999 A
5905574 Vollbrecht et al. May 1999 A
5920595 Iwamatsu Jul 1999 A
5940453 Golden Aug 1999 A
5987060 Grenon et al. Nov 1999 A
6215827 Balachandran et al. Apr 2001 B1
6236263 Iwamatsu May 2001 B1
6252912 Salinger Jun 2001 B1
6262994 Dirschedl et al. Jul 2001 B1
6307505 Green Oct 2001 B1
6366568 Bolgiano et al. Apr 2002 B1
6418164 Endres et al. Jul 2002 B1
6452964 Yoshida Sep 2002 B1
6466562 Yoshida et al. Oct 2002 B1
6476643 Hugues et al. Nov 2002 B2
6490243 Tanaka et al. Dec 2002 B1
6501953 Braun et al. Dec 2002 B1
6611942 Battistello et al. Aug 2003 B1
6628707 Ratie et al. Sep 2003 B2
6647059 Faruque Nov 2003 B1
6665810 Sakai Dec 2003 B1
6678259 Schwengler Jan 2004 B1
6735168 Schnell et al. May 2004 B1
6763374 Levi et al. Jul 2004 B1
6826238 Ahn Nov 2004 B2
6829298 Abe et al. Dec 2004 B1
6836515 Kay et al. Dec 2004 B1
6836791 Levi et al. Dec 2004 B1
6842444 Bolgiano et al. Jan 2005 B2
6888794 Jovanovic et al. May 2005 B1
6915463 Vieregge et al. Jul 2005 B2
6920189 Spalink Jul 2005 B1
6954504 Tiedemann, Jr. et al. Oct 2005 B2
6993024 McDermott et al. Jan 2006 B1
7003042 Morelos-Zaragoza et al. Feb 2006 B2
7016296 Hartman, Jr. Mar 2006 B2
7046753 Resheff et al. May 2006 B2
7047029 Godwin et al. May 2006 B1
7127669 Platenberg et al. Oct 2006 B2
7133425 McClellan Nov 2006 B2
7133441 Barlev et al. Nov 2006 B1
7187719 Zhang Mar 2007 B2
7200188 Fague et al. Apr 2007 B2
7254190 Kwentus et al. Aug 2007 B2
7296063 Levi et al. Nov 2007 B2
7333556 Maltsev et al. Feb 2008 B2
7366091 Lahti et al. Apr 2008 B1
7415548 Mahany et al. Aug 2008 B2
7418240 Hsu et al. Aug 2008 B2
7460583 Khayrallah et al. Dec 2008 B2
7463867 Luo et al. Dec 2008 B2
7492701 Song et al. Feb 2009 B2
7630509 Zarrabizadeh Dec 2009 B2
7646881 Zarrabizadeh Jan 2010 B2
7653055 Guo et al. Jan 2010 B2
7770097 Platenberg et al. Aug 2010 B2
7839952 Sofer et al. Nov 2010 B2
20010017897 Ahn Aug 2001 A1
20020016933 Smith et al. Feb 2002 A1
20020051498 Thomas et al. May 2002 A1
20020061752 Kurokami May 2002 A1
20020161851 Chang Oct 2002 A1
20020181490 Frannhagen et al. Dec 2002 A1
20030021370 Menkhoff Jan 2003 A1
20030043778 Luschi et al. Mar 2003 A1
20030056158 Yue Mar 2003 A1
20030066082 Kliger et al. Apr 2003 A1
20030135532 Peting Jul 2003 A1
20030185319 Kolze Oct 2003 A1
20030203721 Berezdivin et al. Oct 2003 A1
20040017860 Liu Jan 2004 A1
20040063416 Kuenen et al. Apr 2004 A1
20040076240 Wang et al. Apr 2004 A1
20040081081 Colombo Apr 2004 A1
20040086668 Dronzek et al. May 2004 A1
20040151108 Blascoet et al. Aug 2004 A1
20040198296 Hui et al. Oct 2004 A1
20040217179 Garner Nov 2004 A1
20050002474 Limberg Jan 2005 A1
20050010853 Duvant et al. Jan 2005 A1
20050063496 Guillouard et al. Mar 2005 A1
20050075078 Makinen et al. Apr 2005 A1
20050123073 Ginesi et al. Jun 2005 A1
20050149844 Tran et al. Jul 2005 A1
20050169401 Abraham et al. Aug 2005 A1
20050190868 Khardekar et al. Sep 2005 A1
20050239398 Lai Oct 2005 A1
20050265436 Suh et al. Dec 2005 A1
20050286618 Abe Dec 2005 A1
20060008018 Kolze Jan 2006 A1
20060013181 Stoplman et al. Jan 2006 A1
20060056554 Lin et al. Mar 2006 A1
20060093058 Skraparlis May 2006 A1
20060107179 Shen et al. May 2006 A1
20060193400 Morris et al. Aug 2006 A1
20060203943 Scheim et al. Sep 2006 A1
20060209939 Mantha Sep 2006 A1
20070076719 Allan et al. Apr 2007 A1
20070116143 Bierke et al. May 2007 A1
20070116162 Eliaz et al. May 2007 A1
20070133397 Bianchi et al. Jun 2007 A1
20070153726 Bar-Sade et al. Jul 2007 A1
20070230641 Yehudai Oct 2007 A1
20080002581 Gorsetman et al. Jan 2008 A1
20080008257 Yonesi et al. Jan 2008 A1
20080037675 Lin et al. Feb 2008 A1
20080043829 Shiue et al. Feb 2008 A1
20080080634 Kotecha et al. Apr 2008 A1
20080130616 Wengerter et al. Jun 2008 A1
20080130726 Sofer et al. Jun 2008 A1
20080137779 Valadon Jun 2008 A1
20080155373 Friedman et al. Jun 2008 A1
20080254749 Ashkenazi et al. Oct 2008 A1
20080259901 Friedman et al. Oct 2008 A1
20090022239 Kimura et al. Jan 2009 A1
20090092208 Montekyo et al. Apr 2009 A1
Foreign Referenced Citations (25)
Number Date Country
0454249 Oct 1991 EP
1365519 Nov 2003 EP
6021762 Jan 1994 JP
9064791 Mar 1997 JP
2000115244 Apr 2000 JP
200161187 Mar 2001 JP
2001-217761 Aug 2001 JP
2002-9861 Jan 2002 JP
2002345023 Nov 2002 JP
2003068228 Mar 2003 JP
2004179821 Jun 2004 JP
2004179893 Jun 2004 JP
2005269530 Sep 2005 JP
2005333473 Dec 2005 JP
2007250050 Sep 2007 JP
2008033069 Feb 2008 JP
0060802 Oct 2000 WO
0077952 Dec 2000 WO
WO 0076114 Dec 2000 WO
0154339 Jul 2001 WO
2004086668 Oct 2004 WO
2005122414 Dec 2005 WO
2006097735 Sep 2006 WO
2006118892 Nov 2006 WO
2007040906 Apr 2007 WO
Related Publications (1)
Number Date Country
20090049361 A1 Feb 2009 US