Methods of reducing the complexity of trellis-based scalar-vector quantizers
First Claim
1. A method of reducing constellation complexity of a trellis-based scalar-vector quantizer for a memoryless data source in a communication system, comprising the steps of:
- defining an unbounded set of reproduction symbols in which neighboring symbols are distanced from each other by a predetermined factor;
grouping the set of said reproduction symbols into a region;
assigning a norm value to the region and determining a threshold norm value for the region;
bounding the region to an element in the region wherein the element is the largest element in the region with respect to the norm of the region; and
determining a parameter for the region as a function of the norm of the region which minimizes shape distortion of the region, thereby reducing the complexity of the trellis-based scalar-vector quanitizer for the source and optimally shaping the constellation, wherein the memoryless source is a Gaussian source and the unbounded set of reproduction symbols is denoted as Q and is defined as;
1 Assignment
0 Petitions
Accused Products
Abstract
Methods of a reducing the complexity of Trellis-Based Scalar-Vector Quantizer (TB-SVQ) includes the initial step of defining an unbounded set of reproduction symbols in which neighboring symbols are distanced from each other by a predetermined factor. The set of the representation symbols is grouped into a region and a norm value is assigned to the region. A threshold value for the norm is then determined and the region is bound to an element in the region with respect to the norm of the region. A region parameter is then determined as a function of the norm of the region to minimize the shape gain of the region and to thereby reduce the complexity of the TB-SVQ for the source and optimally shape a constellation associated with the region. The inventive methods achieve a shaping gain of substantially 1.53 dB which is the theoretical limit of shaping gain. Thus, these methods optimally shape the constellation and achieve highly efficient data transmission.
11 Citations
5 Claims
-
1. A method of reducing constellation complexity of a trellis-based scalar-vector quantizer for a memoryless data source in a communication system, comprising the steps of:
-
defining an unbounded set of reproduction symbols in which neighboring symbols are distanced from each other by a predetermined factor;
grouping the set of said reproduction symbols into a region;
assigning a norm value to the region and determining a threshold norm value for the region;
bounding the region to an element in the region wherein the element is the largest element in the region with respect to the norm of the region; and
determining a parameter for the region as a function of the norm of the region which minimizes shape distortion of the region, thereby reducing the complexity of the trellis-based scalar-vector quanitizer for the source and optimally shaping the constellation, wherein the memoryless source is a Gaussian source and the unbounded set of reproduction symbols is denoted as Q and is defined as;
- View Dependent Claims (2, 3, 4, 5)
-
Specification