990 results about "Block code" patented technology

Techniques for detecting and correcting burst errors in data bytes formed in a two-level block code structure. A second level decoder uses block level check bytes to detect columns in a two-level block code structure that contain error bytes. The second level decoder generates erasure pointers that identify columns in the two-level block structure effected by burst errors. A first level decoder then uses codeword check bytes to correct all of the bytes in the columns identified by the erasure pointers. The first level decoder is freed to use all of the codeword check bytes only for error byte value calculations. The first level decoder does not need to use any of the codeword check bytes for error location calculations, because the erasure pointers generated by the second level decoder provide all of the necessary error locations. This techniques doubles the error correction capability of the first level decoder.

Transform coefficients for blocks of pixels in an original picture are quantized to produce respective sets of quantization indices for the blocks of pixels. The quantization indices for at least some of the blocks are produced by using a quantization step size that is not uniform within each block. Largest magnitude quantization indices are selected from the respective sets of quantization indices for (run, level) encoding to produce the (run, level) encoded picture. For example, MPEG-2 coded video includes a set of non-zero AC discrete cosine transform (DCT) coefficients for 8x8 blocks of pixels. For scaling the MPEG-2 coded video, non-zero AC DCT coefficients are removed from the MPEG-2 coded video to produce reduced-quality MPEG-2 coded video that includes no more than a selected number of largest magnitude quantization indices for the non-zero AC DCT coefficients for each 8x8 block.

Disclosed is a method for transmitting a reference signal for identification of each cell in a communication system including a plurality of cells each of which is identified by a cell identifier. The method includes receiving a cell identifier, and generating a block code corresponding to the cell identifier using a predetermined block code generator matrix, and generating a first part sequence using the block code; selecting a second part sequence in accordance with the cell identifier; generating a reference signal of a frequency domain using the first part sequence and the second part sequence; converting the reference signal of the frequency domain to a reference signal of a time domain through an Inverse Fast Fourier Transform operation and transmitting the reference signal of the time domain in a predetermined reference signal transmission interval.

The transmission of ATM, Internet, and satellite communications is unified through international standardized protocol embedment. Global and Local performance optimization are achieved through the combination of combinatorial, dynamic, and probabilistic programming. A simultaneous domino effect of bandwidth conservation, efficiency enhancement, reliability improvement, traffic congestion prevention, delay minimization, and speed multiplication are realized for any digital communication system, particular in Internet. With three levels of error coding in ATM cells, the loss cell recovery and bit integrity are preserved. From its mathematical roots, new combinatorial sets are systematically generated, and applications of the sets are identified. Among the applications, optimal sequences can be produced for multi-user and multi-function communication system designs. Optimality is in terms of maximum possible number of sequences with given sequence length and sequence characteristics. The results are unique and theoretically proven. By serial and parallel concatenation of error codecs, reliability of multimedia transmission can be satisfied to any desirable level. As a part of the unified transmission scheme, the acquisition and synchronization method of cascading sequences exhibits significant improvement in correlation properties and detection probabilities. A method of using block designs is demonstrated to derive, to generate, and to construct low-density parity check block codes and threshold decodable convolutional codes. An efficiency evaluation method is formulated for the combination operation of ATM, Internet, and satellites.

The invention relates to spatially scalable encoding and decoding processes using a method for deriving coding information. More particularly, it relates to a method for deriving coding information used to encode high resolution images from coding information used to encode low resolution images when the ratio between high resolution and low resolution images dimensions is a multiple of 3 / 2. The method mainly comprises the following steps:deriving a block coding mode for each 8×8 blocks of a prediction macroblock MBi_pred from the macroblock coding mode of the associated base layer macroblocks on the basis of the macroblock class of MBi and an the basis of the position of the 8×8 block within MBi_pred;deriving a macroblock coding mode for MBi_pred from the coding modes of the associated base layer macroblocks; andderiving motion information for each macroblock MBi_pred from the motion information of the associated base layer macroblocks.

To increase the robustness of a broadcast DTV signal, complete (207, 187) Reed-Solomon forward-error-correction codewords are coded using binary linear block codes that reduce code rate by two or slightly less, enabling a DTV receiver to correct bit errors. Also, a DTV receiver can use a (15, 8), (16, 8) or (8, 4) block code to locate erroneous bytes for decoding (207, 187) Reed-Solomon code, so twice as many erroneous bytes can be corrected in a 187-byte data packet. The reduced code rate permits robust transmission of a 187-byte data packet in only two data segments and its super-robust transmission using a restricted symbol alphabet in only four data segments. This simplifies time-division multiplexing of data segments used for ordinary 8VSB transmissions with those used for robust and super-robust transmissions. Procedures to make legacy DTV receivers disregard data segments used for robust and super-robust transmission are disclosed.

