TO Approved for public release, distribution unlimited

Similar documents
Technical Note

SEISMIC WAVE PROPAGATION. Lecture 2: Fourier Analysis

PART 1. Review of DSP. f (t)e iωt dt. F(ω) = f (t) = 1 2π. F(ω)e iωt dω. f (t) F (ω) The Fourier Transform. Fourier Transform.

The Analysis of Data Sequences in the Time and Frequency Domains 1

ENT 315 Medical Signal Processing CHAPTER 2 DISCRETE FOURIER TRANSFORM. Dr. Lim Chee Chin

GATE EE Topic wise Questions SIGNALS & SYSTEMS

Ch. 15 Wavelet-Based Compression

Interchange of Filtering and Downsampling/Upsampling

APPENDIX A. The Fourier integral theorem

Multirate signal processing

Time Series Analysis: 4. Digital Linear Filters. P. F. Góra

Empirical Mean and Variance!

3 Fourier Series Representation of Periodic Signals

Lecture 27 Frequency Response 2

Digital Speech Processing Lecture 10. Short-Time Fourier Analysis Methods - Filter Bank Design

Digital Baseband Systems. Reference: Digital Communications John G. Proakis

The Continuous Time Fourier Transform

LECTURE 12 Sections Introduction to the Fourier series of periodic signals

Chapter 2: The Fourier Transform


Signal Analysis. Filter Banks and. One application for filter banks is to decompose the input signal into different bands or channels

4 8 N v btr 20, 20 th r l f ff nt f l t. r t pl n f r th n tr t n f h h v lr d b n r d t, rd n t h h th t b t f l rd n t f th rld ll b n tr t d n R th

i of 6. PERFORMING ORG. REPORT NUMBER Approved for public Dtatibuft Unlimited

Review: Continuous Fourier Transform

Fourier analysis of discrete-time signals. (Lathi Chapt. 10 and these slides)

MATHEMATICAL TOOLS FOR DIGITAL TRANSMISSION ANALYSIS

Chirp Transform for FFT

2.161 Signal Processing: Continuous and Discrete Fall 2008

TO Approved for public release, distribution unlimited

Digital Signal Processing Lecture 4

Colby College Catalogue

Time Series Analysis: 4. Linear filters. P. F. Góra

Fourier transform. Stefano Ferrari. Università degli Studi di Milano Methods for Image Processing. academic year

Computational Methods for Astrophysics: Fourier Transforms

Convolution and Linear Systems

Continuous Time Signal Analysis: the Fourier Transform. Lathi Chapter 4

2.161 Signal Processing: Continuous and Discrete Fall 2008

Use: Analysis of systems, simple convolution, shorthand for e jw, stability. Motivation easier to write. Or X(z) = Z {x(n)}

Discrete Fourier transform (DFT)

Fourier Transform for Continuous Functions

Chapter 6: The Laplace Transform. Chih-Wei Liu

REPRESENTATIONS FOR A SPECIAL SEQUENCE

A Family of Nyquist Filters Based on Generalized Raised-Cosine Spectra

ECS455: Chapter 5 OFDM. ECS455: Chapter 5 OFDM. OFDM: Overview. OFDM Applications. Dr.Prapun Suksompong prapun.com/ecs455

Software Process Models there are many process model s in th e li t e ra t u re, s om e a r e prescriptions and some are descriptions you need to mode

Solving a RLC Circuit using Convolution with DERIVE for Windows

Tutorial Sheet #2 discrete vs. continuous functions, periodicity, sampling

Chapter 12 Variable Phase Interpolation

Fundamentals of PLLs (III)

Chapter 2. Signals. Static and Dynamic Characteristics of Signals. Signals classified as

Solutions to Problems in Chapter 4

CITY UNIVERSITY LONDON. MSc in Information Engineering DIGITAL SIGNAL PROCESSING EPM746

Wavelets and Multiresolution Processing

0 t b r 6, 20 t l nf r nt f th l t th t v t f th th lv, ntr t n t th l l l nd d p rt nt th t f ttr t n th p nt t th r f l nd d tr b t n. R v n n th r

Responses of Digital Filters Chapter Intended Learning Outcomes:

Digital Signal Processing

NORWEGIAN SEISMIC ARRAY NORSAR ESD ACCESSION LIST, Approv. Royal Norwegian Council for Scientific and Industrial Research. Copy No.

