# US 6,731,685 B1 · Method and apparatus for determining a bit rate need parameter in a statistical multiplexer

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

- Number: US 6,731,685 B1
- Document ID: US6731685B1
- Status: Granted
- Kind: B1
- Application number: 09/665,373
- Filed: 2000-09-20
- Granted: 2004-05-04
- Earliest claimed: 2000-09-20
- Assignees: General Instrument Corporation
- Inventors: Vincent Liu; Siu-Wai Wu; Hanson On; Robert S. Nemiroff; Michael Casteloes; Jing Yang Chen; Rebecca Lam
- Web page: https://patentgrep.com/patent/US6731685B1

## CPC

- H04N 21/4344: {Remultiplexing of multiplex streams, e.g. by modifying time stamps or remapping the packet identifiers}
- H04J 3/1688: {the demands of the users being taken into account after redundancy removal, e.g. by predictive coding, by variable sampling (reducing bandwidth of signals in general H04B1/66; in PCM-systems H04B14/046; removal of redundancy in telegraph communication H03M7/30)}
- H04N 19/115: Selection of the code volume for a coding unit prior to coding
- H04N 19/137: Motion inside a coding unit, e.g. average field, frame or block difference
- H04N 19/14: Coding unit complexity, e.g. amount of activity or edge presence estimation (H04N19/146 takes precedence)
- H04N 19/159: Prediction type, e.g. intra-frame, inter-frame or bidirectional frame prediction
- H04N 19/172: the region being a picture, frame or field
- H04N 19/196: being specially adapted for the computation of encoding parameters, e.g. by averaging previously computed encoding parameters (processing of motion vectors H04N19/513)
- H04N 19/198: {including smoothing of a sequence of encoding parameters, e.g. by averaging, by choice of the maximum, minimum or median value}
- H04N 19/577: Motion compensation with bidirectional frame interpolation, i.e. using B-pictures
- H04N 19/61: in combination with predictive coding
- H04N 21/23608: {Remultiplexing multiplex streams, e.g. involving modifying time stamps or remapping the packet identifiers}
- H04N 21/2365: Multiplexing of several video streams
- H04N 21/23655: {Statistical multiplexing, e.g. by controlling the encoder to alter its bitrate to optimize the bandwidth utilization}
- H04N 21/4347: {Demultiplexing of several video streams}
- H04N: PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04J: MULTIPLEX COMMUNICATION (transmission in general H04B; peculiar to transmission of digital information H04L5/00; systems for the simultaneous or sequential transmission of more than one television signal H04N7/08; in exchanges H04Q11/00; stereophonic systems H04S)

## Abstract

A statistical multiplexer for coding and multiplexing multiple channels of digital television data, or multiple panels of HDTV digital television data. A bit rate need parameter is determined for each encoder in a stat mux group by scaling the complexities of previous pictures of the same and different picture types. Scaling factors based on an activity level, motion estimation score, and number of pictures of a certain type in a GOP, may be used. Moreover, the scaling factors may be bounded based on a linear or non-linear operator to prevent large variations in the factors. An encoding bit rate is allocated to each channel based on its need parameter.

## Claims

### Claim 1

A method for allocating bits in a statistical multiplexer for coding a plurality of channels of video data sources comprising respective video pictures, comprising the steps of:
for each channel, obtaining a bit rate need parameter for a current picture, which has an associated picture type, by scaling at least one complexity measure that is based on at least one previous picture of the same type, and by scaling at least one complexity measure that is based on at least one previous picture of a different type; and
allocating an encoding bit rate for coding the current picture of each channel according to the bit rate need parameter thereof.

### Claim 2 (depends on 1)

The method of claim 1, wherein:
for at least one of the channels, when the current picture is an I-picture, the bit rate need parameter thereof is obtained by scaling a complexity measure of a previous I-picture, an average complexity measure for a plurality of previous P-pictures, and an average complexity measure for a plurality of previous B-pictures.

### Claim 3 (depends on 2)

The method of claim 2, wherein:
for at least one of the channels, the complexity measure of the previous I-picture is scaled according to a ratio of: (a) an activity level of the current picture to (b) an average activity level of a plurality of previous pictures.

### Claim 4 (depends on 2)

The method of claim 2, wherein:
the average complexity measure of the plurality of previous P-pictures is scaled according to a number of P-pictures in a current group of pictures (GOP).

