Publication number | US7492814 B1 |

Publication type | Grant |

Application number | US 11/151,173 |

Publication date | Feb 17, 2009 |

Filing date | Jun 9, 2005 |

Priority date | Jun 9, 2005 |

Fee status | Paid |

Publication number | 11151173, 151173, US 7492814 B1, US 7492814B1, US-B1-7492814, US7492814 B1, US7492814B1 |

Inventors | Douglas J. Nelson |

Original Assignee | The U.S. Government As Represented By The Director Of The National Security Agency |

Export Citation | BiBTeX, EndNote, RefMan |

Patent Citations (10), Non-Patent Citations (1), Referenced by (14), Classifications (8), Legal Events (2) | |

External Links: USPTO, USPTO Assignment, Espacenet | |

US 7492814 B1

Abstract

Removing noise and interference from a signal by calculating a joint time-frequency domain of the signal, estimating instantaneous frequencies of the joint time-frequency domain, modifying each estimated instantaneous frequency, if necessary, to correspond to a frequency of the joint time-frequency domain to which it most closely compares, redistributing elements within the joint time-frequency domain according to the modified instantaneous frequencies, computing a magnitude for each element in the redistributed joint time-frequency domain, plotting the results, identifying peak values, eliminating from the redistributed joint time-frequency domain elements that do not correspond to the peak values, identifying noise and interference in the peak values, eliminating the noise and the interference from the redistributed joint time-frequency domain elements, and recovering a signal devoid of noise and interference from the modified redistributed joint time-frequency domain.

Claims(12)

1. A method of removing noise and interference from a signal, comprising the steps of:

a) receiving the signal;

b) calculating a joint time-frequency domain of the received signal, where the joint time-frequency domain of the received signal includes elements that represent the received signal;

c) estimating instantaneous frequencies of the joint time-frequency domain;

d) modifying each estimated instantaneous frequency, if necessary, to correspond to a frequency of the joint time-frequency domain to which it most closely compares;

e) redistributing the elements within the joint time-frequency domain according to the estimated instantaneous frequencies as modified; and

f) computing a magnitude for each element in the joint time-frequency domain as redistributed;

g) plotting the results of the step (f) as the time-frequency representation of the received signal;

h) identifying peak values in the plot of step (g);

i) eliminating from the redistributed joint time-frequency domain elements that do not correspond to the peak values identified in step (h);

j) identifying noise and interference in the peak values identified in step (h);

k) eliminating from the redistributed joint time-frequency domain elements that correspond to the noise and the interference identified in step (j); and

l) recovering a signal devoid of the noise and the interference from the redistributed joint time-frequency domain as modified in step (k).

2. The method of claim 1 , wherein the step of receiving a signal, is comprised of receiving a signal, where the signal includes an intended signal, at least on signal component selected from the group of signal components consisting of an interfering signal, and the noise.

3. The method of claim 1 , wherein the step of calculating a joint time-frequency domain of the received signal is comprised of the step of calculating a short-time Fourier Transform of the signal received in step (a), where the result is in matrix form, where rows and columns represent discrete frequencies and times in a user-definable manner.

4. The method of claim 3 , wherein the step of calculating a short-time Fourier Transform is comprised of selecting a window-sized portion of the received signal, performing a Fourier Transform on the selected of the received signal, selecting a new window, where the next window overlaps a user-definable amount with the window selected just prior to the next window, selecting a new portion of the received window in accordance with the next window selected, performing a Fourier Transform on the next portion of the received signal, and repeating these steps until the entire received signal has been processed.

5. The method of claim 3 , wherein the step of estimating instantaneous frequencies of the joint time-frequency domain is comprised of the step of estimating instantaneous frequencies of the short-time Fourier Transform calculated in step (b).

6. The method of claim 5 , wherein the step of estimating instantaneous frequencies of the short-time Fourier Transform is comprised of the steps of:

(a) determining arguments for each element in the short-time Fourier Transform matrix;

(b) forming an argument matrix from the results of step (a), where each element in the argument matrix corresponds to the element in the short-time Fourier Transform matrix from which the argument was determined;

(c) calculating a derivative of the argument matrix; and

(d) forming an instantaneous frequency matrix from the results of step (c), where each element in the instantaneous frequency matrix corresponds to the element in the argument matrix from which the instantaneous frequency matrix element was derived.

