Method for reducing the search complexity in analysis-by-synthesis coding

Claim 1

A method of encoding a frame of input speech signal using a tree-code excitation codebook wherein each branch of said tree-code represents a sequence of codeletters and each full path through said tree-code represents a codeword, comprising the steps of: partitioning the speech frame into a predetermined number of sample segments of length equal to the length of each branch in a respective stage of said tree-code; performing a limited search of said tree-code to find a codeword achieving an optimal representation of said input speech signal, said search operating so that at each stage of said tree-code only a limited number of paths are saved from which further searching occurs: said limited search including at each current stage of said tree-code the steps of identifying the paths to be currently searched by extending out a predetermined number of branches from the saved paths which lead up to the current stage from a root node, filtering the respective codeletters of said extended branches with a coloring filter, minimizing an error distance measurement between a synthetic signal defined by each path being currently searched and the sequence of sample segments up to the current stage by optimizing a scaling factor of said synthetic signal, and saving those limited number of paths having the lowest distance measurements relative to the measurements of the other currently searched paths; whereby the limited searching continues into the next stage by repeating the steps of path identification, codeletter filtering, error distance minimization by optimal scaling, and path saving so that after reaching the last stage of said tree-code, the single one of the saved full paths having the lowest relative distance measurement represents the code-word achieving an optimal representation of said frame of input speech signal.

Claim 2

A method of encoding a frame of input speech signal using a tree-code excitation codebook wherein each branch of said tree-code represents a sequence of codeletters and each full path through said tree-code represents a codeword, comprising the steps of: partitioning the speech frame into a predetermined number of sample segments of length equal to the length of each branch in a respective stage of said tree-code; performing a limited search of said tree-code to find a codeword achieving an optimal representation of said input speech signal, said search operating so that at each stage of said tree-code only a limited number of paths are saved from which further searching occurs: said limited search including at each current stage of said tree-code the steps of identifying the paths to be currently searched by extending out a predetermined number of branches from the saved paths which lead up to the current stage from a root node, filtering the respective codeletters of said extended branches with a coloring filter, minimizing an error distance measurement between a synthetic signal defined by each path being currently searched and the sequence of sample segments up to the current stage by optimizing a scaling factor of said synthetic signal, and saving those limited number of paths having the lowest distance measurements relative to the measurements of the other currently searched paths; whereby the limited searching continues into the next stage by repeating the steps of path identification, codeletter filtering, error distance minimization by optimal scaling, and path saving so that after reaching the last stage of said tree-code, the single one of the saved full paths having the lowest relative distance measurement represents the code-word achieving an optimal representation of said frame of input speech signal.

Claim 4

A method of encoding a frame of input speech signal using a tree-code excitation codebook wherein each branch of said tree-code represents a sequence of codeletters and each full path of said tree-code represents a codeword, comprising the steps of: partitioning the speech frame into a predetermined number of sample segments of length equal to the length of each branch in a respective stage of said tree-code; at a current stage of said tree-code, the steps of identifying a set of test paths by extending out a predetermined number of branches from a limited number of saved paths which lead up to said current stage from a root node, filtering the respective codeletters of said extended branches with a coloring filter, minimizing an error distance measurement between a synthetic signal defined by each test path and the sequence of sample segments up to the current stage by optimizing a scaling factor of said synthetic signal, and saving those limited number of paths from said set of test paths on the basis of lowest relative distance measurements; and repeating in each subsequent stage the steps of path identification, codeletter filtering, error distance minimization by optimal scaling, and path saving so that after reaching the last stage of said tree-code, the single one of the saved full paths having the lowest relative distance measurement represents a codeword achieving an optimal representation of said frame of input speech signal.

Claim 5

A method of encoding a frame of input speech signal using a tree-code excitation codebook wherein each branch of said tree-code represents a sequence of codeletters and each full path of said tree-code represents a codeword, comprising the steps of: partitioning the speech frame into a predetermined number of sample segments of length equal to the length of each branch in a respective stage of said tree-code; at a current stage of said tree-code, the steps of identifying a set of test paths by extending out a predetermined number of branches from a limited number of saved paths which lead up to said current stage from a root node, filtering the respective codeletters of said extended branches with a coloring filter, minimizing an error distance measurement between a synthetic signal defined by each test path and the sequence of sample segments up to the current stage by optimizing a scaling factor of said synthetic signal, and saving those limited number of paths from said set of test paths on the basis of lowest relative distance measurements; and repeating in each subsequent stage the steps of path identification, codeletter filtering, error distance minimization by optimal scaling, and path saving so that after reaching the last stage of said tree-code, the single one of the saved full paths having the lowest relative distance measurement represents a codeword achieving an optimal representation of said frame of input speech signal.

Claim 7

A method of encoding a frame of input speech by performing a limited search of a tree-code, said search using a tree-code excitation codebook wherein each branch of said tree-code represents a sequence of codeletters and each full path through said tree-code represents a codeword, and wherein said speech frame is partitioned into a predetermined number of sample segments of length equal to the length of each branch in a respective stage of said tree-code, comprising at each successive stage of said tree-code the steps of: identifying a set of current test paths by extending out a predetermined number of branches from a limited number of saved paths which lead up to the current stage from a root node of said tree-code; filtering the respective codeletters of said extended branches with a coloring filter; minimizing an error distance measurement between a synthetic signal defined by each current test path and the sequence of sample segments up to the current stage by optimizing a scaling factor of said synthetic signal; and saving those limited number of test paths having the lowest distance measurements relative to the measurements of the other current test paths; whereby the single one of the saved full paths having the lowest distance measurement represents a codeword achieving an optimal representation of said frame of input speech signal.

