摘要:
According to the invention, a data integrity code including logical block address ("LBA") and circuit implementation are provided. The code and implementing circuitry are utilized to enable data block LBA verification during a block transfer and retrieval process. The preferred data integrity code has embedded LBA information and also serves as a crosscheck code used to detect miscorrection by an error correction code ("ECC"). In a preferred disk drive embodiment, data integrity block ("DIB") is provided to verify that the LBA value associated with a given data block in a host interface matches the value associated with that same data block in a buffer memory and in a data sequencer. In a preferred method of use, data integrity/cross-check redundancy with LBA is appended to data blocks transmitted to a buffer memory and verified after the data block has been transferred from the buffer. After verification, the LBA is preferably written to the storage medium together with its associated data block to enable later LBA verification for blocks recovered from the storage medium. The LBA may also be verified when the data block is transferred back to a host from the buffer memory.
摘要:
In a peak detection system having a variable gain amplifier (VGA), a counter is initialized and a countdown is triggered. Each time a qualified peak is detected, the counter is re-initialized. If the countdown is completed, the VGA gain is updated. This method can be used to boost amplifier gain that is too low to generate a qualifying threshold, even while overlooking short periods of very low output.
摘要:
A digital communication apparatus transmits sectors of digital values that include error correction values used to detect and correct errors within the sector. Each sector consists of a number of blocks and the error correction values of each block are useful in correcting up to a maximum number of erroneous digital units in that block. The digital communication apparatus encodes the blocks of digital units to transmit them through a channel and then decodes the channel's representation of those encoded blocks, where the channel's representation occasionally contains burst errors. The encoding and decoding is performed in a manner that reduces the number of consecutive erroneous digital units caused by any one burst error to a number less than the number of blocks in a sector, ensuring that the error burst corrupts at most one digital unit in each block.
摘要:
A method for constructing trellis codes and an apparatus for providing trellis codes with increased minimum distance between output sequences of partial response channels with constrained inputs. A Viterbi detector expands a conventional trellis structure for the channel incorporating additional states interconnected such that a preselected function associates each state in the trellis with an algebraic evaluation of a polynomial at a particular element of a finite field. The detector trellis is time-varying such that only certain values of the preselected function are allowed every m bits. The time-variation assures that there are no minimum distance extensions of erroneous sequences beyond a predetermined length in the trellis. Reliability of storage channels is desirably increased, because more noise is required to overcome the additional distance and cause an error in distinguishing the correct encoded sequence.
摘要:
Improved multiplier construction methods facilitate efficient multiplication in finite fields. Implementations include digital logic circuits and user scaleable software. Lower logical circuit complexity is achieved by improved resource sharing with subfield multipliers. Split-optimal multipliers meet a lower bound measuring complexity. Multiplier construction methods are applied repeatedly to build efficient multipliers for large finite fields from small subfield components.An improved finite field construction method constructs arbitrarily large finite fields using search results from a small starting field, building successively larger fields from the bottom up, without the need for successively larger searches. The improved method constructs arbitrarily large finite fields with limited construction effort using a polynomial constant equal to the product of a deterministic product term and a selectable small field scalar. The polynomials used in the improved method feature sparse constants facilitating low complexity multiplication.
摘要:
A method to provide additional media objects for two or more users intercommunicating over a network is described. The intercommunication messages are analyzed to determine additional related media objects available on the network, and one or more best related media objects are transmitted to the intercommunicating users. The additional media objects are rendered within the context of the network intercommunication.
摘要:
Reed-Solomon encoders providing support for multiple codes in a simple architecture having a reduced number of Galois field multipliers. Rather than implementing n subfilters each representing an individual degree polynomial filter as in conventional Reed-Solomon encoder, multiple degree polynomials are factored in a way which is convenient to a desired plurality of Reed-Solomon codes. Thus, not only are the number of required Galois field multipliers reduced, but support for different Reed-Solomon codes is provided with a minimized number of Galois field multipliers. Preferred embodiments in compliance with the proposed 802.16.1 wireless standard support up to sixteen Reed-Solomon codes all within a single architecture, including sixteen subfilters, either cascaded or in parallel. Each of the individual filters balances and reduces critical path lengths in the Reed-Solomon encoder, and reduces the loading of critical nets, resulting in a Reed-Solomon encoder with a greater throughput for a given technology.
摘要:
An encoder for matched spectral null binary codes is described, particularly for 12B/15B codes. The codeword trellis is partitioned into two or more subtrellises, and each subtrellis is encoded separately. The codeword is the concatenation of the codewords produced by the subtrellises. Some valid sequences have to be excluded, in order to ensure that all concatenations are valid, but the storage requirements, are greatly reduced.
摘要:
A method and means for detecting spectral null sequences of a spectrally-constrained code at the output of a noisy communications channel by tracking the spectral content of said sequences with a Viterbi detector using an N stage trellis and mapping each spectral null sequence to a unique path of acyclic successive states and edges through said trellis by selectively outsplitting counterpart states at preselected times modulo N in said trellis such that no pair of unique paths support the same spectral null sequence.
摘要:
Maximum likelihood detection of a trellis code using a Viterbi detector constructed from a time-varying trellis structure that is associated with a partial response channel and consists of connected trellises with periodically repeated patterns of nodes and subtrellises of said trellises. Each subtrellis has nodes representing a current state of the channel and value of a predetermined tracked attribute. A survivor metric and a survivor sequence from a node at the end of one subtrellis are reassigned to a node at the beginning of an adjacent subtrellis having a different value of the tracked attribute for increasing minimum distance properties, reducing error event length and improving code constraints for timing and gain control. The one subtrellis and adjacent subtrellis may be within a single trellis or in adjacent trellises.