7. The method of claim 3 , wherein the step of modifying each estimated instantaneous frequency, if necessary, to correspond to a frequency of the joint time-frequency domain calculated in step (b) to which it most closely compares is comprised of the step of modifying each instantaneous frequency, if necessary, to closest discrete frequency of the short-time Fourier Transform of step (b).

8. The method of claim 3 , wherein the step of redistributing the elements within the joint time-frequency domain according to the instantaneous frequencies as modified in step (d) is comprised of the step of redistributing the elements within the short-time Fourier Transform according to the instantaneous frequencies.

9. The method of claim 8 , wherein the step of redistributing the elements within the short-time Fourier Transform according to the instantaneous frequencies is comprised of the steps of:

(a) identifying, for each element in the short-time Fourier Transform, the instantaneous frequency that corresponds position-wise to the element in the short-time Fourier Transform;

(b) identifying the value of the identified instantaneous frequency; and

(c) moving the corresponding element in the short-time Fourier Transform to a location within its matrix column that corresponds to the identified value of the corresponding instantaneous frequency, summing all of the short-time Fourier Transform elements that map to a same location.

10. The method of claim 1 , wherein the step of eliminating from the redistributed joint time-frequency domain elements that do not correspond to peak values identified in step (h) is comprised of the steps of:

(a) identifying elements in the magnitudes computed in step (f) that are not associated with the peak values; and

(b) eliminating the elements in the redistributed joint time-frequency domain that do not correspond to the identified magnitudes.

11. The method of claim 1 , wherein the step of identifying noise and interference in the peak values identified in step (h) is comprised of the steps of:

(a) identifying elements in the magnitude computed in step (f) that are associated with the peak values that are below a user-definable threshold; and

(b) identifying elements in the magnitudes computed in step (f) that are associated with the peak values that exhibit period signal behavior and are empirically determined to be the interference.

12. The method of claim 3 , wherein the step of recovering a signal devoid of noise and interference from the redistributed joint time-frequency domain as modified in step (i) is comprised of the steps of:

(a) summing the matrix axis that represents discrete time in the redistributed joint time-frequency domain as modified by step (i); and

(b) listing results of step (b), in sequence, as the received signal devoid of the noise and the interference.

Description

The present invention relates, in general, to speech signal processing and, in particular, to noise and interference reduction.

A frequently recurring problem in communications is the need to remove noise and interference from a signal. There have been many approaches suggested to address this problem. For stationary narrowband interference, a simple notch filter may be effective. Adaptive notch filters have been suggested to remove narrowband non-stationary interference. For removal of broadband noise from speech, Wiener filter techniques such as spectral subtraction are frequently used.

An adaptive filter can be used to remove single non-stationary narrowband interfering signal from a broadband, or speech, signal. In this process, the frequency of the interfering signal is estimated at each time, and a single estimate of the interfering signal bandwidth is estimated. The received signal is frequency shifted at each time such that the frequency of the interfering signal is constant in the shifted representation. A fixed notch filter is applied to remove the interfering signal, and the filtered signal is frequency shifted to its original frequency. This process can remove a single interfering narrowband signal and it can, in principle, be iterated to remove several interfering signals. However, the primary problem with using an adaptive filter is that the instantaneous frequency of the interference must be accurately estimated at each time. Such estimation is difficult. Furthermore, an adaptive filter cannot be used to remove noise.

In Wiener filtering, or spectral subtraction, components which are dominated by noise are removed from the spectrogram, and the noise-free, or clean, signal is estimated by a pseudo inversion process. Spectral subtraction is the most common enhancement method used in speech processing. In this method, a short time Fourier transform (STFT) is computed. The STFT is a time-frequency representation. STFT components identified as dominated by noise are reduced in magnitude, and a signal whose STFT approximates the modified STFT is computed. The clean signal estimated this way is only an approximate solution because the modified STFT cannot be inverted. In the pseudo inversion process, some ad hoc criterion must be used. Furthermore, spectral subtraction cannot be easily used to remove narrowband interference.

For stationary narrowband interference, a clean signal can be estimated by using a notch filter which is tuned to the interference frequency and bandwidth. A notch filter cannot remove noise or interference whose frequencies change with time.

None of the prior art methods adequately identify and separate signal and non-stationary interference components.

