CROSS REFERENCE TO RELATED APPLICATIONS 
       [0001]    This document is a divisional of U.S. patent application Ser. No. 13/269347 entitled “Method of Identifying A Correct Decoding Codeword” to Banister et al., which was filed Oct. 7, 2011, now pending, which is a continuation in part of U.S. patent application Ser. No. 12/729,027 entitled “Encoding and Decoding Systems and Related Methods” to Banister et al., which was filed on Mar. 22, 2010, and issued as U.S. Pat. No. 8,473,798 on Jun. 25, 2013, which application claims the benefit of the filing date of U.S. Provisional Patent Application 61/161,843, entitled “Encoding and Decoding Systems and Related Methods” to Banister et al., which was filed on Mar. 20, 2009, the disclosures of which are hereby incorporated entirely herein by reference. 
     
    
     BACKGROUND 
       [0002]    1. Technical Field 
         [0003]    Aspects of this document relate generally to systems and methods for transmitting data across a telecommunication channel. 
         [0004]    2. Background Art 
         [0005]    In a telecommunication system, an encoded codeword of a linear block code may be sent across a noisy channel, such as a wireless communication link or other connection. Bits of the codeword may be initially assigned values of either −1 or 1 when first placed in the channel. As the bits travel across the channel, noise in the channel can increase or weaken the magnitude of a particular sent bit. On the receiving side, once the noisy codeword is acquired by the decoder, the codeword may be called a received vector. The decoder&#39;s purpose is to examine the received vector and find the codeword that was originally sent. Finding the originally sent codeword may involve a Euclidean squared distance calculation or correlation between the received vector and a collection of candidate codewords. The candidate codeword that is the least square distance (Euclidean distance) from the received vector or possesses the largest correlation with the received vector is generally selected as the most likely codeword that was sent. 
       SUMMARY 
       [0006]    Implementations of a method of searching for candidate codewords for a telecommunications system may comprise receiving a sequence of constellation points, producing a received FEC vector comprised of bits from the received constellation points, comparing the received FEC vector with a plurality of candidate codewords within a Dorsch decoding process using an ordered pattern, and terminating the search when a candidate codeword from among the plurality of candidate codewords is found residing within a predetermined range of a specified distance of the received FEC vector. 
         [0007]    Particular implementations may comprise one or more of the following features. The method may further comprise ordering the plurality of candidate codewords according to a probability that each of the candidate codewords will occur within the predetermined range of the specified distance of the received point. The method may further comprise sorting the received FEC vector according to a probability of reliability of each bit position of the received FEC vector. The method may further comprise generating one or more candidate codewords among the plurality of candidate codewords by creating one or more perturbations to one or more first bits of a base codeword of a sorted received FEC vector. The method may further comprise classifying a magnitude of each bit position as a logarithmic likelihood ratio (LLR) that is calculated as a logarithm of a probability that one received bit position has one sent value divided by a probability that the one received bit has a value opposite the one sent value. The method may further comprise quantizing the bit positions having a highest magnitude into a fixed number of levels using a uniform integer scalar quantizer. 
         [0008]    Implementations of a method of searching for candidate codewords for a telecommunications system may comprise receiving one or more constellation points, mapping the received constellation points into a received FEC vector representing a point in an N-dimensional space determining whether a bit position in the codeword has a positive value or a negative value, determining whether a corresponding position element of the received FEC vector has a positive value or a negative value, comparing the bit position value with the corresponding position element value, re-mapping one or more position elements onto one or more planes of a hypercube surface, calculating a squared distance between the re-mapped received FEC vector and a candidate codeword, and terminating the search if the comparison of the values result indicates a confidence level of the one or more constellation points that is higher than a predetermined confidence threshold. 
         [0009]    Particular implementations may comprise one or more of the following features. The method may further comprise mapping one or more received FEC vector elements to a codeword at a center of a region comprised of points that are less than a fixed square distance from the codeword. 
         [0010]    Implementations of a method of searching for candidate codewords for a telecommunications system, may comprise removing a distance contribution of an element of an N-dimensional FEC vector from the N-dimensional vector when a comparison of values indicates that a bit position value and a corresponding position element value have a same sign and a magnitude of the FEC vector is greater than a value of one in a dimension and computing a distance from a candidate codeword by mapping the bit position in the codeword onto one or more planes of a hypercube surface wherein the hypercube surface contains codewords as vertices. 
         [0011]    Particular implementations may comprise one or more of the following features. The method may further comprise mapping one or more position elements of the N-dimensional FEC vector to a codeword at a center of a region comprised of points that are less than a fixed square distance from the codeword. 
         [0012]    Implementations of a method of searching for candidate codewords for a telecommunications system may comprise receiving a plurality of constellation points, producing a one or more received FEC vectors comprised of bits from the received constellation points, decoding the one or more received FEC vectors using a plurality of Dorsch decoders, comparing the one or more received FEC vectors with a plurality of candidate codewords within a Dorsch decoding process using an ordered pattern, releasing a best match codeword into an output buffer, and terminating the search when a codeword is found residing within a predetermined range of a specified distance of the one or more received FEC vectors. 
         [0013]    Particular implementations may comprise one or more of the following features. The one or more received FEC vectors may comprise a unique identifier indicating an order in which the one or more received FEC vectors is received by the plurality of Dorsch decoders. The method may further comprise recording, by an ordering device, an order in which the one or more received FEC vectors is received by the plurality of Dorsch decoders. The method may further comprise simultaneously decoding two or more received FEC vectors using two or more decoders of the plurality of Dorsch decoders. The method may further comprise releasing by the output buffer to a downstream receiver, best match codewords in an order in which the codewords were received. 
         [0014]    Implementations of a method of searching for candidate codewords for a telecommunications system may comprise receiving one or more constellation points, mapping the received constellation points into one or more received FEC vectors, each received FEC vector representing a point in an N-dimensional space, decoding the one or more received FEC vectors using a plurality of Dorsch decoders, determining whether a bit position in a candidate codeword has a positive value or a negative value, determining whether a corresponding position element of the one or more received FEC vectors has a positive value or a negative value, comparing the bit position value and the corresponding element position value, re-mapping one or more position elements onto one or more planes of a hypercube surface, calculating a squared distance between the re-mapped received FEC vector and the candidate codeword, and terminating the search if the bit position value and the corresponding element position value indicate a confidence level of the one or more constellation points that is higher than a predetermined confidence threshold. 
         [0015]    Particular implementations may comprise one or more of the following features. Each of the one or more received FEC vectors may comprise a unique identifier indicating an order in which the one or more FEC vectors is received by the plurality of Dorsch decoders. The method may further comprise recording, by an ordering device, an order in which the one or more FEC vectors is received by the plurality of Dorsch decoders. The method may further comprise simultaneously decoding two or more received FEC vectors using two or more decoders of the plurality of Dorsch decoders. The method may further comprise releasing by the output buffer to a downstream receiver, best match codewords in an order in which the codewords were received. 
         [0016]    Implementations of a method of searching for candidate codewords for a telecommunications system may comprise decoding one or more received FEC vectors using a plurality of Dorsch decoders, removing a distance contribution of a position element of an N-dimensional FEC vector from the N-dimensional FEC vector when a comparison of values indicates that a bit position value and a corresponding position element value have a same sign and a magnitude of the FEC vector is greater than a value of one in a dimension, and computing a distance from a candidate codeword by mapping the bit position in the codeword onto one or more planes of a hypercube surface wherein the hypercube surface contains codewords as vertices. 
         [0017]    Particular implementations may comprise one or more of the following features. Each of the one or more received FEC vectors may comprise a unique identifier indicating an order in which the FEC vectors are received by the plurality of Dorsch decoders. The method may further comprise recording, by an ordering device, an order in which the one or more FEC vectors is received by the plurality of Dorsch decoders. The method may further comprise simultaneously decoding two or more received FEC vectors using two or more decoders of the plurality of Dorsch decoders. The method may further comprise releasing by the output buffer to a downstream receiver, best match codewords in an order in which the codewords were received. 
         [0018]    Aspects and applications of the disclosure presented here are described below in the drawings and detailed description. Unless specifically noted, it is intended that the words and phrases in the specification and the claims be given their plain, ordinary, and accustomed meaning to those of ordinary skill in the applicable arts. The inventors are fully aware that they can be their own lexicographers if desired. The inventors expressly elect, as their own lexicographers, to use only the plain and ordinary meaning of terms in the specification and claims unless they clearly state otherwise and then further, expressly set forth the “special” definition of that term and explain how it differs from the plain and ordinary meaning Absent such clear statements of intent to apply a “special” definition, it is the inventors&#39; intent and desire that the simple, plain and ordinary meaning to the terms be applied to the interpretation of the specification and claims. 
         [0019]    The inventors are also aware of the normal precepts of English grammar. Thus, if a noun, term, or phrase is intended to be further characterized, specified, or narrowed in some way, then such noun, term, or phrase will expressly include additional adjectives, descriptive terms, or other modifiers in accordance with the normal precepts of English grammar. Absent the use of such adjectives, descriptive terms, or modifiers, it is the intent that such nouns, terms, or phrases be given their plain, and ordinary English meaning to those skilled in the applicable arts as set forth above. 
         [0020]    Further, the inventors are fully informed of the standards and application of the special provisions of 35 U.S.C. §112, ¶6. Thus, the use of the words “function,” “means” or “step” in the Description , Drawings, or Claims is not intended to somehow indicate a desire to invoke the special provisions of 35 U.S.C. §112, ¶6, to define the invention. To the contrary, if the provisions of 35 U.S.C. §112, ¶6 are sought to be invoked to define the claimed disclosure, the claims will specifically and expressly state the exact phrases “means for” or “step for, and will also recite the word “function” (i.e., will state “means for performing the function of [insert function]”), without also reciting in such phrases any structure, material or act in support of the function. Thus, even when the claims recite a “means for performing the function of . . . ” or “step for performing the function of . . . ,” if the claims also recite any structure, material or acts in support of that means or step, or that perform the recited function, then it is the clear intention of the inventors not to invoke the provisions of 35 U.S.C. §112, ¶6. Moreover, even if the provisions of 35 U.S.C. §112, ¶6 are invoked to define the claimed disclosure, it is intended that the disclosure not be limited only to the specific structure, material or acts that are described in the preferred embodiments, but in addition, include any and all structures, materials or acts that perform the claimed function as described in alternative embodiments or forms of the invention, or that are well known present or later-developed, equivalent structures, material or acts for performing the claimed function. 
         [0021]    The foregoing and other aspects, features, and advantages will be apparent to those artisans of ordinary skill in the art from the DESCRIPTION and DRAWINGS, and from the CLAIMS. 
     
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         [0022]    Implementations will hereinafter be described in conjunction with the appended drawings, where like designations denote like elements, and: 
           [0023]      FIG. 1  is a graphic illustration of a locus of points shaded in gray that are less than a fixed square distance from a codeword; 
           [0024]      FIG. 2  is a graphic illustration of a new locus of points that would be less than a fixed squared distance from the codeword, with the bad distance removed; 
           [0025]      FIG. 3  is a block diagram of a particular implementation of a decoder network that includes multiple decoders; and 
           [0026]      FIG. 4  is a block diagram of another particular implementation of a decoder network that utilizes a separate ordering unit to tabulate the order of the received vectors. 
       
    
    
     DESCRIPTION 
       [0027]    This disclosure, its aspects and implementations, are not limited to the specific components, frequency examples, or methods disclosed herein. Many additional components and assembly procedures known in the art consistent with encoding and decoding systems and methods are in use with particular implementations from this disclosure. Accordingly, for example, although particular implementations are disclosed, such implementations and implementing components may comprise any components, models, versions, quantities, and/or the like as is known in the art for such systems and implementing components, consistent with the intended operation. 
         [0028]    Implementations of a method of searching for candidate codewords in a Dorsch decoding process using an optimally ordered pattern are disclosed. A Dorsch decoder is unusual in that it is not necessary to know how to construct a decoder for a given code. The decoding is accomplished by using an encoder multiple times to iteratively search for the closest codeword to a received vector. Non-limiting examples of implementations of methods for terminating the search when a codeword is found residing within a specified distance of the received point are disclosed. In addition, various non-limiting examples of implementations of a method for selectively mapping the received point onto a one or more planes of one or more surfaces of a hypercube when computing the distance to a given candidate codeword are also disclosed. In implementations of encoding and decoding systems disclosed in this document and the appendix to the previously filed U.S. Provisional Patent Application No. 61/161,843, the disclosure of which was previously incorporated herein by reference, the various method and system implementations may serve to minimize the average number of codewords that will need to be evaluated during the decoding process, correspondingly impacting the speed (data rates) at which the decoder can be operated. Additionally, non-limiting examples of how multiple decoder instantiations can be interconnected to increase the overall throughput of the decoder are disclosed. 
         [0029]    In implementations of a method of searching for the candidate codewords in a Dorsch decoding process using an optimal pattern and in implementations of a method of terminating the search when a codeword is found residing within a specified distance of a received constellation point, the collection of candidate codewords to test with the received vector can be generated in an ordered manner such that the probability of each successive codeword occurring is monotonically decreasing. This process enables the most probable codewords for matching to be checked first. 
         [0030]    A codeword for an (n,k) linear block code will contain n bits, k of which can used to uniquely represent the original data that was to be sent (prior to being encoded into a codeword). These k bits can arbitrarily be copied to the first k bits of the encoded codeword, whereas the remaining n-k bits are parity bits, generated using the first k bits and an encoding process. When an encoded n-bit codeword is sent over a noisy channel, the magnitudes of each of the sent bit positions become either more or less confident. The received FEC vector can be sorted by the magnitude (or confidence) of each of its bit positions, with bits of the largest magnitude appearing first, and the bits with the least magnitude occurring last. In the sorted vector, the k most confident bits of the received FEC vector can now be treated as if they were the original user data that was sent and the n-k least confident bits can be treated as the parity bits during the candidate codeword generation and distance calculation and correlation process. 
         [0031]    The process of generating candidate codewords requires creating perturbations to the first k bits (user data) of the base codeword of the sorted received FEC vector and then using the perturbations in the comparison process. The sorted received FEC vector may have a base codeword, represented by each of the k most likely bit positions being mapped to a −1 if the bit position value is less than 0, and 1 otherwise. The remaining n-k bit positions are generated as if a codeword was being encoded with the first k bits, but with a modified generation method. In implementations of encoding and decoding methods disclosed in this document, implementations of the methods include steps that determine how to choose a collection of the first k bit positions to use during perturbation of the base codeword to enable generation of new candidate codewords. 
         [0032]    If the noise on the communication channel can be described as Additive White Gaussian Noise (although one having ordinary skill in the art would readily recognize that the noise may take any other form in various implementations), the magnitude of each of the received bit positions can be classified as an LLR (logarithmic likelihood ratio), describing the logarithm of the probability that one received bit position takes on one sent value versus the probability that the received position takes on the opposite value. The value of the LLR function monotonically increases for increasing received magnitudes. To introduce error patterns in a simple way, each of the k most reliable points in the received vector may be quantized to a fixed number of levels with a uniform integer scalar quantizer. Perturbation points may then be chosen if they are equal to a target LLR sum, or if any combination of the quantized points would reach that sum. A perturbation point may then have a hard decision value in the base codeword flipped and subsequently, a new codeword may be generated and tested using the perturbation point. If two points are included in a candidate codeword, the probability of both occurring simultaneously is described by the sum of each point&#39;s quantized magnitude. Accordingly, if the LLR sum starts at zero and increases by one only after all possible quantized magnitudes of the k most-reliable positions have been used to try to reach that sum, candidate codewords will be tried in decreasing order of probability of occurrence, to maximize the opportunity for a matching codeword to be found at the beginning of the evaluation. For the exemplary purposes of this disclosure, an example is provided illustrating a particular evaluation flow of selection of candidate codewords for a (7,4) Hamming code. In the example, the notation p1, p2, etc. represents a parity bit.
       Received Vector: [1.1, −1.8, 0.4, −0.3, 1, 0.4 , −1.1]   Quantized Received Vector: [11, −18, 4, 3, 10, 4, −11]   Sorted Quantized Received Vector: [−18, 11, −11, 10, 4, 4, 3]   Base Codeword: [−1, 1, −1, 1, p1, p2, p3]       
 
         [0037]    The first k magnitudes of the sorted quantized received vector that are used to form the LLR sum: [18, 11, 11, 10]. 
         [0038]    Evaluation of Target LLR for the following sum values:
       1-9:       
 
         [0040]    No perturbations can be made at these levels (1-9) since the sum is below any of the possible magnitudes.
       10:       
 
         [0042]    A single sum can be formed by using item 4 of the first k magnitudes in the perturbation. Thus the candidate codeword [−1, 1, −1, −1, p1, p2, p3] should be checked, where p1,p2,p3 are parity bits generated using the modified codeword generation method.
       11:       
 
         [0044]    Two different sums can be formed using either item 2 or item 3 of the first k magnitudes in the perturbation. Candidate codewords [−1, −1, −1, 1, p1, p2, p3] and [−1, 1, 1, 1, p1, p2, p3] are equally probable.
       12-17:       
 
         [0046]    No perturbations can be made at these levels (12-17) since no components can be combined to form these sums.
       18:       
 
         [0048]    A single sum can be formed by using item 1 of the first k magnitudes in the perturbation. Thus the candidate codeword [1, 1, −1, 1, p1, p2, p3] should be checked.
       19-20:       
 
         [0050]    No perturbations can be made at these levels (19-20) since no components can be combined to form these sums.
       21:       
 
         [0052]    Two different sums can be formed using item 4 and either items 2 or 3 of the first k magnitudes in the perturbation. The candidate codewords [−1, 1, 1, −1, p1, p2, p3] and [−1, −1, −1, −1, p1, p2, p3] are equally probable.
       22:       
 
         [0054]    A single sum at this level (22) can be formed using items 2 and 3 of the first k magnitudes in the perturbation forming the candidate codeword [−1, −1, 1, 1, p1, p2, p3]. 
         [0055]    The foregoing evaluation process may be continued until all possible candidate codewords have been generated or a fixed number of candidate codewords have been generated. If a candidate codeword is within a fixed squared distance of the received FEC vector, it can be deemed to be the codeword that was sent across the channel and no further codewords need to be tested or generated. 
         [0056]    In implementations of a method for selectively mapping the received point onto a hypercube when computing the distance to a given candidate codeword, when a squared distance calculation is made between a received vector, r, and candidate codeword, c, a bit position (dimension) in the codeword, may have the same sign as the corresponding position (dimension), in the received vector r. If both points agree in sign for a given dimension, and the magnitude of r in that dimension is greater than 1, there is a distance contribution that may be referred to as being ‘bad’ in that dimension. This overly confident position is good for a correlation measurement between the two vectors but is undesirable for a squared distance calculation because the distance is contributed from a dimension that has a high probability of being correct. 
         [0057]    In implementations of the method, the bad distance is not included if the sign of a received bit position matches the sign of the same bit position in the prospective codeword and the magnitude of the received bit position is greater than 1. This effectively maps bit positions made extra confident by noise back onto a hyper-cube containing codewords as vertices when computing the distance from the candidate codeword.  FIG. 1  shows a locus of points shaded in gray  100  that are less than a fixed square distance from a codeword. Any received point in a gray region  100  maps to the codeword at the center of the region  110 .  FIG. 2  shows a new locus of points  200  that would be less than a fixed squared distance from the codeword, with the bad distance removed. Comparing  FIG. 1  to  FIG. 2 , it is observed that  FIG. 2  includes significantly more area than  FIG. 1 , permitting a candidate codeword to be deemed the codeword that was sent across the channel for significantly more received vectors. Moreover, there is no corresponding increase in the probability of falsely declaring a candidate codeword as the correct codeword when terminating the search process. 
         [0058]    In implementations of a method of placing decoders like those disclosed in this document and in the appendix of U.S. Provisional Application No. 61/161,843 in an interconnected network, the overall decoding speed of a stream of received vectors may be increased. In an interconnected network, any individual decoder implementing the methods described in this document may be assigned any received FEC vector  300 . Each decoder  310  will decode the assigned received FEC vector  300 , and signal that decoding is complete, releasing the best match codeword into an output buffer  320 . The output buffer  320 , which can be of any size, may release best match codewords in the order they were originally received to a downstream receiver. The array of decoders  320  may permit one received FEC vector  300  to be worked on for an extended period of time, while still allowing other codewords to be simultaneously decoded. For exemplary purposes,  FIG. 3  is provided to show how a particular implementation of a decoder network that includes multiple decoders  310  arranged to increase decoding speeds. As illustrated in the diagram, the decoders  310  keep track of a unique identifier for each received vector which allows each vector to be identified in the order it was received.  FIG. 4  illustrates another implementation of a decoder network that utilizes a separate ordering unit to tabulate the order of the received vectors  300 . Any of a wide variety of arrangements is possible. 
         [0059]    Implementations of encoding and decoding systems and related methods may reduce the average number of codewords that will need to be evaluated during the decoding process, reduce the average number of codewords evaluated while not substantially increasing the risk of error despite significantly more received vectors possibly being deemed the codeword that was sent across the telecommunications channel without increasing the probability of a false identification, and significantly increase the speed at which the stream can be processed due to multiple decoders decoding a stream of received vectors. 
         [0060]    The materials used for implementations of encoding and decoding systems may be made of conventional materials used to make goods similar to these in the art, such as, by non-limiting example, plastic, metals, semiconductor materials, and composites. Those of ordinary skill in the art will readily be able to select appropriate materials and manufacture these products from the disclosures provided herein. 
         [0061]    The implementations listed here, and many others, will become readily apparent from this disclosure. From this, those of ordinary skill in the art will readily understand the versatility with which this disclosure may be applied.
A method of searching for candidate codewords for a telecommunications system, the method comprising receiving a sequence of constellation points, producing a received FEC vector comprised of bits from the received constellation points, comparing the received FEC vector with a plurality of candidate codewords within a Dorsch decoding process using an ordered pattern, and terminating the search when a candidate codeword from among the plurality of candidate codewords is found residing within a predetermined range of a specified distance of the received FEC vector.