Abstract: Fast settling circuits and methods designed to align input signal amplitude level and to remove DC offset voltages with minimal loss of low frequency signal in receiving analog circuits are disclosed. With the key innovative circuits and methods for signal peak alignment, the disclosed circuits and methods achieve fast settling without significant attenuation of the input signal. Peak aligning circuits and methods can be implemented along with conventional RC AC coupling circuits. In applying the aligning circuits and methods to differential signal pair, DC offsets can be easily removed.

Abstract: A Field Programmable Gate Array (FPGA) core cell with one or more Look-Up Tables (LUTs) and a selectable logic gate is presented as a space-efficient alternative to the conventional LUT-based FPGA core cell. An algorithm based upon the familiar FlowMap algorithm for LUT-based FPGA core cells implements the mapping of a Boolean logic network into the disclosed FPGA core cell.

Abstract: A fast-setting DC offset removal circuit with continuous cutoff frequency switching is disclosed. In the preferred embodiment, the circuit is implemented using a pair of RC filters for receiving a differential signal pair and a continuous, variable resistance control circuit. The control circuit can be current-controlled or voltage controlled to provide fast settling of the received signal and the removal of the DC offset components. Additionally, by using a current-controlled control circuit, the cutoff frequency of the RC filter can be ramped from high to low in a continuous manner, thereby minimizing the generation of DC offsets.

Abstract: In decoding an received codeword encoded for error correction purposes, a method for computing error locator polynomial and error evaluator polynomial in the key equation solving step is presented whereby the polynomials are generated through a number of intermediate steps that can be implemented with minimal amount of hardware circuitry. The number of intermediate steps requires a corresponding number of cycles to complete the calculation of the polynomials. Depending on the selected (N, K) code, the number of cycles required for the calculation of the polynomials would be within the time required for the calculation of up-stream data. More specifically, an efficient scheduling of a small number of finite-field multipliers (FFM's) without the need of finite-field inverters (FFI's) is disclosed. Using these new methods, an area-efficient architecture that uses only three FFM's and no FFI's is presented to implement a method derived from the inversionless Berlekamp-Massey algorithm.

Abstract: A system for facilitating, sending and receiving e-mail messages is disclosed. This e-mail system is supported by one or more main servers and a plurality of regional servers geographically distributed in populated areas, and are interconnected via a computer network such as the internet. An incoming e-mail message under this system is first processed and packaged by the main server to allow tracking of this message. The packaged message is then sent to the designated local server via a regional server. The local server receives the e-mail message and notifies or delivers the message to a client (user) e-mail device through one of several available notification methods. The e-mail device is a novel device designed to send and receive e-mail messages. It is a low cost device that may be a stand-alone device, a part of a multi-function device, or a part of a computer expansion card. The servers of the present invention can be maintained and operated remotely.

Abstract: A flip-flop for storing a bit of digital information generally used in register architectures is comprised of a two-input NAND gate and a D-type flip-flop. The output of the NAND gate is connected to the clock terminal of the flip-flop and the data signal is directed to the data terminal of the flip-flop. A new clock scheme is provided with for this circuit configuration in order to properly store the data signal.