# US 2013/0154857 A1 · Decoding device and coding method

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2013/0154857 A1
- Document ID: US20130154857A1
- Status: Published application
- Kind: A1
- Application number: 13/607,115
- Filed: 2012-09-07
- Published: 2013-06-20
- Earliest claimed: 2011-12-15
- Assignees: Kabushiki Kaisha Toshiba
- Inventors: Sohei KUSHIDA; Takashi Takemoto
- Web page: https://patentgrep.com/patent/US20130154857A1

## CPC

- H03M 7/00: Conversion of a code where information is represented by a given sequence or number of digits to a code where the same {, similar or subset of} information is represented by a different sequence or number of digits
- H03M 7/4018: {Context adapative binary arithmetic codes [CABAC]}
- H03M: CODING; DECODING; CODE CONVERSION IN GENERAL (using fluidic means F15C4/00; optical analogue/digital converters G02F7/00; coding, decoding or code conversion, specially adapted for particular applications, see the relevant subclasses, e.g. G01D, G01R, G06F, G06T, G09G, G10L, G11B, G11C, H04B, H04L, H04M, H04N; ciphering or deciphering for cryptography or other purposes involving the need for secrecy G09C)

## Abstract

A decoding device has a buffer configured in memory to store N code streams and N decoders connected in series. Each of N decoders decodes a corresponding code steam and sequentially generates partial symbols of M bit width each unit cycle. Among the N decoders, i (i>=2) stage decoders stores multiple probabilistic models in the memory. In each unit cycle, the decoder receives an input of i−1 partial symbols which contains partial symbols generated by the i−1 stage decoder in the former unit cycle, selects one probabilistic model among the multiple probabilistic models based on i−1 partial symbols which are entered previously, generates one partial symbol using previously selected probabilistic models, and outputs the previously generated one partial symbol along with previously entered i−1 partial symbols.

## Claims

### Claim 1

A decoding device comprising:
a buffer configured in memory to store N (N is a positive integer) code streams; and
N decoders connected in series, each of the N decoders having a one-to-one correspondence with one of the N code streams, and being configured to decode the corresponding code stream and sequentially generate partial symbols of M bit width (M is a positive integer) per each unit cycle,
wherein among the N decoders, i (2<=i<=N, i is a positive integer) stage decoders store multiple probabilistic models in the memory; and
wherein, in each unit cycle, an i stage decoder receives an input of i−1 partial symbols which are partial symbols generated by an i−1 stage decoder in the former unit cycle, selects one probabilistic model among the multiple probabilistic models based on i−1 partial symbols which are entered previously, generates one partial symbol using previously selected probabilistic models, and outputs the previously generated one partial symbol along with the previously entered i−1 partial symbols.

### Claim 2 (depends on 1)

The decoding device according to claim 1, wherein the i stage decoder connects the one partial symbol to the end of the i−1 partial symbols which are input.

### Claim 3 (depends on 2)

The decoding device according to claim 2, wherein
the i stage decoder updates selected probabilistic models per unit cycle and on the basis of one partial symbol.

### Claim 4 (depends on 3)

The decoding device according to claim 3, wherein
each of the N code streams is data generated by every partially symbol coding source data which is structured by arranging unit symbols consisting of N partial symbols in multiples, and
a N code stream corresponding to the i stage decoder ranges from a top symbol of the unit symbols to i−1 of the partial symbol and comprise data that are decoded using probabilistic models set on the basis partial symbols from the top symbol of the unit symbols to i−1 among the multiple probabilistic models having the i stage decoder.

### Claim 5 (depends on 4)

The decoding device according to claim 4, wherein
a first stage decoder among the N decoders generates the partial symbols using the predetermined probabilistic models which differ from the probabilistic models stored in a second stage and higher stages in the memory, and outputs the generated partial symbols.

### Claim 6

A coding method implemented by a processing unit of a computing device, comprising:
encoding stages in which one of N code streams is generated by encoding multiple unit symbols each having an N×M bit width (N, M both are positive integers) in such a way that i (1<=i<=N) partial symbol from a top symbol of unit symbols pertains to the i code stream; wherein
the step of encoding is performed by the processing unit;
at the time of encoding one partial symbol, in which a hierarchical structure of N-level hierarchy which connects multiple probabilistic models and each hierarchy of the relevant hierarchical structure corresponds one-to-one to each of the N code streams;
one of the stages is a specific stage which specifies one of the multiple probabilistic models on the basis of the hierarchical structure connected in such a way that probabilistic models which pertain to a leaf side of the relevant hierarchical structure is specified on the basis of the value of the other corresponding partial symbol which pertain to a unit symbol which is similar to one partial symbol encoded using probabilistic models pertaining to the lateral side hierarchy and probabilistic models pertaining to the relevant lateral side; and
the step of encoding includes a separate encoding step in which the previous partial symbol is encoded using previously specified probabilistic models.