HST.582J / 6.555J / J Biomedical Signal and Image Processing Spring 2007

n r t d n :4 T P bl D n, l d t z d th tr t. r pd l

Lecture 7: Laplace Transform and Its Applications Dr.-Ing. Sudchai Boonto

Digital Filters Ying Sun

Trade Patterns, Production networks, and Trade and employment in the Asia-US region

2 M. Hasegawa-Johnson. DRAFT COPY.

CHAPTER 4 FOURIER SERIES S A B A R I N A I S M A I L

Fourier Series and Transform KEEE343 Communication Theory Lecture #7, March 24, Prof. Young-Chai Ko

Detailed Solutions to Exercises

8 The Discrete Fourier Transform (DFT)

,. *â â > V>V. â ND * 828.

SNR Calculation and Spectral Estimation [S&T Appendix A]

6 The Fourier transform

ENSC327 Communications Systems 2: Fourier Representations. Jie Liang School of Engineering Science Simon Fraser University

Fourier Methods in Digital Signal Processing Final Exam ME 579, Spring 2015 NAME

EE 4372 Tomography. Carlos E. Davila, Dept. of Electrical Engineering Southern Methodist University

EE 261 The Fourier Transform and its Applications Fall 2007 Problem Set Eight Solutions

ω 0 = 2π/T 0 is called the fundamental angular frequency and ω 2 = 2ω 0 is called the

Nonstationary filters, pseudodifferential operators, and their inverses

Let H(z) = P(z)/Q(z) be the system function of a rational form. Let us represent both P(z) and Q(z) as polynomials of z (not z -1 )

Signal Processing Signal and System Classifications. Chapter 13

A0A TEXAS UNIV AT AUSTIN DEPT OF CHEMISTRY F/G 7/5 PHOTOASSISTED WATER-GAS SHIFT REACTION ON PLATINIZED T7TANIAI T--ETCIUI

INTRODUCTION TO DELTA-SIGMA ADCS

Chapter Intended Learning Outcomes: (i) Understanding the relationship between transform and the Fourier transform for discrete-time signals

Colby College Catalogue

Research Engineer, Technology Center, Taisei Corporation, Yokohama Japan

Cramer-Rao Bound Analysis for Frequency Estimation of Sinusoids in Noise

A MARTINGALE INEQUALITY FOR THE SQUARE AND MAXIMAL FUNCTIONS LOUIS H.Y. CHEN TECHNICAL REPORT NO. 31 MARCH 15, 1979

ELEG 3124 SYSTEMS AND SIGNALS Ch. 5 Fourier Transform

ECG782: Multidimensional Digital Signal Processing

The Hilbert Transform

The Continuous-time Fourier

Colby College Catalogue

Information and Communications Security: Encryption and Information Hiding

2.710 Optics Spring 09 Solutions to Problem Set #6 Due Wednesday, Apr. 15, 2009

Theory and Problems of Signals and Systems

Review of Linear Time-Invariant Network Analysis

Frequency-Domain C/S of LTI Systems

~,. :'lr. H ~ j. l' ", ...,~l. 0 '" ~ bl '!; 1'1. :<! f'~.., I,," r: t,... r':l G. t r,. 1'1 [<, ."" f'" 1n. t.1 ~- n I'>' 1:1 , I. <1 ~'..

System Identification & Parameter Estimation

How to manipulate Frequencies in Discrete-time Domain? Two Main Approaches

Robust one-step (deconvolution + integration) seismic inversion in the frequency domain Ivan Priezzhev* and Aaron Scollard, Schlumberger

4 4 N v b r t, 20 xpr n f th ll f th p p l t n p pr d. H ndr d nd th nd f t v L th n n f th pr v n f V ln, r dn nd l r thr n nt pr n, h r th ff r d nd

Transcription:

UNCLASSIFIED AD NUMBER AD480401 NEW LIMITATION CHANGE TO Approved for public release, distribution unlimited FROM Distribution authorized to U.S. Gov't. agencies and their contractors; Administrative/Operational Use; 1 Mar 1966. Other requests shall be referred to Air Force Technical Applications Center, Patrick AFB, FL. AUTHORITY USAF ltr, 25 Jan 1972 THIS PAGE IS UNCLASSIFIED

