Abstract:
The present invention provides a data transformation apparatus for transforming a first data block into a second data block. The first data block comprises a predetermined number of bits. The data transformation apparatus comprises a control bit module, a processing module, and a selection module. The control bit module is used for generating a plurality of control bit sets, wherein each control bit set represents a transformation procedure of the first data block. The processing module is used for receiving the first data block and the plural control bit sets, and accordingly for generating a plurality of first reference values. The selection module connects with the processing module and generates the second data block according to the plural first reference values and a predetermined judgment value.
Abstract:
A system (100) and method (200) of combining codewords is provided. The system can include a splitter (120) for splitting a first codeword (110) into a most significant bits part MSP (112) and a least significant bits part LSP (114), a combiner (130) for combining the MSP of the first codeword with a second codeword to produce a first group (132), and a concatenator (140) for concatenating the first group with the LSP to produce a second group (134), and multiplexing the first group with the second group to produce a multiplexed codeword (150). Bit-errors in the LSP correspond to decoding errors only in a codeword associated with the LSP, and not to decoding errors in other codewords.
Abstract:
In an optical disk apparatus, the polarity of synchronization information is adaptively set to thereby improve the quality of data recording and reproduction. When inserting and recording synchronization information, an encoder of an optical disk apparatus temporarily sets the polarity of the synchronization information to either a mark or a space in accordance with a predetermined rule. A DSV which is obtained if the synchronization information is to be recorded with the polarity which has been temporarily set is computed. If the DSV which is computed is equal to or smaller than a predetermined limit value, the polarity which has been temporarily set is accepted and the synchronization information is actually recorded with the polarity. If the DSV which is computed exceeds the limit value, on the other hand, the polarity which has been temporarily set is not adopted, and the synchronization information is actually recorded with a polarity which is different from the polarity.
Abstract:
In a network having transaction acceleration, for an accelerated transaction, a client directs a request to a client-side transaction handler that forwards the request to a server-side transaction handler, which in turn provides the request, or a representation thereof, to a server for responding to the request. The server sends the response to the server-side transaction handler, which forwards the response to the client-side transaction handler, which in turn provides the response to the client. Transactions are accelerated by the transaction handlers by storing segments of data used in the transactions in persistent segment storage accessible to the server-side transaction handler and in persistent segment storage accessible to the client-side transaction handler. When data is to be sent between the transaction handlers, the sending transaction handler compares the segments of the data to be sent with segments stored in its persistent segment storage and replaces segments of data with references to entries in its persistent segment storage that match or closely match the segments of data to be replaced. The receiving transaction store reconstructs the data sent by replacing segment references with corresponding segment data from its persistent segment storage, requesting missing segments from the sender as needed. The transaction accelerators could handle multiple clients and/or multiple servers and the segments stored in the persistent segment stores can relate to different transactions, different clients and/or different servers. Persistent segment stores can be prepopulated with segment data from other transaction accelerators.
Abstract:
Methods and apparatus for spreading and concentrating information to constant-weight encode data words on a parallel data line bus while allowing communication of information across sub-word paths. In one embodiment, data transfer rates previously obtained only with differential architectures are achieved by only a small increase in line count above single ended architectures. For example, an 18-bit data word requires 22 encoded data lines for transmission, where previously, 16 and 32 lines would be required to transmit un-coded data with single-ended and differential architectures respectively. Constant-weight parallel encoding maintains constant current in the parallel-encoded data lines and the high and low potential driver circuits for the signal lines.
Abstract:
A modulator includes a replacement processing unit which replaces a part of main information code-converted in a main information converter with specific information code-converted in a specific information converter and a direct-current component suppress processing unit which performs direct-current component suppress processing for the main information which has undergone the replacement processing in the replacement processing unit. The direct-current component suppress processing can be performed for the main information after the replacement processing of the main information with the specific information to prevent deterioration in direct-current component suppress characteristics due to the replacement processing.
Abstract:
A method and apparatus are provided for encoding and decoding digital information. A sequence of data words is received, wherein each data word has a running digital sum (RDS). The sequence of data words is encoded into a sequence of corresponding code words, which has a current RDS. For each data word a binary symbol is added to the data word and the data word is selectively complemented as a function of the RDS of the data word and the current RDS of the sequence of code words to form the corresponding code word.
Abstract:
A method of generating an 8B/10B-like code bit sequence that is similar to an 8B/10B code may include: generating a parallel pseudo random bit sequence having N bits wherein N is an integer and N≧2; and transforming the parallel pseudo random bit sequence into a parallel first bit sequence that is similar to an 8B/10B code, a number Q of consecutive “0”s or “1”s of the first bit sequence being Q≦M1, wherein Q and M1 are integers and M
Abstract:
The present invention provides an apparatus and method for switching between particular decoders within a plurality of decoders, each decoder adapted to decode bit streams having a unique format. The apparatus comprises format detectors which output format indicators based on information from the bit stream. Logic responsive to the format detector output may determine a particular decoder among the plurality of decoders. The particular decoder determined by the logic decodes the formatted bit stream. At least one switch, responsive to the determination of the logic, connects the formatted bit stream to the particular decoder. The format detectors detect at least one of the frame information, or start code, the packet header information, and the code word values in a portion of a coded content of the bit stream, wherein the code word values, derivatives thereof, or a pattern of word values, are unique to the bit stream format.