U.S. Pat. No. 6,175,602, entitled “SIGNAL NOISE REDUCTION BY SPECTRAL SUBTRACTION USING LINER CONVOLUTION AND CASUAL FILTERING,” discloses a method of reducing noise in a signal by spectral subtraction. The present invention does not use spectral subtraction as does U.S. Pat. No. 6,175,602. U.S. Pat. No. 6,175,602 is hereby incorporated by reference into the specification of the present invention.

U.S. Pat. No. 6,266,633, entitled “NOISE SUPPRESSION AND CHANNEL EQUALIZATION PREPROCESSOR FOR SPEECH AND SPEAKER RECOGNIZERS: METHOD AND APPARATUS,” discloses a device for and method of noise suppression that uses blind deconvolution. The present invention does not use blind deconvolution as does U.S. Pat. No. 6,266,633, U.S. Pat. No. 6,266,633 is hereby incorporated by reference into the specification of the present invention.

U.S. Pat. No. 6,795,559, entitled “IMPULSE NOISE REDUCER DETECTING IMPULSE NOISE FROM AN AUDIO SIGNAL,” discloses a method of reducing noise by detecting and smoothing the high frequency amplitude of a signal, attenuating the non-smoothed amplitude of the signal, comparing the attenuated amplitude to a threshold, and identifying and removing the noise. The present invention does not smooth the high frequency amplitude of a signal as does U.S. Pat. No. 6,795,559. U.S. Pat. No. 6,795,559 is hereby incorporated by reference into the specification of the present invention.

U.S. Pat. No. 6,801,889, entitled “TIME-DOMAIN NOISE SUPPRESSION,” discloses a method of reducing noise by performing a Fourier Transform on the signal to generate a frequency spectrum, performing an Inverse Fourier Transform to simulate a noise signal, and subtracting the simulated noise signal from the time-domain signal. The present invention does not simulate noise using an Inverse Fourier Transform as does U.S. Pat. No. 6,801,889. U.S. Pat. No. 6,801,889 is hereby incorporated by reference into the specification of the present invention.

U.S. Pat. No. 6,826,392, entitled “MULTIPATH NOISE REDUCTION METHOD, MULTIPATH NOISE REDUCER, AND FM RECEIVER,” discloses a method of reducing noise by frequency modulating the signal, extracting a high-frequency signal from the modulated signal, generating a noise reduction coefficient from the extracted high-frequency signal, separating the signal into high-frequency and low frequency components, multiplying the high-frequency component by the noise reduction coefficient, and adding the product to the low-frequency component. The present invention does not generate a noise reduction coefficient as does U.S. Pat. No. 6,826,392. U.S. Pat. No. 6,826,392 is hereby incorporated by reference into the specification of the present invention.

U.S. patent application No. 20020173276 A1, entitled “METHOD FOR SUPPRESSING SPURIOUS NOISE IN A SIGNAL FIELD,” discloses a method of reducing noise by determining a distribution function of the signal, comparing the distribution to a reference distribution, modifying the components in the signal that differ from the reference distribution, and not modifying the components in the signal that are the same as those in the reference distribution. The present invention does not use a reference distribution as does U.S. patent application No. 20020173276 A1 U.S. patent application No. 20020173276 A1 is hereby incorporated by reference into the specification of the present invention.

It is an object of the present invention to remove noise and interference from a speech signal.

It is another object of the present invention to remove noise and interference from a speech signal by concentrating a short time Fourier transform (STFT) and estimating a noise-free and interference-free signal by integration.

It is another object of the present invention to remove noise and interference from a speech signal by summing a user-definable set of peak values in the concentrated STFT.

The present invention is a method of removing noise and interference from a speech signal by concentrating a STFT and estimating a noise-free and interference-free signal by integration.

The first step of the method is receiving the signal.

The second step of the method is converting the received signal to the joint time-frequency domain.

The third step of the method is estimating an instantaneous frequency (IF) for each element in the joint time-frequency domain calculated in the second step.

The fourth step of the method is modifying each result of the third step, if necessary, where each IF element is replaced, if necessary, with the discrete frequency of the joint time-frequency domain created in the second step to which it most closely compares in value.

The fifth step of the method is redistributing the elements within the joint time-frequency domain created in the second step according to the IF elements as modified by the fourth step.

