Technical Note

Similar documents
Technical Note

S 3 j ESD-TR W OS VL, t-i 1 TRADE-OFFS BETWEEN PARTS OF THE OBJECTIVE FUNCTION OF A LINEAR PROGRAM

( Final Report) Theory of the Cylindrical Dipole on a Sphere. L. L. Tsai D. V. Otto. Prepared by. The Ohio State University

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

cot* SEPTEMBER 1965 a CC 0^\ 0 «*«***

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

Technical Note

HIGH-SPEED CONVOLUTION AND CORRELATION*

G52IVG, School of Computer Science, University of Nottingham

ON ANALOGUES OF POINCARE-LYAPUNOV THEORY FOR MULTIPOINT BOUNDARY-VALUE PROBLEMS

THE MINIMUM NUMBER OF LINEAR DECISION FUNCTIONS TO IMPLEMENT A DECISION PROCESS DECEMBER H. Joksch D. Liss. Prepared for

ECG782: Multidimensional Digital Signal Processing

Empirical Mean and Variance!

Computer Vision & Digital Image Processing. Periodicity of the Fourier transform

Technical Note

AIR FORCE RESEARCH LABORATORY Directed Energy Directorate 3550 Aberdeen Ave SE AIR FORCE MATERIEL COMMAND KIRTLAND AIR FORCE BASE, NM

A GENERALIZED RADAR OUTPUT SIMULATION. J. F. A. Ormsby S. H. Bickel JULY Prepared for

Techniques for Designing Finite-Duration Impulse-Response Digital Filters

LAB 6: FIR Filter Design Summer 2011

AD-A MASSACHUSETTS INST OF TECH LEXINGTON LINCOLN LAB FIG 20/6 ZERN IKE ABERRATIONS AND THEIR FAR FIELDS INTENSITIES.(U) SEP So J HERRMANN

Math 212-Lecture 8. The chain rule with one independent variable

UNCLASSIFIED AD NUMBER LIMITATION CHANGES

Spatial-Domain Convolution Filters

Image Processing 1 (IP1) Bildverarbeitung 1

SATURABLE ABSORBING QUANTUM WELLS AT 1.08 AND 1.55 MICRON WAVELENGTHS FOR MODE LOCKING OF SOLID STATE LASERS

Experimental Fourier Transforms

AZIMUTHALLY PROPAGATING MODES IN AN AXIALLY-TRUNCATED, CIRCULAR, COAXIAL WAVEGUIDE

St>-T*-4*-te.» ESD RECORD COPY. ,om*' ESD ACCESSION LIST ESTI Call M - 4H THIRD QUARTERLY TECHNICAL REPORT October to 30 December 1967

-Digital Signal Processing- FIR Filter Design. Lecture May-16

F(u) = f e(t)cos2πutdt + = f e(t)cos2πutdt i f o(t)sin2πutdt = F e(u) + if o(u).

! Spectral Analysis with DFT. ! Windowing. ! Effect of zero-padding. ! Time-dependent Fourier transform. " Aka short-time Fourier transform

Wiener Filter for Deterministic Blur Model

NOL UNITED STATES NAVAL ORDNANCE LABORATORY, WHITE OAK, MARYLAND NOLTR ^-z ^ /

RD-R14i 390 A LIMIT THEOREM ON CHARACTERISTIC FUNCTIONS VIA RN ini EXTREMAL PRINCIPLE(U) TEXAS UNIV AT AUSTIN CENTER FOR CYBERNETIC STUDIES A BEN-TAL

a( i), where N i N ) is accurately d( i), where N i N. The derivative at ( ) ( ) ( )

Computer Vision. Filtering in the Frequency Domain

Technical Note

urn DISTRIBUTED BY: National Technical Information Service U. S. DEPARTMENT OF COMMERCE AD-A

C-) ISUMMARY REPORT LINEAR AND NONLINEAR ULTRASONIC INTERACTIONS ON LIQUID-SOLID BOUNDARIES

3. Lecture. Fourier Transformation Sampling

2.161 Signal Processing: Continuous and Discrete Fall 2008

Radar Systems Engineering Lecture 3 Review of Signals, Systems and Digital Signal Processing

