US5333191A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Detection of multifrequency tone signals
Assignee: InterDigital Technology Corp
•
Filing: 1993-04-22
•
Granted: 1994-07-26
•
Expires: 2013-04-22
Abstract
Abstract A method of operating a digital signal processor to detect DTMF tones in a digital voice telephone system in which the digitally encoded signals appearing on the telephone channel are decimated to compress the spectrum to be monitored for the appearance of call signalling tones. The signals received in a decimated block are "correlated" or convolved with one another on a forward and backward time-shifted basis and each forward and backward correlation product is summed to form the elements of a 5×5 modified covariance matrix. The modified covariance matrix exhibits the desirable property that its eigenvectors will be symmetric. Since all eigenvectors of the modified covariance matrix are orthogonal and the eigenvectors associated with the signal span the signal subspace, the signal subspace is orthogonal to the eigenvector associated with the noise. The dot product of the noise eigenvector with the signal subspace is set to zero. The roots of the resultant polynomial identify the frequencies of the DTMF tones, if in fact the same were present in the received signal. The noise and signal eigenvectors of the modified covariance matrix are more quickly and efficiently determined and advantageously, on a "real time" basis, by partitioning the modified covariance matrix into conjugate and anti-conjugate submatrices. The conjugate matrix is inverted and its eigenvalues determined, advantageously by applying the well-known power method. The largest eigenvalue of the inverted conjugate submatrix is related to the smallest eigenvalue of the original modified covariance matrix. When appropriate tones are being received this last-mentioned eigenvector should be the eigenvector associated with the noise. After determining the noise eigenvector the product of the signal space vector and the noise eigenvector is set to zero and the roots of the resultant polynomial are identified as the frequencies of the DTMF tones, advantageously through the use of a fast search technique.
Inventors
- 👤 Brian M. McCarthy
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-01 18:33
CPC Classifications
H; H04; H04Q; H04Q1/00; H04Q1/18; H04Q1/30; H04Q1/44; H04Q1/444; H04Q1/45; H04Q1/457; H04L; H04L27/00; H04L27/26; H04L27/30
Claims Analysis
Total Claims: 15
Claim 1
Independent Claim
185 words
In a digital signal processor, a method of detecting digitally encoded multifrequency tones appearing as n complex frequencies in a block of sequential code word signals, said block including voice and tone information as well as noise, comprising the steps of: a. decimating said block of code word signals to increase the noise component thereof; b. correlating each of said code word signals of said decimated block with itself and with adjacent and more distant code word signals in said decimated block on a forward and backward basis to define a data structure having the elements of a modified covariance data matrix R whose rank is equal to one more than the number of said complex frequencies, c. partitioning said matrix R into conjugate and anticonjugate submatrices, d. inverting said conjugate submatrix, e. isolating the noise eigenvector of said covariance matrix R by employing the eigenvector associated with the largest eigenvalue of said inverted conjugate submatrix, f. forming a polynomial from the dot product of the noise eigenvector with the signal; and g. determining the zero crossings of said polynomial to identify said multifrequency tones.
Claim 2
Dependent Claim
185 words
In a digital signal processor, a method of detecting digitally encoded multifrequency tones appearing as n complex frequencies in a block of sequential code word signals, said block including voice and tone information as well as noise, comprising the steps of: a. decimating said block of code word signals to increase the noise component thereof; b. correlating each of said code word signals of said decimated block with itself and with adjacent and more distant code word signals in said decimated block on a forward and backward basis to define a data structure having the elements of a modified covariance data matrix R whose rank is equal to one more than the number of said complex frequencies, c. partitioning said matrix R into conjugate and anticonjugate submatrices, d. inverting said conjugate submatrix, e. isolating the noise eigenvector of said covariance matrix R by employing the eigenvector associated with the largest eigenvalue of said inverted conjugate submatrix, f. forming a polynomial from the dot product of the noise eigenvector with the signal; and g. determining the zero crossings of said polynomial to identify said multifrequency tones.
Claim 3
Dependent Claim
38 words
The method of claim 1 further comprising the steps of determining the two smallest eigenvalues of said modified covariance matrix and inhibiting said identification when the ratio of said two smallest eigenvalues is less than a predetermined amount.
Claim 4
Dependent Claim
33 words
The method of claim 2 wherein said smallest eigenvalues of said modified covariance matrix are determined by computing the smallest eigenvalue of said anticonjugate matrix and the smallest eigenvalue of said conjugate matrix.
Claim 5
Dependent Claim
35 words
The method of claim 1 wherein said forward and backward correlating of said code word signals includes correlating said code word signals separated from each other by up to n of said code word signals.
Claim 6
Dependent Claim
68 words
The method of claim 1 wherein elements r 0i of said modified covariance matrix are determined according to: ##EQU13## where d j is one of said code word signals, and elements r ik of said modified covariance matrix are determined according to: r.sub.ik =r.sub.i-1, k-1 +d.sub.n-i d.sub.n-k -d.sub.jmax-i d.sub.jmax-k -d.sub.i-1 d.sub.k-1 +d.sub.jmax-n-1+i d.sub.jmax-n-1+k for k=i, . . . , n-i and i=1, . . . , n/2 .
Claim 7
Dependent Claim
15 words
The method of claim 1 wherein n=4 and said matrix R is of rank 5.
Claim 8
Independent Claim
128 words
A method of operating a digital signal processor to detect two digitally encoded multifrequency signals in a sampled block of sequential code words comprising the steps of: a. correlating pairs said code words of said block including all code words separated from each other by zero, one, two and three code words to define the elements of a 5×5 modified covariance data matrix; b. partitioning said matrix into conjugate and anticonjugate submatrices, c. inverting said conjugate submatrix; d. determining the noise eigenvector of said covariance matrix R from the eigenvector associated with the largest eigenvalue of said inverted conjugate submatrix; e. forming a polynomial from the product of the noise eigenvector with the signal; and f. determining the zero crossings of said polynomial to identify said multifrequency signals.
Claim 9
Independent Claim
128 words
A method of operating a digital signal processor to detect two digitally encoded multifrequency signals in a sampled block of sequential code words comprising the steps of: a. correlating pairs said code words of said block including all code words separated from each other by zero, one, two and three code words to define the elements of a 5×5 modified covariance data matrix; b. partitioning said matrix into conjugate and anticonjugate submatrices, c. inverting said conjugate submatrix; d. determining the noise eigenvector of said covariance matrix R from the eigenvector associated with the largest eigenvalue of said inverted conjugate submatrix; e. forming a polynomial from the product of the noise eigenvector with the signal; and f. determining the zero crossings of said polynomial to identify said multifrequency signals.
Claim 10
Dependent Claim
37 words
The method of claim 7 further comprising the steps of determining the two smallest eigenvalues of said anticonjugate submatrix and inhibiting said identification when the ratio of said two smallest eigenvectors is less than a predetermined amount.
Claim 11
Independent Claim
219 words
A method of detecting digitally encoded multifrequency signals in the presence of noise, said multifrequency signal being represented by n complex frequencies, comprising the steps of: a. sampling the signals to form a block of jmax sequential code words d j ; b. correlating each code word of said block with itself and with adjacent and more distant code words on a forward and backward basis to define the elements r 0i and r ik of an (n+1) by (n+1) modified covariance data matrix R, said elements r 0i being determined according to ##EQU14## and said elements r ik being determined by: r.sub.ik =r.sub.i-1, k-1 +d.sub.n-i d.sub.n-k -d.sub.jmax-i d.sub.jmax-k -d.sub.i-1 d.sub.k-1 +d.sub.jmax-n-1+i d.sub.jmax-n-1+k, for k=i, . . . ,n-i and i=1, . . . , n/2 ; c. partitioning said matrix R into a conjugate and anticonjugate submatrices and inverting the conjugate submatrix; d. isolating the noise vector of said covariance matrix R by determining the eigenvector associated with the largest eigenvalue of the inverted conjugate submatrix; e. forming a polynomial from the product of the noise and signal eigenvectors; f. determining the zero crossings of said polynomial to identify said multifrequency signals; and g. inhibiting said identification when the ratio of the smallest eigenvalue of the anticonjugate matrix to the noise eigenvalue is less than a predetermined amount.
Claim 12
Independent Claim
219 words
A method of detecting digitally encoded multifrequency signals in the presence of noise, said multifrequency signal being represented by n complex frequencies, comprising the steps of: a. sampling the signals to form a block of jmax sequential code words d j ; b. correlating each code word of said block with itself and with adjacent and more distant code words on a forward and backward basis to define the elements r 0i and r ik of an (n+1) by (n+1) modified covariance data matrix R, said elements r 0i being determined according to ##EQU14## and said elements r ik being determined by: r.sub.ik =r.sub.i-1, k-1 +d.sub.n-i d.sub.n-k -d.sub.jmax-i d.sub.jmax-k -d.sub.i-1 d.sub.k-1 +d.sub.jmax-n-1+i d.sub.jmax-n-1+k, for k=i, . . . ,n-i and i=1, . . . , n/2 ; c. partitioning said matrix R into a conjugate and anticonjugate submatrices and inverting the conjugate submatrix; d. isolating the noise vector of said covariance matrix R by determining the eigenvector associated with the largest eigenvalue of the inverted conjugate submatrix; e. forming a polynomial from the product of the noise and signal eigenvectors; f. determining the zero crossings of said polynomial to identify said multifrequency signals; and g. inhibiting said identification when the ratio of the smallest eigenvalue of the anticonjugate matrix to the noise eigenvalue is less than a predetermined amount.
Claim 13
Dependent Claim
24 words
The method of claim 9 wherein said elements r 0i and r ik are arranged in a (5×5) modified covariance matrix R, where ##EQU15##
Claim 14
Dependent Claim
32 words
The method of claim 10 wherein said covariance matrix R is partitioned into a (3×3) conjugate matrix R 0 , where ##EQU16## and a 2×2 anticonjugate matrix R e , where ##EQU17##
Claim 15
Dependent Claim
22 words
The method of claim 11 wherein said determination of said zero crossings is accomplished using a fast search technique employing linear interpolation.
References Cited (Backward Citations)
US4484035A
Cited
US5172406A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1997-07-25 | 1998-01-24 | 1998-07-26 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2001-07-25 | 2002-01-24 | 2002-07-26 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2005-07-25 | 2006-01-24 | 2006-07-26 | $7700.00 | Window Closed / Lapsed |