The sixth step of the method is computing, for each time, the magnitude of each element of the joint time-frequency domain as redistributed in the fifth step.

The seventh step of the method is plotting the results of the sixth step in a graph as the time-frequency representation of the received signal.

The eighth step of the method is identifying in the plot of the seventh step the maximum, or peak, values.

The ninth step of the method is eliminating from the redistributed joint time-frequency domain those elements that do not correspond to the peak values identified in the eighth step.

The tenth of the method is identifying noise and interference in the result of the eighth step.

The eleventh step of the method is eliminating from the redistributed joint time-frequency domain those elements that correspond to the noise and interference identified in the tenth step.

The twelfth, and last, step of the method is recovering a signal devoid of noise and interference from the redistributed joint time-frequency domain as modified in the eleventh step **11**.

The present invention is a method of removing noise and interference from a signal. The present method is useful in signal coding application, but may be used for any other suitable signal processing application.

The first step **1** of the method is receiving the signal. The signal may be in the time or frequency domain. In the preferred embodiment, the received signal is in the time domain.

The second step **2** of the method is converting the received signal to the joint time-frequency domain. In the preferred embodiment, the second step **2** is accomplished by calculating a short-time Fourier transform (STFT) on the received speech signal. An STFT is a known method of forming a matrix of complex values that represent the signal, where the columns (or rows) of the matrix are discrete time and the rows (or columns) of the matrix are discrete frequency. The elements of the matrix may be thought of as representing a complex-valued surface. An STFT is computed by selecting a window size, selecting a window-sized portion of the received signal, and performing a Fourier Transform on the selected portion of the signal. Another window is selected and the steps are repeated. In the preferred embodiment, a subsequently selected window overlaps the previously selected window (e.g., all but one sample in the new window is the same as the previous window). Each element of the resulting STFT matrix is of the following form:

*x=x+iy,*

Represented in time and frequency, each element of the matrix is of the following form:

*z*(*t,*ω)=*x*(*t*,ω)+*iy*(*t,*ω),

The representation in time and phase may be represented in polar form as follows:

*z*(*t,*ω)=√{square root over (x^{2}(*t*,ω)+*y* ^{2}(*t*,ω))}{square root over (x^{2}(*t*,ω)+*y* ^{2}(*t*,ω))}×*e* ^{tφ(t,ω),}

where φ(t,ω) is the argument (arg) of the element, and where

The third step **3** of the method is estimating an instantaneous frequency (IF) for each element in the STFT matrix calculated in the second step **2**. The result is an IF matrix, where the rows and columns are the same discrete times are frequencies as those of the STFT matrix, and where each IF is located in the IF matrix at the same time and frequency as that of its corresponding STFT element. In the preferred embodiment, the IFs are estimated for the elements of the STFT matrix by finding the argument for each element in the STFT matrix, forming an argument matrix, and calculating the derivatives of the argument matrix with respect to time. The result is an IF matrix, where an element in the IF matrix is the IF of the corresponding element in the STFT matrix.

The fourth step **4** of the method is modifying each result of the third step **3**, if necessary, where each element in the IF matrix is replaced, if necessary, with the discrete frequency of the STFT matrix created in the second step **2** to which it most closely compares in value. For example, if the discrete frequencies in the STFT matrix are 1Hz, 2HZ, . . . , then an IF matrix element of 1.4Hz would be changed to 1Hz, while an IF matrix element of 1.6 would be changed to 2Hz, and an IF matrix element of 2Hz would not be changed.

The fifth step **5** of the method is redistributing the elements within the STFT matrix created in the second step **2** according to the IF matrix as modified by the fourth step **4** by identifying an STFT matrix element's corresponding element in the IF matrix, determining the value of the corresponding IF matrix element, and moving the STFT matrix element within its column to the row that corresponds to the value of the corresponding IF matrix element. If two elements of the STFT matrix map to the same row then sum those STFT elements and place the result at the row. In the following example, an STFT matrix of complex-valued elements, represented by letters of the alphabet for simplicity, will be remapped according to a modified IF matrix. The columns of the STFT matrix are in time (i.e., 1-4 msecs.), and its rows are in frequency (i.e., 1-4 Hz.). Each element in the modified IF matrix corresponds to a column value in the STFT matrix.

1 msec. | 2 msec. | 3 msec. | 4 msec. | ||