KULTIWAVELENGTH LASER PROPAGATION STUDY ~ III. Quarterly Progress Report No. h March 16, June 15, J. Richard Kerr

APPENDIX A. The Fourier integral theorem

Technical Report. Lincoln Laboratory. Quantization Effects in Digital Filters. fl'fttfote&k^ ESD RECORD COPY. C. J. Weinstein.

13. Power Spectrum. For a deterministic signal x(t), the spectrum is well defined: If represents its Fourier transform, i.e., if.

SaL1a. fa/ SLECTE '1~AIR FORCE GECOPNYSICS LABORATORY AIR FORCE SYSTEMS COMMAND AFGL-TH

Recursive and Nonreeursive. Filters Desi Frequency Sampling Techniques. , n = 0, I,..., N - 1. (2)

ECE Digital Image Processing and Introduction to Computer Vision. Outline

Time and Spatial Series and Transforms

Sensitive Detection and Identification of Isovanillin Aerosol Particles at the pg/cm 3 Mass Concentration Level Using Raman Spectroscopy*

The DFT as Convolution or Filtering

Shallow Water Fluctuations and Communications

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

THE DISTANCE BETWEEN TWO RANDOM POINTS IN A 4- AND 5-CUBE.

TO Approved for public release, distribution unlimited

Generation of bandlimited sync transitions for sine waveforms

Physics 250 Green s functions for ordinary differential equations

NAVAL SHIP RESEARCH AND DEVELOPMENT CENTER Bethesda, Maryland 20034

Recursive Gaussian filters

Image Degradation Model (Linear/Additive)

Fourier Analysis and Power Spectral Density

UNCLASSIFIED UNCLASSIFIED DEFENSE DOCUMENTATION CENTER SCIENTIFIC AND TECHNICAL INFORMATION FOR CAMERON STATION ALEXANDRIA VIRGINIA

Math Exam IV - Fall 2011

Numerical analysis meets number theory: using rootfinding methods to calculate inverses mod p n

LESSON 23: EXTREMA OF FUNCTIONS OF 2 VARIABLES OCTOBER 25, 2017

12.7 Heat Equation: Modeling Very Long Bars.

3 Applications of partial differentiation

Differential equations, comprehensive exam topics and sample questions

Differentiation. Timur Musin. October 10, University of Freiburg 1 / 54

Solutions For Homework #5

Filter Analysis and Design

Gradient, Divergence and Curl in Curvilinear Coordinates

Sound & Vibration Magazine March, Fundamentals of the Discrete Fourier Transform

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

Appendix A Butterworth Filtering Transfer Function

THE STÄTIONARITY OF AN ESTIMATED AUTOREGRESSIVE PROCESS BY T. W. ANDERSON TECHNICAL REPORT NO. 7 NOVEMBER 15, 1971

The Effects of Magnetic Storm Phases on F-Layer Irregularities from Auroral to Equatorial Latitudes

6.334 Power Electronics Spring 2007

MIT 2.71/2.710 Optics 10/31/05 wk9-a-1. The spatial frequency domain

6 The Fourier transform

Image Processing 2. Hakan Bilen University of Edinburgh. Computer Graphics Fall 2017

Supplementary Questions for HP Chapter Sketch graphs of the following functions: (a) z = y x. (b) z = ye x. (c) z = x 2 y 2

TO Approved for public release, distribution unlimited

Partial Differential Equations

