5593 results about "Decoding methods" patented technology

Conventionally there has been a case that the direct mode cannot be applied effectively depending on the block. With such being the case, information indicating whether a backward reference frame set by default can be utilized in the direct mode is provided to a decoder. A switching procedure to switch to a compensation method applicable when a collocated block has no forward motion vector for effective use, and the compensation method are also provided to the decoder. Thus, it is possible to clearly determine whether the reference frame can be used in the direct mode. Further, when the frame number has no time information, it is possible to effectively send information indicating the relationship between the reference frame and the current frame. Furthermore, the alternative mode and its switching procedure of the present invention make it possible to improve the prediction performance when the direct mode cannot be applied.

A down sampler 13 down samples a digital signal in the sampling frequency thereof from 96 kHz to 48 kHz on a frame-by-frame basis. The converted signal is compression encoded and output as a main code Im. An up sampler 16 converts a partial signal corresponding to the main code Im to a signal having the original sampling frequency 96 kHz, for example. An error signal between the up sampled signal and an input digital signal is generated. An array converting and encoding unit 18 array converts bits of sample chains of the error signal, thereby outputting an error code Pe. On a decoding side, a high fidelity reproduced signal is obtained based on the main code Im and the error code Pe, or a reproduced signal is obtained based on the main code Im only.

A moving image encoding method includes outputting encoded data that comprises an image code sequence corresponding to slices of a moving image and first timing information indicating times at which the slices are to be decoded.

A multi-layer memory device is provided. The multi-layer memory device includes multiple layers of memory core cells. A word plane electrically connecting each first active terminal of the multiple layers of the memory core cells intersected by the word plane is included. A drain plane substantially orthogonal to the word plane is provided. The drain plane electrically connects each second active terminal of the multiple layers of the memory core cells intersected by the drain plane. A source plane substantially orthogonal to both the word plane and the drain plane is included. The source plane electrically connects each third active terminal of the memory core cells within a single level. In one embodiment, the memory core cells are defined by a device having three active terminals.

Provided are a method and apparatus for estimating a motion vector using a plurality of motion vector predictors, an encoder, a decoder, and a decoding method. The method includes calculating spatial similarities between the current block and the plurality of neighboring partitions around the current block, selecting at least one of the neighboring partitions based on the calculated spatial similarities, and estimating a motion vector of the selected partition as the motion vector of the current block.

The invention discloses a novel high-capacity two-dimensional barcode and a system suitable for mobile phones and special equipment, and encoding and decoding methods and applications thereof. The high-capacity two-dimensional barcode is composed of a positioning area, a positioning interval area and a data area, wherein the positioning area is composed of a positioning dotted outline border, positioning points, a positioning information unit and a timing unit; the data area is composed of a header file area and a code information area; the information compression technology, the information coding technology and the information encryption technology are used in the two-dimensional barcode; the two-dimensional barcode can control the error correction level of error correction encoding, the amount of encoding information, the compression method of the information and the encryption method of the information; and in the process of decoding, the dynamic decoding can be performed according to the header file information of the two-dimensional barcode. The two-dimensional barcode is high in capacity, can be positioned quickly so as to carry out all-round code reading, can encrypt information, and can read the information of the two-dimensional barcode by designated special decryption keys or designated decryption devices.

A method and apparatus for coding an image capable of performing a prediction coding process by using a correlation degree between neighboring pixels of a current block and neighboring pixels of a reference block, and an image decoding method and apparatus. In the method, reference block candidates having neighboring pixels similar to the neighboring pixels of the current block are selected, matching errors between selected reference block candidates and the current block are calculated, and a reference block candidate having the least matching error is determined to be a predicted block of the current block.

A picture coding apparatus (300) is a picture coding apparatus that codes a difference between picture data (Img) representing an input picture and predictive picture data (Pred) representing a predictive picture for the input picture and generates coded picture data, and includes a picture decoding unit (104) for decoding coded picture data (Img) after the picture data (Img) is coded; inter pixel filters A and B (303 and 304) for performing inter pixel filter operation for decoded picture data (Recon) obtained by the picture decoding unit (104); switches (301 and 302) for selecting one of the inter pixel filters; and an inter picture predicting unit (108) for generating the predictive picture data (Pred) for the input picture data (Img) using filtered decoded picture data (FilteredImg1), as reference picture data (Ref), obtained by the selected inter pixel filter.

There is provided a decoding device including circuitry configured to receive coded data and conversion information, the coded data pertaining to an image having luminance in a first dynamic range and the conversion information pertaining to a conversion of dynamic range of the luminance of the image from the first dynamic range into a second dynamic range; and decode the received coded data so as to generate the image, wherein the conversion uses a knee function.