Deblocking filter used in a video encoder / decoder based on a multilayer. In deciding a deblocking filter strength when performing a deblocking filtering with respect to a boundary between a current block coded by an intra-BL mode and its neighboring block, it is determined whether the current block or the neighboring block has coefficients. The filter strength is decided as a first filter strength if it is determined that the current block or the neighboring block has the coefficients, and the filter strength is decided as a second filter strength if it is determined that the current block or the neighboring block does not have the coefficients. The first filter strength is greater than the second filter strength.

Methods and apparatus for transmitting data via multiple antennas by using antenna diversity. A transmission diversity scheme is established such that two transmission matrices that are in accordance with the space frequency block code combined with Frequency switched transmit diversity (SFBC+FSTD) scheme, are alternatively applied in either the frequency domain, or the time domain, or both of the frequency domain or then time domain. The symbols in the transmission matrices may be transmitted either as one burst in a primary broadcast channel (PBCH), or as discrete bursts in the primary broadcast channel.

A macro block size determining unit 1 determines the size of each macro block on a frame-by-frame basis. A macro block dividing unit 2 divides an inputted image into macro blocks each having the size determined by the macro block size determining unit 1. A macro block coding unit 3 determines a coding mode for each of the macro blocks divided by the macro block dividing unit 2, and codes pixel values in each of the macro blocks in the determined coding mode.

The present invention is related to a method and apparatus for implementing space frequency block coding (SFBC) in an orthogonal frequency division multiplexing (OFDM) wireless communication system. The present invention is applicable to both a closed loop mode and an open loop mode. In the closed loop mode, power loading and eigen-beamforming are performed based on channel state information (CSI). A channel coded data stream is multiplexed into two or more data streams. Power loading is performed based on the CSI on each of the multiplexed data streams. SFBC encoding is performed on the data streams for each of the paired subcarriers. Then, eigen-beamforming is performed based on the CSI to distribute eigenbeams to multiple transmit antennas. The power loading may be performed on two or more SFBC encoding blocks or on each eigenmodes. Additionally, the power loading may be performed across subcarriers or subcarrier groups for weak eigenmodes.

Apparatus and methods store stream-based error recovery data for a memory array, such as a NAND flash array. Conventionally, data is block coded per industry specification and stored in the memory array. Within the limits of the block code, this technique provides for correction of errors. By applying a stream-based inner code, that is, concatenating the outer block code with an outer code, the error correction can be further enhanced, enhancing the reliability of the device. This can also permit a relatively small-geometry device to be used in a legacy application.

A data transmission system is provided for transmitting user data to and receiving data from a communication channel, including a parity check matrix having M tiers, wherein M≦2, Dmin=2*M for M=1 . . . 3 or 2*M≦Dmin≦6 for M>3, wherein Dmin is the minimum Hamming distance, tc=M, wherein tc is the column weight, and cycle−4=0. A linear block encoder encodes the user data in response to the parity check matrix, and a transmitter transmits an output of the linear block encoder to the communication channel. A soft channel decoder decodes data, and a soft linear block code decoder to decode data decoded by the soft channel decoder in response to the parity check matrix.

A coding apparatus which codes moving image signals into block units, is configured from a signal processing element which performs motion compensation for moving image signals for over a plural number of frames or fields and codes inter-image signals, and a transfer element which recombines coded information for each block coded by said processing element, into macroblock units which are a plural number of block units of each type of coded information, and transfers them. In addition, a decoding apparatus for moving image signals which have been coded in block units is configured from a detector element which detects transfer code errors for each type of coded information, and a processing element which performs motion compensation and inter-image processing of the coded information using only correct frames which do not include transfer code errors, and without using frames which have transfer code errors, by changing a method of inter-frame processing for motion compensation in accordance with the transfer coding errors in the coded information which has been detected for each type.