### Claim 5 (depends on 2)

The method of claim 2, wherein:
the average complexity measure of the plurality of previous B-pictures is scaled according to a number of B-pictures in a current group of pictures (GOP).

### Claim 6 (depends on 1)

The method of claim 1, wherein:
for at least one of the channels, when the current picture is a P-picture, the bit rate need parameter thereof is obtained by scaling a complexity measure of an I-picture in a current group of pictures (GOP), an average complexity measure for a plurality of previous P-pictures, and an average complexity measure for a plurality of previous B-pictures.

### Claim 7 (depends on 6)

The method of claim 6, wherein:
the complexity measure of the I-picture is scaled according to a ratio of: (a) an activity level of the current picture to (b) an activity level of the I-picture.

### Claim 8 (depends on 6)

The method of claim 6, wherein:
the average complexity measure for the plurality of previous P-pictures is scaled according to a ratio of: (a) a motion estimation score of the current picture to (b) an average motion estimation score for the plurality of previous P-pictures.

### Claim 9 (depends on 6)

The method of claim 6, wherein:
the average complexity measure for the plurality of previous P-pictures is scaled according to a number of P-pictures in the current GOP.

### Claim 10 (depends on 6)

The method of claim 6, wherein:
the average complexity measure for the plurality of previous B-pictures is scaled according to a number of B-pictures in the current GOP.

### Claim 11 (depends on 1)

The method of claim 1, wherein:
for at least one of the channels, when the current picture is a B-picture, the bit rate need parameter thereof is obtained by scaling a complexity measure of an I-picture in a current group of pictures (GOP), an average complexity measure for a plurality of previous P-pictures, and an average complexity measure for a plurality of previous B-pictures.

### Claim 12 (depends on 11)

The method of claim 11, wherein:
the complexity measure of the I-picture is scaled according to a ratio of: (a) an activity level of the current picture to (b) an activity level of the I-picture.

### Claim 13 (depends on 11)

The method of claim 11, wherein:
the average complexity measure for the plurality of previous P-pictures is scaled according to a number of P-pictures in the current GOP.

### Claim 14 (depends on 11)

The method of claim 11, wherein:
the average complexity measure for the plurality of previous B-pictures is scaled according to a ratio of: (a) a motion estimation score of the current picture to (b) an average motion estimation score for the plurality of previous B-pictures.

### Claim 15 (depends on 11)

The method of claim 11, wherein:
the average complexity measure for the plurality of previous B-pictures is scaled according to a number of B-pictures in the current GOP.

### Claim 16 (depends on 1)

The method of claim 1, wherein:
for at least one of the channels, when the current picture is a P-picture in a scene change group of pictures (GOP), the bit rate need parameter thereof is obtained by scaling an average complexity measure for a plurality of previous P-pictures, and an average complexity measure for a plurality of previous B-pictures, by a ratio of (a) a motion estimation score of the current picture to (b) an average motion estimation score for the plurality of previous P-pictures.

### Claim 17 (depends on 1)

The method of claim 1, wherein:
for at least one of the channels, when the current picture is a B-picture in a scene change group of pictures (GOP), the bit rate need parameter thereof is obtained by scaling an average complexity measure for a plurality of previous P-pictures, and an average complexity measure for a plurality of previous B-pictures, by a ratio of (a) a motion estimation score of the current picture to (b) an average motion estimation score for the plurality of previous B-pictures.

### Claim 18 (depends on 1)

The method of claim 1, comprising the further step of:
for at least one of the channels, bounding at least one of the scaled complexity measures according to at least one of a non-linear and linear function.

### Claim 19 (depends on 1)

The method of claim 1, comprising the further step of:
for at least one of the channels, temporally filtering the need parameters for a channel to reduce picture-to-picture fluctuations thereof.

### Claim 20 (depends on 1)

The method of claim 1, comprising the further step of:
for at least one of the channels, providing an adjustment factor for the need parameter for at least one of fading, low brightness level, low amount of movement, and fullness level of a buffer that receives the pictures after coding thereof.

### Claim 21 (depends on 20)

The method of claim 20, wherein:
the adjustment factor increases the need parameter for at least one of fading, low brightness level, and low amount of movement.

### Claim 22 (depends on 1)

