Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Pulse codec method and pulse codec

A pulse coding and pulse technology, used in instruments, code conversion, speech analysis, etc., can solve the problems of waste of coding bits, accumulation of coding index redundancy, and large computational complexity, and achieve the effect of saving coding bits.

Active Publication Date: 2011-12-28
HUAWEI TECH CO LTD
View PDF5 Cites 6 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0035] In the process of proposing the present invention, the inventor found that the algebraic pulse coding method provided by AMR_WB+ adopts similar recursive coding logic to split the situation with a large number of coded pulses into several cases with a small number of coded pulses. The computational complexity is large, and at the same time, as the number of coded pulses on the track increases, the redundancy of the coded index will gradually accumulate, which is likely to cause a waste of coded bits

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Pulse codec method and pulse codec
  • Pulse codec method and pulse codec
  • Pulse codec method and pulse codec

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0064] Embodiment 1. A pulse encoding method, such as figure 1 shown, including:

[0065] A1. Obtain pulses to be encoded on T tracks, where T is an integer greater than or equal to 2.

[0066] The total number of pulses that need to be encoded on each of the T tracks is usually determined according to the code rate. The more pulses that need to be encoded, the more bits are required for the encoding index and the higher the code rate. In this paper, pulse_num t Indicates the total number of pulses that need to be encoded on the t-th track, assuming The total number of pulses on each track jointly encoded can be the same or different.

[0067] A2. Count the pulses that need to be encoded on each track according to their positions, and obtain the number N of pulse positions on each track t , the distribution of pulsed positions on the track and the number of pulses at each pulsed position.

[0068] In this article:

[0069] to pos_num t Indicates the number of pulse po...

Embodiment 2

[0124] Embodiment 2. A pulse encoding method. In this embodiment, each track of the joint encoding is calculated for its respective index, and then combined into an encoding index, such as image 3 shown, including steps:

[0125] B1. Obtain pulses to be encoded on T tracks, where T is an integer greater than or equal to 2.

[0126] B2, count the pulses that need to be encoded on each track according to their positions, and obtain the number N of pulse positions on each track t , the distribution of pulsed positions on the track and the number of pulses at each pulsed position.

[0127] Steps B1 and B2 can be performed with reference to steps A1 and A2 of Embodiment 1.

[0128] B3. Determine the first index I1 of each track according to the number of pulse positions on each track respectively t , the first index I1 t Corresponding to the number of pulse positions it represents, all possible distributions of pulse positions on the track.

[0129] B4. Determine the second i...

Embodiment 3

[0139] Embodiment 3. A pulse coding method. This embodiment is based on Embodiment 1 or 2 and proposes a method for further saving coding bits.

[0140] The encoding index Ind generation process of the pulse encoding method in this embodiment can be performed with reference to the method in the first or second embodiment, and the following operations are performed after the encoding index Ind is generated, such as Figure 4 shown, including:

[0141] C1. Comparing the coding index Ind and adjusting the threshold value THR, wherein,

[0142] THR≤2 Bmax -I max (T),

[0143] I max (T) represents the upper limit of Ind, Bmax represents the upper limit of the number of bits used to encode the coding index, if Ind is less than THR, then go to step C2, otherwise go to step C3.

[0144] C2. Encode Ind by using the first number of encoding bits.

[0145] C3, using the second number of coded bit pairs plus an offset value THR 0 Ind is encoded, THR≤THR 0 ≤2 Bmax -I max (T), the...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The embodiment of the invention discloses a pulse coding and decoding method and a pulse codec. In the embodiment of the invention, idle code book spaces can be combined at the time of joint coding under the condition of single track coding so as to become coding bits which can be saved by using joint coding of more than two tracks and pulses required to be coded on the tracks are combined according to positions, the number of positions with pulses, the distribution of the positions with the pulses on the tracks and the pulse number at each position with the pulse are respectively coded, so that respective coding of the plurality of pulses at the same position is avoided, thus more coding bits are saved.

Description

technical field [0001] The invention relates to a pulse codec method and a pulse codec. Background technique [0002] In vector coding technology, algebraic codebooks are often used to quantize and code the residual signal after adaptive filtering. After searching and obtaining the position and symbol information of the best algebraic codebook pulse on the track, the corresponding index value is obtained through encoding calculation, so that the decoder can reconstruct the pulse sequence according to the index value. Under the premise of ensuring lossless reconstruction, minimizing the bits needed to encode the index value is one of the main goals of the research and development of the algebraic codebook pulse coding method. [0003] Taking a better coding method in speech coding—AMR WB+ (Adaptive Multi-Rate Wideband) coding method as an example, a specific coding method adopted by the existing algebraic code book pulse is illustrated. . According to the different encodin...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
IPC IPC(8): H04L1/00H03M7/30G10L19/107
CPCG10L19/12G10L19/107G10L19/10G10L19/24G10L19/00G10L19/008G10L19/002
Inventor 马付伟张德军
Owner HUAWEI TECH CO LTD
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com