A method, computer program product and system for reducing the boot time of a TCPA based computing system. A flash memory in the TCPA based computing system may include a register comprising bits configured to indicate whether the segments of the flash memory have been updated. The flash memory may further include a table configured to store measurements of the segments of the flash memory. The flash memory may further include a boot block code that includes a Core Root of Trust for Measurement (CRTM). The CRTM may read the bits in the register to determine if any of the segments of the flash memory have been updated. The CRTM may further obtain the measurement values in the table for those segments that store the POST BIOS code that have not been updated thereby saving time from measuring the POST BIOS code and consequently reducing the boot time.

The invention relates to a block chain account book distributed storage technology based on erasure code, and belongs to the block chain technology field. The technology comprises the following steps:a) the block delay coding strategy allows to delay the coding of a certain number of new blocks to meet the synchronization requirements of other block chain consensus nodes for blocks; B) accordingto the set block coding algorithm, the blocks satisfying the coding condition are cut into k data blocks, each data block having a size of about 1 / k of the original block, and further the cut k datablocks are encoded into n (n) k encoded blocks by the erasure coding technology; (c) each block chain node reserves a part of that coding block, and finally the whole block chain network store the coding blocks decentrally; D) when the original block needs to be recovered from the encoded block, the current node collects the remaining encoded block corresponding to the block from the remaining nodes, and then recovers the original block according to the corresponding decoding algorithm. The method reduces the requirement of the block chain for storage resources and improves the utilization rate of storage space.

Transform coefficients for blocks of pixels in an original picture are quantized to produce respective sets of quantization indices for the blocks of pixels. The quantization indices for at least some of the blocks are produced by using a quantization step size that is not uniform within each block. Largest magnitude quantization indices are selected from the respective sets of quantization indices for (run, level) encoding to produce the (run, level) encoded picture. For example, MPEG-2 coded video includes a set of non-zero AC discrete cosine transform (DCT) coefficients for 8×8 blocks of pixels. For scaling the MPEG-2 coded video, non-zero AC DCT coefficients are removed from the MPEG-2 coded video to produce reduced-quality MPEG-2 coded video that includes no more than a selected number of largest magnitude quantization indices for the non-zero AC DCT coefficients for each 8×8 block.

A communication system including two endpoints (transceivers or a transmitter and receiver) and a serial link between them. At least one endpoint is configured to generate encoded data in accordance with a line code and to transmit the encoded data over the link. The line code specifies a block code for encoding cells of application data and control bits, and typically also special characters that do not match bit sequences of encoded cells. Other aspects of the invention are methods for generating (and endpoint devices configured to generate and transmit, or receive and process) such encoded data, and methods for performing functions of multiple layers of a communication protocol in response to such encoded data. In accordance with the invention, multiple levels of communication protocol functionality can be efficiently incorporated within a line code.

A method and apparatus for deriving directional-priority based candidates for a block coded in Inter, or Merge or Skip mode are disclosed. One or more motion vectors associated with one or more previously coded blocks for a current block are determined first. One or more directional-priority based candidates for the current block are derived by searching through the previously coded blocks according to a priority order associated with prediction direction of the motion vectors. The motion vectors having a first prediction direction are selected with a higher priority than the motion vectors having a second prediction direction. The derived directional-priority based candidates are inserted into a candidate list. The motion vector predictor (MVP) or Merge / Skip candidate is selected from the candidate list for coding the current block in Inter, or Merge or Skip mode.

Provided is a method for transmitting data in a communication or broadcasting system using a linear block code by generating a codeword by encoding input information data bits, interleaving the codeword; outputting modulation signal-constituting bits by bit-mapping the interleaved codeword using a bit-mapping table predetermined depending on a modulation scheme and a coding rate, outputting a modulation signal by modulating the modulation signal-constituting bits and transmitting the modulation signal via a transmit antenna.

An STBC encoding extension method for more than two transmit antennas, which provides higher diversity gains while keeping the same coding / decoding latency as in the two-transmit-antenna case of conventional STBC encoding. A N×2 STBC encoder is constructed from a 2×2 STBC encoder, wherein the N×2 STBC encoder is suitable for transmission with higher numbers of transmit antennas including wireless transmission systems with N×1 antenna configurations where N>2.

