Abstract: A data distribution system suitable for use in a content addressable memory (CAM) search engine have a number of CAM units. A set of bank multiplexers each includes a set of multiplexing constructs that are controllable via respective bank control buses. Input data for storage in the CAM units as file data or for searching against pre-stored file data are provided to the bank multiplexers and the bank control buses direct the multiplexing constructs to selectively pass sub-portions of the input data onward to the CAM units thus distributing some or all of the input data to the CAM units, with the input data configurably ordered as desired, configurably duplicated as desired, or both. Optionally, a configuration register can hold multiple sets of programming data for loading onto the bank control buses to direct the multiplexing constructs, thus facilitating different distributions of the input data to the CAM units.

Abstract: CAM devices that can be cascaded together to form CAM systems of different sizes are disclosed. The system has one or more clusters of M CAM devices, each device including (M−1) disable connections. Disable signals are used to avoid contention so that one CAM device generates the system output on a shared bus. To reduce pin count, the CAM device of priority N within each cluster has (N−1) of its disable connections programmed as inputs for disable-in signals received from higher-priority CAM devices, and its remaining (M−N) disable connections programmed as outputs for disable-out signals provided to lower-priority CAM devices. Some embodiments include two or more clusters of CAM devices and a controller. In some embodiments, the CAM system works as fast as a single CAM device. Some embodiments impose no architectural limits on the number of CAM devices that can be cascaded together.

Abstract: A content addressable memory (CAM) system includes CAM banks that can be linked together in a series to form a CAM module. Each CAM bank includes a CAM array with rows. In a lookup operation, each row asserts a field-match signal when a field from a key matches the field of a CAM entry held in the row. Each CAM bank receives a link-control signal, each received from the preceding CAM bank match-in signals for the rows, and each generates match-out signals for the rows. Some embodiments dynamically configure the CAM system into one or more independent CAM modules of various widths, according to data held in a configuration register or to the current value of the key or other search information. Some embodiments include multiple priority encoders that can be coupled to the match-out signals of dynamically selected CAM banks, thus advantageously allowing parallel lookup operations in the CAM modules.

Abstract: The disclosed device is directed toward a furling swivel mechanism comprising a liner defining a vertical centerline. An inner sleeve is disposed on the liner and the inner sleeve defines an inner sleeve recess. An outer sleeve is rotatably coupled to the inner sleeve and the outer sleeve defines an outer sleeve recess. A headsail yoke is coupled to the inner sleeve recess. A halyard yoke is coupled to the outer sleeve recess. The inner sleeve recess and the outer sleeve recess are configured to form a zero moment along the vertical centerline.

Abstract: A relocation system to associatively search a database lookup table with a search key to addressably retrieve a corresponding associate content table record as a search result. The relocation system is implemented in search engine devices having associative memory (e.g., CAM) having one or more sections. The search engine devices employ relocation values when calculating addresses, one per section per device, with the relocation values optionally pre-calculated and stored in relocation registers. The search engine devices may be cascaded to construct a larger search engine. The search engine is typically used with a processor and addressable memory (e.g., RAM or ROM). In particular, the relocation system permits multiple databases to be concurrently stored and worked with in the associative and addressable memory.

Abstract: A method of making a computer booting an operation system from a flash card which is plugged in multi-card reader is disclosed. The multi-card reader does not care the card is located at first socket or not. The method comprises: at first, a bootable card having a master bootable record or reserve sector written a bootable pattern thereon is prepared. Then if the BIOS of the host computer requests a bootable pattern from the USB storage apparatus, the firmware of the multi-card reader is then provided a logic unit number (LUN)=0 to the host computer if there is a bootable flash card seated at a socket. The socket is not need to be the first socket but arbitrary. Thus, the USB card reader will be convenient for any user.

Abstract: A system is provided for controlling amplification in a receiver. The receiver amplifies a signal in accordance with a controlled gain to enhance the reliability of demodulating the received signal. A lower frequency signal is derived by down-converting the received signal. The derived lower frequency signal is converted into a digital baseband signal. A compensatory direct current offset is determined by evaluation of one of trailing symbols and a defined sequence of a data packet of the received signal. A compensatory direct current offset is manipulated with respect to a digital baseband signal to compensate for an unwanted direct current offset of the digital baseband signal, indicative of a frequency difference between the received signal and the transmitted signal.

Abstract: A fast aging system (10) which may work with a memory (12) in which data words (16) having aging words (18) are stored. An aging address counter (20) selects an aging word (18) for updating based on a state change in a linear feedback shift register (LFSR) (24). Optionally, in the aging word (18) a zero value (52) may represent a permanent data words (16), a predefined non-zero value (56) may represent data words (16) which are available for replacement, and other zero values may represent data words (16) which are in various stages of valid lifetimes and which should not be replaced yet.

Abstract: A method is proposed for accessing the memory of a de-interleaving unit. The conventional access method has the drawback of ineffective use of the memory space of the de-interleaving unit, while the proposed method uses only about half the memory space for implementation. The proposed method utilizes a specially-formulated write-operation interleaving algorithm to write data into the memory of the de-interleaving unit, and subsequently utilizes a specially-formulated read-operation de-interleaving algorithm to read data from the memory of the de-interleaving unit.

Abstract: A method of updating in system program (ISP) of an USB device is disclosed. After the USB device is connected to a host and its attribute is recognized by the host, the USB device configuration is set. The microprocessor (mp) in USB device executes the ISP codes stored in the flash memory until a first vendor command “ISP_START” is sent from the host for updating new ISP codes. The mp is then idled. Afterward, the ISP decoder handled a series of vendor commands until a vendor command “ISP_RESET” is retrieved. The series of vender commands include “ISP_INITIAL”, “ISP_ERASE_PAGE”, “ISP_INITIAL”, “ISP_PROGRAM”, “ISP_READ”, and “ISP_RESET” to program new ISP codes. The “ISP_READ” is to verify the codes programmed.