STFT Matrix | |||||

1 Hz. | A | E | I | M | |

2 Hz. | B | F | J | N | |

3 Hz. | C | G | K | O | |

4 Hz. | D | H | L | P | |

Modified IF Matrix | |||||

1 Hz. | 2 | 3 | 2 | 3 | |

2 Hz. | 4 | 3 | 2 | 3 | |

3 Hz. | 2 | 1 | 4 | 1 | |

4 Hz. | 4 | 1 | 4 | 1 | |

Remapped STFT Matrix | |||||

1 Hz. | G + H | O + P | |||

2 Hz. | A + C | I + J | |||

3 Hz. | E + F | M + N | |||

4 Hz. | B + D | K + L | |||

The result of the fifth step

The sixth step **6** of the method is computing, for each time, the magnitudes of each element in the redistributed STFT matrix of step (e). The result is a matrix of magnitudes, where the elements of the magnitude matrix map to the element in the redistributed matrix to which the magnitudes correspond.

The seventh step **7** of the method is plotting the results of the sixth step **6** in a graph as the time-frequency representation of the received signal, where one axis is time, and the other axis is frequency. The result is a focused representation of each signal component of the received signal, where the phase information of the received signal is retained. Prior art methods do not retain such phase information. The components of the signal may include the intended signal, random noise, and interference (i.e., one or more unintended periodic signal).

The eighth step **8** of the method is identifying in the plot of the seventh step **7** a user-definable range of maximum, or peak, values.

The ninth step **9** of the method is eliminating from the redistributed joint time-frequency domain those elements that do not correspond to the peak values identified in the eighth step **8**. Elements are identified in the magnitude matrix computed in the sixth step **6** that are not associated with the peak values. Then, the elements in the redistributed joint time-frequency domain that do not correspond to the peak values are eliminated (i.e., either zeroed out or removed). Zeroing a value maintains the surface scope of the original signal. Removing a value reduces the number of elements that must be processed and, therefore, provides greater computational efficiency. The result of the ninth step **9** is a representation of the signal components of the received signal as the peak values of the redistributed joint time-frequency domain.

The tenth step **10** of the method is identifying noise and interference in the result of the eighth step **8**. Noise and interference is identified by comparing the magnitudes of the result of the eighth step **8** to a user-defined threshold. Values lower than the threshold are noise, and values above the threshold that exhibit periodic signal behavior and are empirically determined to be unrelated to the intended signal are interference.

The eleventh step **11** of the method is eliminating from the redistributed joint time-frequency domain those elements that correspond to the noise and interference identified in the tenth step **10**. Elements are identified in the magnitude matrix computed in the sixth step **6** that are associated with the noise and interference. Then, the elements in the redistributed joint time-frequency domain that correspond to the noise and interference are eliminated (i.e., either zeroed out or removed). The result of the eleventh step **11** is a representation of the signal components of the received signal as the peak values of the redistributed joint time-frequency domain without noise or interference.

The twelfth, and last, step **12** of the method is recovering a signal devoid of noise and interference from the redistributed joint time-frequency domain as modified in the eleventh step **11**. The twelfth step **12** is accomplished by summing each column or row, whichever represents discrete time, in the redistributed joint time-frequency domain as modified by the eleventh step **11** and listing the results, in sequence, as the received signal devoid of noise and interference. In the example above, the columns of the remapped STFT matrix are indexed in time, while the rows are indexed in frequency. In the example, the columns would be summed.

Patent Citations

Cited Patent | Filing date | Publication date | Applicant | Title |
---|---|---|---|---|

US6175602 | May 27, 1998 | Jan 16, 2001 | Telefonaktiebolaget Lm Ericsson (Publ) | Signal noise reduction by spectral subtraction using linear convolution and casual filtering |

US6266633 | Dec 22, 1998 | Jul 24, 2001 | Itt Manufacturing Enterprises | Noise suppression and channel equalization preprocessor for speech and speaker recognizers: method and apparatus |

US6792057 * | Nov 25, 2002 | Sep 14, 2004 | Bae Systems Information And Electronic Systems Integration Inc | Partial band reconstruction of frequency channelized filters |

US6795559 | Nov 28, 2000 | Sep 21, 2004 | Mitsubishi Denki Kabushiki Kaisha | Impulse noise reducer detecting impulse noise from an audio signal |