Claim 8

A method of encoding a frame of input speech by performing a limited search of a tree-code, said search using a tree-code excitation codebook wherein each branch of said tree-code represents a sequence of codeletters and each full path through said tree-code represents a codeword, and wherein said speech frame is partitioned into a predetermined number of sample segments of length equal to the length of each branch in a respective stage of said tree-code, comprising at each successive stage of said tree-code the steps of: identifying a set of current test paths by extending out a predetermined number of branches from a limited number of saved paths which lead up to the current stage from a root node of said tree-code; filtering the respective codeletters of said extended branches with a coloring filter; minimizing an error distance measurement between a synthetic signal defined by each current test path and the sequence of sample segments up to the current stage by optimizing a scaling factor of said synthetic signal; and saving those limited number of test paths having the lowest distance measurements relative to the measurements of the other current test paths; whereby the single one of the saved full paths having the lowest distance measurement represents a codeword achieving an optimal representation of said frame of input speech signal.

Claim 10

A method of encoding a frame of input speech signal using a tree-code excitation codebook having a plurality of nodes arranged in cascaded stages and interconnected by branches, wherein each branch represents a sequence of code-letters and a node sequence through all of said stages represents a codeword, comprising the steps of: partitioning the speech frame into a predetermined number of sample segments of length equal to the length of each branch in a respective stage of said tree-code; at a current stage of said tree-code, the steps of visiting a predetermined number of branches each extending out from a node belonging to a saved node sequence linked to a root node, wherein each branch extension creates a respective nodal test link, filtering the respective codeletters of said extended branches with a coloring filter, minimizing an error distance measurement between a synthetic signal defined by each nodal test link and the sequence of sample segments up to the current stage by optimizing a scaling factor of said synthetic signal, and saving those limited number of node sequences which correspond to the nodal test links having the lowest relative distance measurements; and repeating in each subsequent stage the steps of branch visiting, codeletter filtering, error distance minimization by optimal scaling, and node sequence saving so that after reaching the last stage of said tree-code, the single one of the saved node sequences having the lowest relative distance measurement represents a codeword achieving an optimal representation of said frame of input speech signal.

Claim 11

A method of encoding a frame of input speech signal using a tree-code excitation codebook having a plurality of nodes arranged in cascaded stages and interconnected by branches, wherein each branch represents a sequence of code-letters and a node sequence through all of said stages represents a codeword, comprising the steps of: partitioning the speech frame into a predetermined number of sample segments of length equal to the length of each branch in a respective stage of said tree-code; at a current stage of said tree-code, the steps of visiting a predetermined number of branches each extending out from a node belonging to a saved node sequence linked to a root node, wherein each branch extension creates a respective nodal test link, filtering the respective codeletters of said extended branches with a coloring filter, minimizing an error distance measurement between a synthetic signal defined by each nodal test link and the sequence of sample segments up to the current stage by optimizing a scaling factor of said synthetic signal, and saving those limited number of node sequences which correspond to the nodal test links having the lowest relative distance measurements; and repeating in each subsequent stage the steps of branch visiting, codeletter filtering, error distance minimization by optimal scaling, and node sequence saving so that after reaching the last stage of said tree-code, the single one of the saved node sequences having the lowest relative distance measurement represents a codeword achieving an optimal representation of said frame of input speech signal.

Claim 13

A method of encoding a speech signal, comprising the steps of: constructing a multi-stage tree-codebook having a plurality of nodes, wherein each node has a desired number of descending branches each extending to a respective succeeding node; each of said branches having a respective number of codeletters assigned to said branch, wherein a sequence of codeletters is represented in said tree by a connection of nodes defining a respective path; generating at a current stage of said tree a set of codewords each defined by a sequence of codeletters represented in the tree as a saved path leading up to said current stage and extended out to a next stage by a one of the respective descending branches; filtering the respective codeletters of said extended descending branches; minimizing an error distance measurement between a speech sample and a synthetic signal corresponding to each of said generated codewords by optimizing a scaling factor of said synthetic signal; storing a limited number of said generated codewords based on lowest relative error distance measurement, wherein a tree path corresponding to each stored codeword serves as a saved path as said generating step advances to a next stage in said tree-codebook.

Claim 14

A method of encoding a speech signal, comprising the steps of: constructing a multi-stage tree-codebook having a plurality of nodes, wherein each node has a desired number of descending branches each extending to a respective succeeding node; each of said branches having a respective number of codeletters assigned to said branch, wherein a sequence of codeletters is represented in said tree by a connection of nodes defining a respective path; generating at a current stage of said tree a set of codewords each defined by a sequence of codeletters represented in the tree as a saved path leading up to said current stage and extended out to a next stage by a one of the respective descending branches; filtering the respective codeletters of said extended descending branches; minimizing an error distance measurement between a speech sample and a synthetic signal corresponding to each of said generated codewords by optimizing a scaling factor of said synthetic signal; storing a limited number of said generated codewords based on lowest relative error distance measurement, wherein a tree path corresponding to each stored codeword serves as a saved path as said generating step advances to a next stage in said tree-codebook.