Ui,,-t TECHNICAL REPORT NO. 66-19 ECTRUM FILTERING, BY MEANS OF NUMERICAL TRANSFORM THEOREM - rn i I~ AD /PR U16 THIS oumewr Is SUMJC TO SKMF EPW CONTROLS AND EACH T1R"M1fAL TO FOREIGN 3V NUMEIETS OR F.REIGN kat[omal MAY BE M.ADE ONLY WITH PRMO APPROVAL OF CHIEFAFTAC. T H E I T E C H N I r.,a L C O R P O R ATI O N V40 UMILAN ROAD *ANI.AND.?UXA

SPECTRUM FILTERING BY MEANS OF NUMERICAL TRANSFORM THEOREM by Y. T. Huang TELEDYNE INDUSTRIES GEOTECH DIVISION TIS M'NT 3401 IS Shiloh SUMIECT Road TO SPECIAL EX': (,'T.OLS AN'D EACH Garland, TRANSMITTAL Texas C.:7'V.- G r',pve TS OR,..-:7'.L r.y BE T;ADE ONLY WITH PIIOR.L SF ' CHU:EF,AFAC. I March 1966

4 CONT ENTS ABSTRACT Page 1. INTRODUCTION 1 2. NUMERICAL TRANSFORM THEOREM I 3. SPECTRUM FILTERING 2 4. EXAMPLES OF SPECTRUM FILTERING 3 5. CONCLUSIONS 13 6. ACKNOWLEDGEMENT 13 7. REFERENCES 13-661 TR 66-19

4 ILLUS T RATIONS Figure Page la Analog deep-well record of August 3. 1965, at Apache, Oklahoma 4 lb Digitized deep-well record of August 3, 1965, at Apache, Oklahoma 5 2 Analog low-pass filtered deep-well record, August 3, 1965 7 3a Impulse response of a low-pass filter (cut-off at 1. 5 cps) 8 3b Low-pass filtered Apache record, using convolution theorem 8 4 Low-pass filtered Apache record using the numerical transform theorem 9 5 Analog high-pass filtered deep-well record, August 3, 1965 10 6a Impulse response of a high-pass filter (cut-off at 1.5 cps) 11 6b High-pass filtered Apache record, uming convolution theorem ii 7 High-pass filtered Apache record using the numerical transform theorem 12 8 Analog band-pass filtered deep-well record, August 3, 1965 14 9a Impulse response of a band-pass filter (1 to 2 cps) s15 9b Band-pass filtered Apache record, using convolution theorem 15 10 Band-pass filtered analog record using the numericaltransform theorem 16 11 Addition of figure 2 and figure 5 after digitization 17 4 12 Superposition of figure 4 and figure 7 18 TR 66-19

ABST ACT A new type of digital filtering is explained without asing the convolution theorem used in electrical engineering. The scheme makes,use of the Numerical Transform Theorem which transforms a pair of finite spectra (i. e., amplitude and phase spectra) in the frequency domain Into a finite time series. This time series, which may be filtered during transformation, has precisely the same record length as the "original" time series without introducing meaningless transients. The spectrum filtering technique, in contrast to the convolution filte ring technique, has an additional advantage that it does not require a separate digital filter. Some examples are given. TR 66-19

SPECTRUM FILTERING BY MEANS OF NVfERICAL TRANSFORM THEOREM 4oINTRODUCTION For many years, Fourier series and transforms have been used in science and engineering. The primary reason lies in its simplicity of representations which allow us to analyze a function in a different form. Fol purposes of numerical analyses, series truncation becomes inevitable, and expressions Jor a set of coefficients are found. There is an important theorem, however, which has escaped the attention of previous investigatmrs. This theorem, which may be called "Numerical Transform Theorem", transforms finit time series to finite frequency harmonics. The history of frequency filtering is probably as old as the history of electronic engineering. So far, digital filtering is accomplished through convolution theorem which states that a multiplication in a frequency domain corresponrds to a convolution in the time domain. Theoretically, the convolution filter has infinite length, and a truncation of this filter at a certain tolerable level is necessitated in actual applications. The resulting filtered record contains useless tails caused by transients in the convolution process. This article intends to show a different way of spectrum filterine by which a time series can be filtered without generating convolution transients. A terminology "Spectrum Filtering" is adopted to differentiate this technique from the conventional convolution filtering technique. This work was performed under Project VT/4051, Contract AT 33(657)-12L45. The project is under the technical direction of the Air Force Technical Applications Center (AFTAC) and the overall direction of the Advanced Research Projects Agency (ARPA). 2. NUMERICAL TRANSFORM THEOREM Since the tirme Fourier made use of the trigonometric series beazing his name for the integration of the equations of thermal conduction, the technique has become one of the most basic tools in scientific and engineering analyses. The method involves an expresnion of a continuous function of length ZT by an nfinit series, - + ' nacos b nl a+ W bnin @n ](1 nal f ~ ~ ~ o = where coefficients a 'n and b'n can be dete rmined by InTa L ZT f(t) coso dt and b' f 2T f(t) sin dt (2) T n T Although these expressions are exact by virtue of the orthogonality relationship of trigonometric functions, it takes an infinite number of a'n and b'n to have an exact expression of the original f(t). -6- TR 66-19

There is an important theorem in the theory of transforms, which is usually referred to as Fourier transform theorerm (Lee. 1961, p. 33). The mathematical expramslcon o.f this thearcra i; givall by where the frequency isl given in cycles per second. This expression holds for continuous functions extending from -w to 0 in both time and frequency domains. The approximation of the above expression in numerical form takes infinite terms, and it is difficult to recover the original function by using the equation (3). In my previous preventationi at St. LJouis, Missouri, I indicated a theorem called Numerical Transform Theorem (Huang. 1965). Borrowhig the notation of Z-transform (Robinson and Treitel, 1964), this theorem can be expressed by where -5) Zs' In the above expressions, J is an imasinary unit and m is the saaple nurnmoer. The expression (4) is a&lo an exact relationship which transforms a ft number of digit zed data into a Anie domain. It indicates that the exact recovery of the original digitized dati ie!-ssible without consuming an infinite number of coefficients. 3. SPECTRUM FILTERING By decomposing equation (3) into a transform pair, we have F(f) * j fe 1 di (6) and fit} W '(f)j df (7) Denoting a filter function by H(f), the impulse response of this function is given by h(t) W H(f) aj2rft df (8) IPresented at the Seismological Society of America meeting, St. Louis, Missouri, on 14 April 1965. TR 66-19