1 Assignment 1: Nonlinear dynamics (due September

WRb-Al? 164 STATISTICAL TECHNIQUES FOR SIGNAL PROCESSING(U) 1/1 PENNSYLVANIA UNIV PHILADELPHIA S A KASSAN 30 NAY 85 AFOSR-TR-6-01?

Tensor Analysis in Euclidean Space

EEO 401 Digital Signal Processing Prof. Mark Fowler

Properties of the Autocorrelation Function

A New Twist to Fourier Transforms

Finite Volume Method

Review: Continuous Fourier Transform

Theory and Problems of Signals and Systems

UNIVERSITY OF CALIFORNIA, SAN DIEGO SCRIPPS INSTITUTION OF OCEANOGRAPHY VISIBILITY LABORATORY SAN DIEGO, CALIFORNIA 92152

Volume 6 Water Surface Profiles

Introduction. where Xk is the kth sample of a time series consisting of N (possibly complex) samples and j=.\/?. Quite ob-

Benchmarking Functional Link Expansions for Audio Classification Tasks

Blur Insensitive Texture Classification Using Local Phase Quantization

Name of the Student: Problems on Discrete & Continuous R.Vs

Transcription:

ESD ACCESSION LIST TRI Call Nn n 9.3 ' Copy No. / of I <* * S^NTlFic ä ß D fffcoro COP/ Technical Note 1970-41 T. S. Huang Two-Dimensional Windows 31 December 1970 Prepared under Electronic Systems Division Contract F19628-70-C-0230 by Lincoln Laboratory MASSACHUSETTS INSTITUTE OF TECHNOLOGY Lexington, Massachusetts AOliii

This document has been approved for public release and sale; its distribution is unlimited.

MASSACHUSETTS INSTITUTE OF TECHNOLOGY LINCOLN LABORATORY TWO-DIMENSIONAL WINDOWS r. S. HUANG Consultant, Group 64 TECHNICAL NOTE 1970-41 31 DECEMBER 1970 This document has been approved for public release and sale; its distribution is unlimited. LEXINGTON MASSACHUSETTS

The work reported in this document was performed at Lincoln Laboratory, a center for research operated by Massachusetts Institute of Technology, with the support of the Department of the Air Force under Contract F19628-70-C-0230. This report may be reproduced to satisfy needs of U. S. Government agencies. il

ABSTRACT Two-dimensional windows find applications in many diverse fields, such as the spectral estimation of random fields, the design of two- dimensional digital filters, optical apodization, and antenna array design. Many good one-dimensional windows have been devised, but relatively few two-dimensional windows have been investigated. In this paper we show that good two-dimensional windows can be obtained by rotating good one-dimensional windows. That is, if w(x) is a good symmetrical one-dimensional window, then w 2 (x,y) = w(\ o/^2 x + y ) is a good circularly symmetrical two-dimensional window. Accepted for the Air Force Joseph R. Waterman, Lt. Col., USAF Chief, Lincoln Laboratory Project Office 111

TWO-DIMENSIONAL WINDOWS I. Introduction Two-dimensional windows find applications in many diverse fields, such as the spectral estimation of random fields, the design of two-dimensional digital filters,* optical apodization, and antenna array design. 1-4 Many good one-dimensional windows have been devised, however, relatively few two-dimensional windows have been investigated. ' In this paper, we establish a result which enables us to get good two-dimensional windows from good one-dimensional windows. II. The Problem We first review briefly the one-dimensional problem. Let the Fourier transform of a function f(x) be F(u). For some reason, we want to truncate f(x): g(x) = f(x) w(x) (1) w(x) = 0, for x > A (2) where A is a constant. The Fourier transform of g(x) is G(u) = F(u)<S> W(u) (3) where W(u) is the Fourier transform of w(x), and <8> denotes convolution. Our problem is to choose an appropriate shape for the window function w(x) such that G(u) is close to F(u) and in any region surrounding a discontinuity of F(u), G(u) will not contain excessive ripples. It is well known that the Fourier transform W(u) of a good window w(x) should have a big central peak and small sidelobes.

In two dimensions, the problem is entirely similar. Let the two-dimensional Fourier transform of a function f 2 (x,y) be F 2 (u,v), and let g 2 (x,y) = f 2 (x,y) w 2 (x,y) (4) 2 2 2 where w 2 (x,y) = 0for x + y >A (5) The Fourier transform of g 2 (x,y) is G 2 (u,v) = F 2 (u,v) W 2 (u,v) (6) where W 2 (u,v) is the Fourier transform of w 2 (x,y). The problem is to choose an appropriate shape for the two-dimensional window function w 2 (x,y) such that G 2 (u,v) is close to F 2 (u,v) and in the neighborhood of a discontinuity of F 2 (u,v), G 2 (u,v) does not contain excessive ripples. III. The Result Intuitively, we feel that if w (x) is a good symmetrical one-dimensional window, then. /2 2 w 2 vx,y) = w (Vx +y ) (7) will be a good two-dimensional window. This is indeed partially verified by the following two examples. The first example is w(x) = (l, for x <; 1 (8) Then the Fourier transform is (0, for x > 1 W<u)=^P- (9) whose first side-lobe peak is about 20$ of the peak at u =0. The corresponding two-dimensional window

S2 2 1, for I x +y ^1 2 2 0, for x + y > 1 (10) has the two-dimensional Fourier transform w 2 (u,v) = ^(xa^+v 2 ) /T~ 2 v/u + v whose first side-lobe peak is only about 12<# of the peak at u = 0 = v. (ID The second example is w (x)= I 1 - x, for x ^ 1 0, for x > 1 (12) The Fourier transform is x / Sin 1 \ W(u) = (13) whose side-lobe peak is about 44 of the peak at u = 0. The corresponding two-dimensional window w 2 (x,y) = (1 -Vx 2 + y 2, for x 2 -h y 2 < 1 (14) 0, for x 2 +y 2 > 1 has a two-dimensional Fourier transform s, P -3 W 2 (u,v) = 2n o(t)dt -p" 2 J o (p) (15) / 2 2 where p =y/\i + v, whose first side-lobe peak is only about 2#of the peak at u = 0 = v.

The above comparisons are, however, unfair. Because when we convolve a window with a discontinuity, what count in the one-dimensional case are the areas under the side-lobes, while in the two-dimensional case what count are the volumes under the side-lobes. A fair comparison would be to look at the result of the convolution. One thing we can say along this line is contained in the following theorem which is the main result of this paper. Theorem. If a symmetrical one-dimensional window w (x) and a two-dimensional window w (x,y) are related by w 2 (x,y)=w (X 2 + y 2 ) (16) then their Fourier transforms W(u) and W 2 (u, v) satisfy the relation ^ W 2 (u,v) H 2 (u,v) =W(u) H(u) (17) where H(u) = jl, for u * 0 (18) (0, for u <0 H 2 (u,v)= jl, for ustoand all v (19) (0, for u <0 and all v and denotes convolution. Proof. We first show that 00 W(u) = i j dvw 2 (u,v) (20) By definition, -00 oo w 2 (x,y) = 2~ / dudv W 2 (u,v) e j(xu+yv)

Whence w 2 (x ) = i/ du e jxu i/dvw 2 (u,v) (21) But from Eq. (16), w 2 (x,0) = w(x) ^ Therefore from Eq. (21), ^ f dv W 2 (u,v) is the Fourier transform of w(x). This established Eq. (20). Now, W(u) H(u) = f dt W(t) H (u -t) and / dt W(t) (22) W 2 (u,v) H 2 (u,v) = f /* dtds W(t,s) H 2 (u-t,v-s) u» = f dt f ds W(t,s) (23) "00 00 From Eqs. (22) and (20), we have U oo W(u) <8> H(u) = ^ f dt f ds W(t, s) by virtue of Eq. (23). "00 "00 1 ^ W 2 (u,v) H 2 (u,v)

IV. The Design of Two-Dimensional Non-recursive Ideal Low-Pass Filters One way of designing one-dimensional non-recursive digital filters is the so-called window method. To fix ideas, let us consider the design of an ideal low-pass filter. The ideal frequency response is F(u) = \ 1, for u B (24) JO, for u >B where B is a constant. (This frequency response is actually repeated periodically because the impulse response is sampled). The inverse Fourier transform f(x) of F(u), which is the impulse response, has infinite duration, but in reality we have to use a finite-duration impulse response. So we truncate f(x) by using a window: g(x)=f(x) w(x) (25) w(x) = 0, for x > A (26) then where A is a constant. The actual frequency response we are getting is G(u) = F(u) W(u) (27) Suppose now we wish to design a two-dimensional ideal low-pass filter with an ideal Frequency response F 9 (u,v) =F(v / u 2 + v 2 ) =(1, for u 2 + v 2 B 2 (28) \ 2 2 2 JO, for u +v >B And we truncate the two-dimensional impulse response f 2 (x,y) by a two- isional window w (x,y). Then the actual frequency response we are getting G 2 (u,v) = F 2 (u,v) W 2 (u,v) (29)

Let us assume that the widths of W(u) and W 2 (u,v) are much smaller than B, then near the discontinuities of F (u), viz., u = ± B, G(u) is essentially equal to the convolution of W(u) and a one-dimensional step function, and similarly, near 2 2 2 the discontinuities of F 2 (u,v), viz., u + v = B, G 2 (u,v) is essentially equal to the convolution of W 2 (u,v) and a two-dimensional step function. It therefore follows from our theorem that: if w 2 (x,y) = w (Vx 2 +y 2 ) (30) then ^ G 2 (u,v)«g(\ai" + 0 (31) This means that we can design a good two-dimensional low-pass filter by using the window w (x,y) as given by Eq. (30), if w(x) is a good window to use in designing a good one-dimensional low-pass filter. V. Summary We have shown that if w(x) is a good symmetrical one-dimensional window, / 2 2 then w (x,y) = w (\/x +y ) is a good circularly symmetrical two-dimensional window.

References 1. R. B. Blackman and J. W. Tukey, The Measurement of Power Spectra (Dover, 1959). 2. R. B. Blackman, Linear Data-Smoothing and Prediction in Theory and Practice (Addison -Wesley, 1965). 3. J. F. Kaiser, "Digital Filters, " Ch. 7 in System Analysis by Digital Computer edited by F. F. Kuo and J. F. Kaiser (Wiley, 1966). 4. H. D. Helms, "Non-recursive Digital Filters: Design Methods for Achieving Specifications on Frequency Response," IEEE Trans, on Audio and Electroacoustics, AU-16, 336-342 (September 1968). 5. A. Papoulis, Systems and Transforms with Applications in Optics (McGraw- Hill, 1969). 6. J. L. Allen, "The Theory of Array Antennas (with Emphasis on Radar Applications), " Technical Report 323, Lincoln Laboratory, M.I.T. (25 July 1963), DDC AD-422945. 7. L. R. Rabiner, B. Gold and C. A. McGonegal, "An Approach to the Approximation Problem for Non-recursive Digital Filters," IEEE Trans, on Audio and Electroacoustics, AU-18, 83-106 (June 1970).

UNCLASSIFIED Security Classification DOCUMENT CONTROL DATA - R&D (Security classification of title, body of abstract and indexing annotation must be entered when the overall report is classified) I. ORIGINATING ACTIVITY (Corporate author) Lincoln Laboratory, M.I.T. 3. REPORT TITLE Two-Dimensional Windows 2a. REPORT SECURITY CLASSIFICATION Unclassified 2b. GROUP None 4. DESCRIPTIVE NOTES (Type of report and inclusive dates) Technical Note 5. AUTHOR(S) (Last name, first name, initial) Huang, Thomas S. 6. REPORT DATE 31 December 1970 7a. TOTAL NO. OF PAGES 14 7b. NO. OF REFS 7 8a. CONTRACT OR GRANT NO. Fl9628"70-C -0230 b. PROJECT NO. 649L 9a. ORIGINATOR'S REPORT NUMBER(S) Technical Note 1970-41 9b. OTHER REPORT NO(S) (Any other numbers that may be assigned this report) ESD-TR-70-428 10. AVAILABILITY/LIMITATION NOTICES This document has been approved for public release and sale; its distribution is unlimited. II. SUPPLEMENTARY NOTES 12. SPONSORING MILITARY ACTIVITY None Air Force Systems Command, USAF 13. ABSTRACT Two-dimensional windows find applications in many diverse fields, such as the spectral estimation of random fields, the design of twodimensional digital filters, optical apodization, and antenna array design. Many good one-dimensional windows have been devised, but relatively few two-dimensional windows have been investigated. In this paper we show that good two-dimensional windows can be obtained by rotating good one-dimensional windows. That is, if w(x) is a good symmetrical onedimensional window, then W2(x,y) = w(\ (~2 2~ (N/X + y*) is a good circularly symmetrical two-dimensional window. 14. KEY WORDS digital filters optical systems antenna arrays UNCLASSIFIED Security Classification