The method of claim 1, wherein:
at least one of the channels comprises high-definition television (HDTV) data;
the current picture of the HDTV channel is sub-divided into panels that are encoded in parallel at respective encoders;
a bit rate need parameter is obtained for each panel; and
a bit rate need parameter of the HDTV channel is obtained by summing the bit rate need parameters of each panel thereof.

### Claim 23 (depends on 1)

The method of claim 1, wherein:
for at least one of the channels, the bit rate need parameter is obtained, at least in part, by scaling a weighted average of complexity measures for a plurality of previous pictures.

### Claim 24

An apparatus for allocating bits in a statistical multiplexer for coding a plurality of channels of video data sources comprising respective video pictures, comprising:
means for obtaining, for each channel, a bit rate need parameter for a current picture, which has an associated picture type, by scaling at least one complexity measure that is based on at least one previous picture of the same type, and by scaling at least one complexity measure that is based on at least one previous picture of a different type; and
means for allocating an encoding bit rate for coding the current picture of each channel according to the bit rate need parameter thereof.

### Claim 25 (depends on 24)

The apparatus of claim 24, wherein:
for at least one of the channels, when the current picture is an I-picture, the bit rate need parameter thereof is obtained by scaling a complexity measure of a previous I-picture, an average complexity measure for a plurality of previous P-pictures, and an average complexity measure for a plurality of previous B-pictures.

### Claim 26 (depends on 25)

The apparatus of claim 25, wherein:
for at least one of the channels, the complexity measure of the previous I-picture is scaled according to a ratio of: (a) an activity level of the current picture to (b) an average activity level of a plurality of previous pictures.

### Claim 27 (depends on 25)

The apparatus of claim 25, wherein:
the average complexity measure of the plurality of previous P-pictures is scaled according to a number of P-pictures in a current group of pictures (GOP).

### Claim 28 (depends on 25)

The apparatus of claim 25, wherein:
the average complexity measure of the plurality of previous B-pictures is scaled according to a number of B-pictures in a current group of pictures (GOP).

### Claim 29 (depends on 24)

The apparatus of claim 24, wherein:
for at least one of the channels, when the current picture is a P-picture, the bit rate need parameter thereof is obtained by scaling a complexity measure of an I-picture in a current group of pictures (GOP), an average complexity measure for a plurality of previous P-pictures, and an average complexity measure for a plurality of previous B-pictures.

### Claim 30 (depends on 29)

The apparatus of claim 29, wherein:
the complexity measure of the I-picture is scaled according to a ratio of: (a) an activity level of the current picture to (b) an activity level of the I-picture.

### Claim 31 (depends on 29)

The apparatus of claim 29, wherein:
the average complexity measure for the plurality of previous P-pictures is scaled according to a ratio of: (a) a motion estimation score of the current picture to (b) an average motion estimation score for the plurality of previous P-pictures.

### Claim 32 (depends on 29)

The apparatus of claim 29, wherein:
the average complexity measure for the plurality of previous P-pictures is scaled according to a number of P-pictures in the current GOP.

### Claim 33 (depends on 29)

The apparatus of claim 29, wherein:
the average complexity measure for the plurality of previous B-pictures is scaled according to a number of B-pictures in the current GOP.

### Claim 34 (depends on 24)

The apparatus of claim 24, wherein:
for at least one of the channels, when the current picture is a B-picture, the bit rate need parameter thereof is obtained by scaling a complexity measure of an I-picture in a current group of pictures (GOP), an average complexity measure for a plurality of previous P-pictures, and an average complexity measure for a plurality of previous B-pictures.

### Claim 35 (depends on 34)

The apparatus of claim 34, wherein:
the complexity measure of the I-picture is scaled according to a ratio of: (a) an activity level of the current picture to (b) an activity level of the I-picture.

### Claim 36 (depends on 34)

The apparatus of claim 34, wherein:
the average complexity measure for the plurality of previous P-pictures is scaled according to a number of P-pictures in the current GOP.

### Claim 37 (depends on 34)

The apparatus of claim 34, wherein:
the average complexity measure for the plurality of previous B-pictures is scaled according to a ratio of: (a) a motion estimation score of the current picture to (b) an average motion estimation score for the plurality of previous B-pictures.

### Claim 38 (depends on 34)

The apparatus of claim 34, wherein:
the average complexity measure for the plurality of previous B-pictures is scaled according to a number of B-pictures in the current GOP.