Since a frequency filtering is achieved through multiplication of F(f) and H(f) in the frequency domain, by the convolution theorem (Leo- 1, p. 46),.vc obtain i f f(t - Ta) h (T) dt J F(f) H(f)e zftdf (9) For digital data, this operation is accomplished through gi fi -k hk (10) k The hk in the above expression represents a digital filter. For a filter length of p 6 t and a record length of m A t, the resulting filtered record length is given by (y + m -1) At, where At is the digitization increment. In this process, truncation of the h(t) and a creation of the convolution transients are unavoidable. Returning to the equation (4), the numerical transforra theorem can be decomposed into 6n= If kznk 0 1) rn-1 kno and fi u 1 Fn z-nl (12) nmc Accordingly, when a spectrum filtering is performed through F'n a Fn'Hn (13) the filtered record f'i can be represented by rn-1 f-i 0 1 F'. Z-ni (14) n0o In equation ( 3), H. represents a filtering function. 4. EXAMPLES OF SPECTRUM FILTERING As an actual demonstration of the difference between the conventional and the new filtering techniques, the Apache deep-well record of August 3, 1965, is considered below. This record which is shown in figure I was taken at a depth of 9440 ft below the ground level. The record was digitized at a rate of 10 samples per second, and a record length of 15 seconds was used, Before digitization, the record was filtered through a band-pass filter of 0.5-5.0 cps with cut-off rates of 12 db and 24 db per octave, respectively. -36 TR 66-19

pp v N I 6 1_

Lin 1- I -- I I4 cc 1.0 ~~~T 66 19 ~