Abstract: A content addressable memory (CAM)(10, 102) and method having a data-in sub-circuit (44), memory cells (16, 18), a match-high line (36), a match-low line (38), and pre-charge devices (40, 42). Input lines (30, 32, 48, 50) from the data-in sub-circuit (44) are not necessarily discharged to ground in every cycle of a clock signal (62) used by the memory cells (16, 18). Further, the pre-charge devices (40, 42) may be operated at one half of the rate of the clock signal (62). Yet further, the CAM (10, 102) may be selectively configured to operate in either binary or ternary mode.

Abstract: A content addressable memory (CAM)(10, 102) and method having a data-in sub-circuit (44), memory cells (16, 18), a match-high line (36), a match-low line (38), and pre-charge devices (40, 42). Input lines (30, 32, 48, 50) from the data-in sub-circuit (44) are not necessarily discharged to ground in every cycle of a clock signal (62) used by the memory cells (16, 18). Further, the pre-charge devices (40, 42) may be operated at one half of the rate of the clock signal (62). Yet further, the CAM (10, 102) may be selectively configured to operate in either binary or ternary mode.

Abstract: A fast aging system (10) which may work with a memory (12) in which data words (16) having aging words (18) are stored. An aging address counter (20) selects an aging word (18) for updating based on a state change in a linear feedback shift register (LFSR) (24). Optionally, in the aging word (18) a zero value (52) may represent a permanent data words (16), a predefined non-zero value (56) may represent data words (16) which are available for replacement, and other zero values may represent data words (16) which are in various stages of valid lifetimes and which should not be replaced yet.

Abstract: A method for recovering a data required to have n consecutive and repetitive bits is disclosed. The data is obtained by converting a sample value sequence into a binary sequence according to a preset value and the data having n−1 consecutive first-level bits and two second-level bits immediately adjacent to two end bits of the n−1 consecutive first-level bits, respectively. The method corrects one of the two second-level bits, which has a corresponding sample value closer to the preset value than the other, into another first-level bit to obtain n consecutive first-level bits. In addition, a device for recovering a data to be decoded is also disclosed.

Abstract: A parallel search engine able to receive commands via a search instruction input and data words via a search data input. The commands received, which are optionally programmable, control operation of a data dispatch unit and a result dispatch unit. The data words received are sent by the data dispatch unit as search data to a CAM module array made up of CAM modules interconnected by a cascade information bus for comparison against pre-stored comparand databases. The CAM modules of the CAM module array provide search results to the result dispatch unit which generates results, typically multiple in parallel, at a result output. Optionally, multiple of the parallel search engines may be cascaded by connection to an expansion bus to form a mega search engine.

Abstract: After an optical waveguide substrate including a supporting substrate is adhered to an electric wiring board, the supporting substrate alone is dissolved using an organic solvent for removal. Alternatively, the supporting substrate alone is melted through a thermal treatment for removal. Further, a core layer of an optical waveguide is formed on the substrate using a photosensitive resin having a thermal expansion coefficient substantially identical to that of the supporting substrate.

Abstract: A process for computing an eccentric amount of a disk upon rotating is provided. The process includes steps of starting a servo control system of a disk drive to rotate the disk at a specified angular velocity, measuring a track crossing speed of the servo control system at a focusing point on the disk, and computing the eccentric amount of the disk according to the specified angular velocity and the track crossing speed. A process for controlling rotation of a disk loaded in a disk drive is also provided. The process includes steps of realizing an eccentric amount of the disk, and rotating the disk at an operating speed corresponding to the eccentric amount.

Abstract: A photobioreactor is disclosed for cultivating a photosynthetic organism. This photobioreactor provides innovative features that allow an easy cleaning of the light source. The photobioreactor has a container for containing a liquid culture medium for cultivating photosynthetic organisms, light-emitting tubes mounted within the container. The photobioreactor also has cleaning devices mounted within the container for cleaning the outer surface of the light-emitting tubes and actuators for actuating the cleaning devices.

Abstract: A process is disclosed for the extraction, production and purification of carbon dioxide gas. The process may also be employed for the production of aqueous and/or organic solutions of bicarbonate ions using a precursor feed stream of gas containing carbon dioxide. The process consists of the countercurrent flushing of a packed tower-type bioreactor with gas containing carbon dioxide and a liquid solvent. The bioreactor contains carbonic anhydrase covalently bound to an inert inorganic support. The carbon dioxide of the gaseous phase diffuses into the liquid phase. The immobilized carbonic anhydrase catalyses the hydration of the carbon dioxide which forms hydrogen and bicarbonate ions. The solution of ions may be employed directly or, alternatively, subjected to an ion-exchange resin to immobilize the bicarbonate ions. The aqueous solution of hydrogen and bicarbonate ions may also be recirculated into a second identical bioreactor, wherein they are catalytically converted to water and carbon dioxide.

Abstract: A search engine (100) having a controller (112), a memory (114), and a hash pointer unit (110). The memory (114) includes a database of search data and associate content, and the controller (112) uses individual search values to access the memory (114) to obtain individual search results. The controller (112) includes a hash function (116) that generates a hash value from a, typically large, search value into a, typically smaller, hash value that may be a hash collision. The controller (112) converts the hash value into a hash address which is communicated to the hash pointer unit (110), which receives the hash address and provides a hash pointer that is communicated to and used by the memory to look up respective search results. In this manner hash collisions are avoided and the size of the memory (114) is not a function of the degree of multi-way set-associativity used.