US6801889 | Apr 4, 2001 | Oct 5, 2004 | Alcatel | Time-domain noise suppression |

US6826392 | Mar 12, 2002 | Nov 30, 2004 | Mitsubishi Denki Kabushiki Kaisha | Multipath noise reduction method, multipath noise reducer, and FM receiver |

US7016739 * | Aug 27, 2003 | Mar 21, 2006 | Cardiac Pacemakers, Inc. | System and method for removing narrowband noise |

US7085721 * | Jul 5, 2000 | Aug 1, 2006 | Advanced Telecommunications Research Institute International | Method and apparatus for fundamental frequency extraction or detection in speech |

US7139338 * | Nov 7, 2001 | Nov 21, 2006 | Sony United Kingdom Limited | Receiver |

US20020173276 | Mar 8, 2002 | Nov 21, 2002 | Wolfgang Tschirk | Method for suppressing spurious noise in a signal field |

Non-Patent Citations

Reference | ||
---|---|---|

1 | * | Dogulas J. Nelson, Cross-spectral methods for processing speech, Nov. 2001, J. Acosut. Soc. Am. 110 (5), Pt 1. |

Referenced by

Citing Patent | Filing date | Publication date | Applicant | Title |
---|---|---|---|---|

US7676046 * | Jun 9, 2005 | Mar 9, 2010 | The United States Of America As Represented By The Director Of The National Security Agency | Method of removing noise and interference from signal |

US8275077 * | Sep 25, 2012 | The United States Of America As Represented By The Director, National Security Agency | Coherent demodulation of ais-GMSK signals in co-channel | |

US8311812 | Nov 13, 2012 | Eliza Corporation | Fast and accurate extraction of formants for speech recognition using a plurality of complex filters in parallel | |

US8374210 * | Aug 6, 2009 | Feb 12, 2013 | Nxp B.V. | Wide band transceiver and data receiving method using a tunable notch filter and pre-estimated optimal notch filter parameters |

US8463914 | Jun 11, 2013 | Eliza Corporation | Facilitating rapid establishment of human/machine voice communication links over an IP network using last-known call-host endpoint states | |

US9219637 | Jan 30, 2010 | Dec 22, 2015 | Oleg Boulanov | Facilitating rapid establishment of human/machine communication links with private SIP-based IP networks using pre-distributed static network address translation maps |

US9311929 | Oct 31, 2012 | Apr 12, 2016 | Eliza Corporation | Digital processor based complex acoustic resonance digital speech analysis system |

US20110131039 * | Dec 1, 2009 | Jun 2, 2011 | Kroeker John P | Complex acoustic resonance speech analysis system |

US20110188491 * | Aug 4, 2011 | Oleg Boulanov | System for rapidly establishing human/machine communication links using pre-distributed static network-address maps in sip networks | |

US20110191479 * | Jan 30, 2010 | Aug 4, 2011 | Oleg Boulanov | System for rapidly establishing human/machine communication links by maintaining simultaneous awareness of multiple call-host endpoint-states |

US20110206100 * | Aug 6, 2009 | Aug 25, 2011 | Nxp B.V. | Wide band transceiver and data receiving method using a tunable notch filter and pre-estimated optimal notch filter parameters |

US20140122068 * | Oct 21, 2013 | May 1, 2014 | Kabushiki Kaisha Toshiba | Signal processing apparatus, signal processing method and computer program product |

EP2840570A1 * | Aug 23, 2013 | Feb 25, 2015 | Technische Universität Graz | Enhanced estimation of at least one target signal |

WO2015024940A1 * | Aug 19, 2014 | Feb 26, 2015 | Technische Universität Graz | Enhanced estimation of at least one target signal |

Classifications

U.S. Classification | 375/227, 375/260, 375/224, 704/206, 600/507 |

International Classification | H04B17/00 |

Cooperative Classification | G10L21/0208 |

European Classification | G10L21/0208 |

Legal Events

Date | Code | Event | Description |
---|---|---|---|

Jun 9, 2005 | AS | Assignment | Owner name: NATIONAL SECURITY AGENCY, MARYLAND Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:NELSON, DOUGLAS J.;REEL/FRAME:016695/0138 Effective date: 20050608 |

Feb 17, 2012 | FPAY | Fee payment | Year of fee payment: 4 |

Rotate