摘要:
Encoders and methods for designing encoders for Low Density Parity Check (LDPC) and other block codes are presented. An efficient and systematic method for designing partially parallel encoders is presented. A parallelism factor is selected such that the end result for the encoder is similar to the partially parallel G matrix multiplication method. In addition to the method an initial circuit is given for the G matrix multiplication encoder and the RU encoder. A circuit for the hybrid encoder is presented which achieves less power consumption and smaller area than an equivalent encoder based on the G matrix multiplication with a smaller critical path than previous encoders.
摘要:
A low-latency, high-throughput rate Viterbi decoder implemented in a K1-nested layered look-ahead (LLA) manner, combines K1-trellis steps, with look-ahead step M, where K
摘要:
A memory address generation method and circuit architecture for time-multiplexed RS-based LDPC code decoder is presented. The method is developed for non quasi-cyclic RS-based LDPC code decoder implementation. A circuit for the memory address generation method achieves low area. High throughput time-multiplexed RS-based LDPC code decoder design models and circuit architectures are presented. The decoder models are specifically developed for 10BASE-T (10-Gigabit Ethernet Transceiver Over Copper) system. These time-multiplexed architectures enable higher throughput with lower area.
摘要:
The invention relates to techniques for implementing high-speed precoders, such as Tomlinson-Harashima (TH) precoders. In one aspect of the invention, look-ahead techniques are utilized to pipeline a TH precoder, resulting in a high-speed TH precoder. These techniques may be applied to pipeline various types of TH precoders, such as Finite Impulse Response (FIR) precoders and Infinite Impulse Response (IIR) precoders. In another aspect of the invention, parallel processing multiple non-pipelined TH precoders results in a high-speed parallel TH precoder design. Utilization of high-speed TH precoders may enable network providers to for example, operate 10 Gigabit Ethernet with copper cable rather than fiber optic cable.
摘要:
A method to efficiently deal with FEXT crosstalk in wireline communication system via MIMO equalization is presented. A MIMO-DFE based receiver architecture is developed to demonstrate the advantage over the traditional receiver design. A MIMO structure for systems with TH precoding is also developed for 10GBASE-T application. The proposed architecture overcomes the limitation of the traditional schemes and achieves a better SNR performance and lower receiver complexity. The proposed method relies on the fact that FEXT inherently contains information about the symbols transmitted from the three far end transmitters and it can be viewed as a signal rather than noise. Therefore, MIMO techniques are applied to turn FEXT into a benefit for the receiver design.
摘要:
A low-error fixed-width multiplier receives a W-bit input and produces a W-bit product. In an embodiment, a multiplier (Y) is encoded using modified Booth coding. The encoded multiplier (Y) and a multiplicand (X) are processed together to generate partial products. The partial products are accumulated to generate a product (P). To compensate for the quantization error, Booth encoder outputs are used for the generation of error compensation bias. The truncated bits are divided into two groups, a major least significant bit group and a minor least significant bit group, depending upon their effects on the quantization error. Different error compensation methods are applied to each group.
摘要:
A K-bit information signal represented by a polynomial U(x) having a degree K−1 is received. The information signal is transformed to form a transformed information signal using a first transform represented by a polynomial G1(x) having a degree P. The transformed information signal is represented by a polynomial T(x) having a degree K+P−1. T(x) equals U(x)G1(x). An initial cyclic code represented by a polynomial R1(x) is generated for the transformed information signal using a second transform represented by a polynomial G2(x), where G2(x) has high-order leading-zero terms. R1(x) equals the remainder obtained by dividing T(x) by G2(x). The initial cyclic code is transformed to form a final cyclic code represented by a polynomial R2(x) using the first transform. R2(x) equals R1(x)/G1(x).
摘要:
A method to design parallel TH precoders and a circuit architecture to implement parallel TH precoders have been presented. The parallel design relies on the fact that a TH precoder can be viewed as an IIR filter with an input equal to the sum of the original input to the TH precoder and a compensation signal. The parallel design also relies on the fact that the compensation signal has finite levels. Therefore, precomputation techniques can be applied to calculate intermediate signal values for all possible values of the compensation signal.
摘要:
A method to design low complexity pipelined Tomlinson-Harashima precoders and its associated circuit architectures have been described. The low complexity pipelined TH precoder design relies on the proposed low complexity precomputation based FIR filters. In the low complexity precomputation method for FIR filters, each multiplier is replaced with a multiplexer.
摘要:
The invention is directed to techniques of parallelizing binary arithmetic coding. Two exemplary parallelized binary arithmetic coding systems are presented. One parallelized binary arithmetic coding system utilizes linear approximation and a constant probability of a less probable symbol. A second parallelized binary arithmetic coding system utilizes a parallelized table lookup technique. Both parallelized binary arithmetic coding systems may have increased throughput as compared to non-parallelized arithmetic coders.