A transmitter is provided for transmitting data to a communication channel and a receiver receives the data from the communication channel. The transmitter comprises an encoder to encode data and a linear block encoder to encode data encoded by the encoder. The receiver comprises a soft channel decoder to decode the data, and a soft linear block code decoder to decode data decoded by the soft channel decoder. In the first iteration, the soft channel decoder decodes data received by the receiver. In succeeding iterations, the soft channel decoder decodes the data received by the receiver and utilizes information from the soft linear block decoder from an immediate preceding iteration. A decision circuit selects an output of the soft linear block decoder if an evaluated criterion is less than a threshold, or an output of the soft channel decoder if the evaluated criterion is greater than the threshold. A decoder decodes an output of the threshold check circuit.

Data extracted from fluorosphore responses of fluorophore labeled bases in genetic material used in sequencing of unknown fragments from a defined set of for example a model system are converted into a class of block codes that are then employed in a computer-based process to compare and correct preliminary calls of calls of the categorically known genetic material. In a specific embodiment, the Reed-Solomon codes are employed to identify one or more errors as may occur in a finite block of codes. The methodology is also useful to identify elements of a real system containing known elements in the form of a tag. Reed-Solomon sensors may be employed with and in addition to other types of genome sensors.

Apparatus and methods store data in a non-volatile solid state memory device according to a rate-compatible code, such as a rate-compatible convolutional code (RPCC). An example of such a memory device is a flash memory device. Data can initially be block encoded for error correction and detection. The block-coded data can be further convolutionally encoded. Convolutional-coded data can be punctured and stored in the memory device. The puncturing decreases the amount of memory used to store the data. Depending on conditions, the amount of puncturing can vary from no puncturing to a relatively high amount of puncturing to vary the amount of additional error correction provided and memory used. The punctured data can be decoded when data is to be read from the memory device.

Apparatus and methods store stream-based error recovery data for a memory array, such as a NAND flash array. Conventionally, data is block coded per industry specification and stored in the memory array. Within the limits of the block code, this technique provides for correction of errors. By applying a stream-based inner code, that is, concatenating the outer block code with an outer code, the error correction can be further enhanced, enhancing the reliability of the device. This can also permit a relatively small-geometry device to be used in a legacy application.

In an error-correcting decoder, in which an input digital signal including reliability information is decoded by using a Viterbi algorithm as a first decoding process and a final decoded result is obtained by block-code decoding as a second decoding process, a flag signal is added to a location where a value of reliability of path metric determined by the Viterbi algorithm is lower than a threshold, as an original flagged location. A flag signal adding unit continuously adds flag signals to locations, from the original flagged location to locations preceding the originally flagged location, after back tracing. The flagged locations are then regarded as erasure locations in the block-code decoding process.

Block modulus coding (BMC) systems implement block coding on non-binary modulus m symbols, where m is greater than 2. BMC systems can be used for, among other things, forward error correction (FEC) of source data in communication systems or parity backup for error correction of source data in storage systems where the source data is represented by non-binary symbols that may be corrupted by burst errors. The block coding is preferably performed using a distributed arrangement of block encoders or decoders. A distributed block modulus encoder (DBME) encodes sequential source data symbols of modulus m with a plurality of sequential block encoders to produce interleaved parity codewords. The codewords utilize modulus m symbols where the medium can reliably resolve m symbol states. The interleaved parity codewords enable decoding of error-corrected source data symbols of modulus m with a distributed block modulus decoder (DBMD) that utilizes a plurality of sequential block decoders to produce the error-corrected source data symbols.

A method of assembling a plurality of frames including cell / packet-formatted data according to a predetermined frame format for transmission in a communication signal in a wireless or satellite environment. The method begins by assembling a data payload for each frame having a first variable size, including at least one of a partial data cell / packet and a complete data cell / packet. Then, for each frame a block code having a second variable size is generated for use in error correction. Each frame is provided with a frame header which defines aspects of said frame. Finally, the data payload, the block code and the format header are combined to form a frame corresponding to the plurality of frames, the format header defining a first portion of the frame, the data payload defining a second portion of the frame and the block code defining a third portion of the frame.

A method of decoding linear block code uses an iterative message passing algorithm with a binary image of a parity check matrix of the linear block code, wherein the parity check matrix is adapted from one iteration to another based on the reliabilities of bits in the linear block code. The adaptation involves reducing a submatrix corresponding to the less reliable bits in the linear block code to a sparse nature before applying the message passing algorithm in each iteration. An apparatus that performs the method is also provided and several variations of the algorithm are also provided.

A multicarrier transmitter uses high-throughput space-frequency block codes to map transmit symbols to a particular transmit antenna and a particular subcarrier of a multicarrier communication channel.