Methods and apparatus are provided for improved iterative error-erasure decoding. A signal is decoded by obtaining a plurality of symbols associated with the signal and one or more corresponding reliability values; generating at least one erasure list comprised of L symbols and at least one shortened erasure list comprised of L′ symbols, where L′ is less than L; and constructing an erasure set by taking erasures from at least one of the erasure list and the shortened erasure list. A signal is also processed by generating one or more reliability values using a soft-output detector; generating an erasure list of symbols by comparing the reliability values to at least one reliability threshold value (or by sorting); and performing error erasure decoding using the erasure list. The size of the erasure list can optionally be adjusted using feedback information.

A moving picture coding apparatus includes (i) an inter-pixel filter (114) having the following filters for filtering decoded image data so as to remove block distortion which is high frequency noise around block boundaries: a filter A114a, a filter B114b, a filter C114c, a filter D114d, each having a different filtering strength, and (ii) a filter processing control unit (110) for determining a filtering strength of the inter-pixel filter (114).

A moving picture coding method for coding a picture with switching between frame coding and field coding adaptively on a block-by-block basis includes: determining the maximum number of reference indices for field coding for specifying fields which are to be referred to at the time of field coding, using the maximum number of reference indices for frame coding for specifying frames which are to be referred to at the time of frame coding; and assigning to fields the reference indices for field coding for specifying fields which are to be referred to at the time of field coding, within a range of the determined maximum number thereof, using the reference indices for frame coding for specifying frames which are to be referred to at the time of frame coding.

Provided are an image encoding method and apparatus for generating an interpolation filter using an adjacent area of a current block and a corresponding adjacent area of a reference picture and interpolating the reference picture using the generated interpolation filter, and an image decoding method and apparatus therefor. By interpolating an adjacent area of a reference picture corresponding to an adjacent area of a current block according to fractional pixel resolution of a motion vector of the current block and determining interpolation filter coefficients to minimize a difference between an interpolated adjacent area of the reference picture and the adjacent area of the current block, an interpolation filter needed for motion compensation of the current block is adaptively generated using information on the adjacent area.

An audio encoder for encoding an audio signal includes an impulse extractor for extracting an impulse-like portion from the audio signal. This impulse-like portion is encoded and forwarded to an output interface. Furthermore, the audio encoder includes a signal encoder which encodes a residual signal derived from the original audio signal so that the impulse-like portion is reduced or eliminated in the residual audio signal. The output interface forwards both, the encoded signals, i.e., the encoded impulse signal and the encoded residual signal for transmission or storage. On the decoder-side, both signal portions are separately decoded and then combined to obtain a decoded audio signal.

An algorithmic soft-decision decoding method for Reed-Solomon codes proceeds as follows. Given the reliability matrix Pi showing the probability that a code symbol of a particular value was transmitted at each position, computing a multiplicity matrix M which determines the interpolation points and their multiplicities. Given this multiplicity matrix M, soft interpolation is performed to find the non-trivial polynomial Q<HIL><PDAT>M</SB><PDAT>(X,Y) of the lowest (weighted) degree whose zeros and their multiplicities are as specified by the matrix M. Given this non-trivial polynomial Q<HIL><PDAT>M</SB><PDAT>(X,Y), all factors of Q<HIL><PDAT>M</SB><PDAT>(X,Y) of type Y-f(X) are found, where f(X) is a polynomial in X whose degree is less than the dimension k of the Reed-Solomon code. Given these polynomials f(X), a codeword is reconstructed from each of them, and the most likely of these codewords selected as the output of the algorithm. The algorithmic method is algebraic, operates in polynomial time, and significantly outperforms conventional hard-decision decoding, generalized minimum distance decoding, and Guruswami-Sudan decoding of Reed-Solomon codes. By varying the total number of interpolation points recorded in the multiplicity matrix M, the complexity of decoding can be adjusted in real time to any feasible level of performance. The algorithmic method extends to algebraic soft-decision decoding of Bose-Chaudhuri-Hocquenghem codes and algebraic-geometry codes.</PTEXT>

The invention discloses a polarization decoding method based on subsection CRC and belongs to the technical field of wireless communication channel coding. The subsection CRC (cyclic redundancy check) is utilized to improve an existing list successive elimination polarization decoding algorithm, and subsection polarization code CRC is carried out on an original information sequence at a coding end; and at a decoding end, the whole list successive elimination and decoding process is enabled to be divided into a plurality of subsections, CRC is carried out in each subsection, and unsuccessful decoding is judged according to the CRC check result or screening of ineffective paths is carried out. The subsection CRC and the list successive elimination polarization decoding algorithm are combined, so that time complexity of polarization decoding can be effectively reduced, and especially in the low SNR (signal to noise ratio) region, the time complexity of decoding is reduced obviously.