For a filter length of pat, the fundamental frequency is given by Lf (15) pdt Any frequency f in terms of Af can be expressed by fq a qaf = q (16' pat The mathematical representation of a low-pass filter is S1, for n = 0, 1, 2... N (N Ir q) Ha- (17) 0, for n > N The impulse responae of this filter is hi N ni(18) Figure 2 shows the analog version of the low-pass filtered record (24 db/octave at 1. 5 cps) of the original figure La. An Impulse response of the low-pass filter (cut-off at 1. 5 cps) is shown in figure 3a and the digitally filtered result using the conventional convolution technique is shown in figure 3b. Figure 4 is the corresponding low-pass filtered record by a direct usage of the numerical transform theorem. b. High-pass filter -1 For a high-pass filter, the filtering function becomes o0, for n2 0, hs2... N(N Iq) Hn, (19) 1, for n N The impulse response of this filter is hi = : Z-hi (Z0) n)'n Figure 5 is the analog high-pass filtered result. The..,&pulse response of the high-pass filter together with the convolved result is shown in figures 6a and 6b. Figure 7 is the filtered output by using the numerical transform theorem. c. Band-pass filter The mathematical exprel -ion for a band-pass filter is given by 0, for n a 0,1, 2,... N H 1. for n =NI + 1. N 1 + 2.... z4 (21) n 0, for n > NZ TR 66-19 -6-

~00.13 tw -.4 TR661

r 4 I - I U I 41 0 U N - F.3 * I 0 - U u 41 I 4 '4 o U 41.41 '4 41 * M 41 '4 4141 LI 41 410 r1 4. 4 4 N 1 0 N - C a 0 a a N 3OLUINOVN AIIYI TR 66-19 -8-

P44 10 00 N aanlndynzaii'135 8R661

OD4 a TR 66-1 -10

- 4 I I m - -- -. - 0 4) I.. (1 0 4. a -0 a - U I a -. U0 U V U 64 4) 0..4) I).4 a '0-.0 a U I V 'C * U I. 1 Go I 4..4 o e o o 0 0 a N N C KOfl1INDVN AIJVT -11- TR 66-19

14 7=:. 0z 4 S~alIDYK AI.L13I. TR 66-1

.. ;z iu this mjter is accordingly n>ni Figures 8 through 10 show different results of the filtered outputs. As a comparison between the analog results and the reconstructed resultsq, figure 11 and figure IZ are displaye '. It is of interest to note that except for the dc bias, figure 12 is coincident with the figure lb on %hich the spectrum filterings were performed. Other types of filtering, e.g., notch filter, comb filter, etc., can easily be arranged using the numerical transform theorem. 5. CONCLUSIONS By virtue of the numerical transform theorem, it is possible to filter digitized records in any desired fashion in the frequency domain. No such useless transients are incurred in this process as in the case of filtering through convolutions. When the filtered function using the numerical transform theorem is spectral analyzed using the Fourier transform, there will be small side lobes created between the multiples of the original fundamental frequency. This situation can be remedied by taking a sufficiently long record length initially. The increased frequency resolution will thus contribute to a reduction in the undesirable side lobes. This is the main trade-off between the analog and the digital filtering@. A comparison between figure 11 and figure 12 indicates that digital filtering is closer to a perfect filter than analog, and the application of the numerical transform theorem will yeild filtered records without transients. The transient effects are particularly significant for records of short durations. Although one-dimensional transformation is shown in this article, the extention of this filtering technique can be accomplished to three-dimensional array problems where both time and space parameters must be taken into consideration. It must be remembered that the above technique requires spectral analysis belore filtering, although a separate digital filter is not required in the process. 6. ACKNOWLEDGEMENT The original Apache deep-well digitized record was supplied by Dr. E. J. Douze of the Geotech Division of Teledyne Industries. Paul Kozsuch and Harvey Downing of the Special Studies Group, Geotech Division. helped me in preparing the examples given in this article. 7. REFERENCES Lee, Y. W., "Statistical theory of communication", Wiley, p. 33, 1963. Huang, Y. T., "Special analysis of digitized seismic data", Accepted for publication in the April, 1966, issue of the Bulletin of the Seismological Society of America. Robinson, E. A., and Treitel, Sven, "Principles of digital filtering", Geophysics, p. 395-404, June, 1964. -13- TR 66-19

11 M~aLIDVWZ{-TVrM TR 66-1.14-

[ I 000 616 S o 0 o - - 64 U6X n m n m m nm m m m m m n0 m m m

E A Ill_............... =...... 2 S.. ' ' --., " U 6 " a L...... ',, 0 @ 0 0 0 0 TR 6-19 16- L mm ms mm i mm mm S

-- Ic coc 6,~ 000 dc,'iino~vyq :A11V'T:aI' -17- TR 66-19

r WI ji T p t -t Ṉ 'I 1.3 4) 0 4) C N N a 0 0 0 0 0 0 0 C 0 0 0 0 0 4) N 1. I I ar.limovn AIJVI3 TR 66-19 -18-