H03M13/01

Virtual network pre-arbitration for deadlock avoidance and enhanced performance

A device includes a data path, a first interface configured to receive a first memory access request from a first peripheral device, and a second interface configured to receive a second memory access request from a second peripheral device. The device further includes an arbiter circuit configured to, in a first clock cycle, a pre-arbitration winner between a first memory access request and a second memory access request based on a first number of credits allocated to a first destination device and a second number of credits allocated to a second destination device. The arbiter circuit is further configured to, in a second clock cycle select a final arbitration winner from among the pre-arbitration winner and a subsequent memory access request based on a comparison of a priority of the pre-arbitration winner and a priority of the subsequent memory access request.

Techniques For Link Partner Error Reporting

Computing devices and techniques for providing link partner health reporting are described. In one embodiment, for example, an apparatus may include at least one memory, and logic, at least a portion of the logic comprised in hardware coupled to the at least one memory, the logic to determine a plurality of error counters, each of the plurality of error counters associated with a number of errors, determine the number of errors for each data unit of a plurality of data units associated with a data block, increment each of the plurality of error counters corresponding with the number of errors for each data unit of the plurality of data units, provide a plurality of error counts for the data block to a link partner, the plurality of error counts corresponding to the number of errors accumulated in each of the plurality of error counters for the data block, and reset the plurality of error counters. Other embodiments are described and claimed.

Dynamic detection for flash memory

A method of decoding data stored in non-volatile memory in which each memory cell stores data by adopting one of a plurality of storage states. The method comprises using a threshold for determining a physical property of the memory cells to distinguish between at least two storage states, reading a data codeword from a plurality of the memory cells using the threshold and determining a bit error rate for the data codeword read using the threshold, repeatedly modifying said threshold and re-reading said data codeword using said modified threshold and determining a modified bit error rate for the data codeword read using the modified threshold, selecting the one of the modified thresholds for which the mutual information content between the stored data input and the read data is maximised based on the bit error rate for the data codeword read using the threshold and the bit error rate for the data codeword read using the modified threshold, determining a log likelihood ratio of a quantisation interval bounded by the threshold and the selected threshold generating soft decoded data by performing soft decoding of the data using said log likelihood ratio and outputting the soft decoding data.

VERIFYING THE CORRECTNESS OF A DEFLATE COMPRESSION ACCELERATOR

Embodiments of the invention are directed to a DEFLATE compression accelerator and to a method for verifying the correctness of the DEFLATE compression accelerator. The accelerator includes an input buffer and a Lempel-Ziv 77 (LZ77) compressor communicatively coupled to an output of the input buffer. A switch is communicatively coupled to the output of the input buffer and to the output of the LZ77 compressor. The switch is configured to bypass the LZ77 compressor during a compression test. The accelerator further includes a deflate Huffman encoder communicatively coupled to an output of the switch and an output buffer communicatively coupled to the deflate Huffman encoder. When the switch is not bypassed, the compressor can be modified to produce repeatable results.

VERIFYING THE CORRECTNESS OF A DEFLATE COMPRESSION ACCELERATOR

Embodiments of the invention are directed to a DEFLATE compression accelerator and to a method for verifying the correctness of the DEFLATE compression accelerator. The accelerator includes an input buffer and a Lempel-Ziv 77 (LZ77) compressor communicatively coupled to an output of the input buffer. A switch is communicatively coupled to the output of the input buffer and to the output of the LZ77 compressor. The switch is configured to bypass the LZ77 compressor during a compression test. The accelerator further includes a deflate Huffman encoder communicatively coupled to an output of the switch and an output buffer communicatively coupled to the deflate Huffman encoder. When the switch is not bypassed, the compressor can be modified to produce repeatable results.

Error detector and/or corrector checker method and apparatus

In embodiments, an apparatus may comprise random access memory (RAM); an error detecting and/or correcting code (EDCC) encoder to generate and add an error detecting and/or correcting code to a datum being written into the memory for storage; and an EDCC decoder to use the error detecting and/or correcting code added to the datum to correct one or more bits of error in the datum when the datum with the added error detecting and/or correcting code is read back from the RAM. Further, the apparatus may include an error detection and/or correction checker to inject one or more bits of error into the datum when the datum with the added error and/or correcting code is read back from the RAM, and check whether the EDCC decoder is able to correct the one or more bits of error injected into the datum.

FORWARD ERROR CORRECTION (FEC) EMULATOR

Embodiments relate to the emulation of the effect of Forward Error Correction (FEC) codes, e.g., GF.sup.10 Reed Solomon (RS) FEC codes, on the bit error ratio (BER) of received Pseudo-Random Binary Sequences (PRBS) patterns. In particular, embodiments group errors into RS-FEC symbols and codewords in order to determine if the errors are correctable. By emulating the error correction capabilities of FEC codes in order to determine which errors are correctable by the code, embodiments afford a more accurate representation of the post-FEC BER of RS FEC codes from links carrying PRBS patterns. This FEC code emulation provides error correction statistics, for stand-alone use or for error correction in connection with Bit Error Rate Testers (BERTs).

NOVEL DYNAMIC DETECTION FOR FLASH MEMORY

A method of decoding data stored in non-volatile memory in which each memory cell stores data by adopting one of a plurality of storage states. The method comprises using a threshold for determining a physical property of the memory cells to distinguish between at least two storage states, reading a data codeword from a plurality of the memory cells using the threshold and determining a bit error rate for the data codeword read using the threshold, repeatedly modifying said threshold and re-reading said data codeword using said modified threshold and determining a modified bit error rate for the data codeword read using the modified threshold, selecting the one of the modified thresholds for which the mutual information content between the stored data input and the read data is maximised based on the bit error rate for the data codeword read using the threshold and the bit error rate for the data codeword read using the modified threshold, determining a log likelihood ratio of a quantisation interval bounded by the threshold and the selected threshold generating soft decoded data by performing soft decoding of the data using said log likelihood ratio and outputting the soft decoding data.

Error correction code words with binomial bit error distribution

An error injected error correction code (ECC) word generator generates a set of ECC code words injected with bit errors for being read by an ECC decoder and error reporting hardware. The set of the error injected ECC words has a binomial distribution with regard to a number of the bit errors in a given ECC word of the set. The set of error injected ECC words has a predetermined average ratio of bit errors.

Method and apparatus for determining bit-error rate in a data channel
11876532 · 2024-01-16 · ·

A method for determining a bit-error rate in data received on high-speed data channel that uses a forward-error-correcting decoder includes receiving at receiver circuitry on the high-speed data channel a received predetermined data pattern, comparing, bit-wise, the received predetermined data pattern to a locally generated copy of the predetermined data pattern to derive output bits representing whether there was an error in a corresponding bit of the received predetermined data pattern, to determine error bits in the received predetermined data pattern, grouping output bits from the comparing into symbols and codewords, and for each codeword for which a count of symbols containing errors exceeds a number of symbols correctable by the forward-error-correcting decoder, counting a total number of bit errors contained in the symbols containing errors, for use in adjusting the receiver circuitry in response to the total number of bit errors.