ADAPTIVE ANTENNAS FOR WIRELESS COMMUNICATIONS
IEEE Press 445 Hoes Lane, P.O. Box 1331 Piscataway, NJ 08855-1331 IEEE P...
152 downloads
2741 Views
31MB Size
Report
This content was uploaded by our users and we assume good faith they have the permission to share this book. If you own the copyright to this book and it is wrongfully on our website, we offer a simple DMCA procedure to remove your content from our site. Start by pressing the button below!
Report copyright / DMCA form
ADAPTIVE ANTENNAS FOR WIRELESS COMMUNICATIONS
IEEE Press 445 Hoes Lane, P.O. Box 1331 Piscataway, NJ 08855-1331 IEEE Press Editorial Board Robert J. Herrick, Editor in Chief M. Akay J. B. Anderson P. M. Anderson J. E. Brewer
M. Eden M. E. El-Hawary R. F. Hoyt S. V. Kartalopoulos D. Kirk
M. S. Newman M. Pagdett W. D. Reeve G. Zobrist
Kenneth Moore, Director of IEEE Press Catherine Faduska, Senior Acquisitions Editor Linda Matarazzo, Associate Acquisitions Editor Mark Morrell, Associate Production Editor IEEE Antennas & Propagation Society, Sponsor AP-S Liaison to IEEE Press, Robert Mailloux Cover design: William T. Donnelly, WT Design
Technical Reviewers Hans Steyskal, Rome Laboratory/ERA, Hanscom AFB, MA Robert Mailloux, Rome Laboratory/ERI, Hanscomb APB, MA
Books of Related Interest from the IEEE Press PERSPECTIVES IN CONTROL ENGINEERING: Technologies, Applications, and New Directions Edited by Tariq Samad 2001 Hardcover 536 pp IEEE Order No. PC5798 ISBN 0-7803-5356-0 PHYSIOLOGICAL CONTROL SYSTEMS: Analysis, Simulation, and Estimation Mich~el C. K. Khoo 2000 Hardcover 344 pp IEEE Order No. PC5680 ISBN 0-7803-3408-6 THE CONTROL HANDBOOK Edited by William S. Levine A CRC Handbook published in cooperation with IEEE Press 1996 Hardcover 1566 pp IEEE Order No. PC5649
ISBN 0-8493-8570-9
ROBUST VISION FOR VISION-BASED CONTROL MOTION Edited by Gregory D. Hager and Markus Vincze IEEE Order No. PC5403 2000 Hardcover 264 pp
ISBN 0-7803-5378-1
ADAPTIVE ANTENNAS FOR WIRELESS COMMUNICATIONS
Edited by
George V. Tsoulos PA Consulting Group Cambridge, U.K.
IEEE Antennas & Propagation Society, Sponsor
A Selected Reprint Volume
IEEE PRESS
The Institute of Electrical and Electronics Engineers, Inc., New York
This book and other books may be purchased at a discount from the publisher when ordered in bulk quantities. Contact: IEEE Press Marketing Attn: Special Sales 445 Hoes Lane, P.O. Box 1331 Piscataway, NJ 08855-1331 Fax: +1 732 981 9334 For more information about IEEE Press products, visit the IEEE Online Catalog & Store at http://www.ieee.org/store.
© 2001 by the Institute of Electrical and Electronics Engineers, Inc.
3 Park Avenue, 17th Floor, New York, NY 10016-5997.
All rights reserved. No part of this book may be reproduced in any form, nor may it be stored in a retrieval system or transmitted in any form, without written permission from the publisher. Printed in the United States of America. 10
9
8
7
6
5
4
3
2
1
ISBN 0-7803-6016-8 IEEE Order No. PP5866
Library of Congress Cataloging-in-Publication Data
Adaptive antennas for wireless communications / edited by George V. Tsoulos. p. em. Includes bibliographical references and index. ISBN 0-7803-6016-8 1. Adaptive antennas. 2. Wireless communication systems--Equipment and supplies. I. Tsoulos, George V., 1968TK7871.67.A33 A33 2000 621.382' 4--dc21
00-040990
Contents
xi
Preface
Chapter 1
Introduction and Channel Models
1
Adaptive Antenna Systems 3 B. Widrow, P. E. Mantey, L. J. Griffiths, and B. B. Goode (IEEE Proceedings, December 1967). Overview of Spatial Channel Models for Antenna Array Communication Systems 20 R. B. Ertel, P. Cardieri, K. W. Sowerby, T. S. Rappaport, and J. H. Reed (IEEE Personal Communications Magazine, February 1998). Antenna Systems for Base Station Diversity in Urban Small and Micro Cells 33 F. C. F. Eggers, J. Tcttgard, and A. M. Oprea (Journal on Selected Areas of Communication, September 1993). A Statistical Model for Angle of Arrival in Indoor Multipath Propagation 44 Q. Spencer, M. Rice, B. Jeffs, and M. Jensen (IEEE Vehicular Technology Conference, May 1997).
Chapter 2
Adaptive Algorithms
49
Highlights of Statistical Signal and Array Processing 51 A. Hero (IEEE Signal Processing Magazine, September 1998). Application of Antenna Arrays to Mobile Communications, Part II: Beamforming and Direction-of-Arrival 95 Considerations L. C. Godara (Proceedings of the IEEE, August 1997). High-Resolution Frequency-Wavenumber Spectrum Analysis 146 J. Capon (Proceedings of the IEEE, August 1969). An Algorithm for Linearly Constrained Adaptive Array Processing 157 O. L. Frost III(Proceedings of the IEEE, August 1972). The Application of Spectral Estimation Methods to Bearing Estimation Problems 167 D. H. Johnson (Proceedings of the IEEE, September 1982). On Spatial Smoothing for Direction-of-Arrival Estimation of Coherent Signals 178 T-J. Shan, M. Wax, and T. Kailath (IEEE Transactions on Acoustics, Speech, and Signal Processing, August 1985). Detection of Signals by Information Theoretic Criteria 184 M. Wax and T. Kailath (IEEE Transaction on Acoustics, Speech, and Signal Processing, April 1985). Multiple Emitter Location and Signal Parameter Estimation 190 R. O. Schmidt (IEEE Transactions on Antennas and Propagation, March 1986). Using Spectral Estimation Techniques in Adaptive Processing Antenna Systems 195 W. F. Gabriel (IEEE Transactions on Antennas and Propagation, March 1986). Implementation of Adaptive Array Algorithms 205 R. Schreiber (IEEE Transactions on Acoustics, Speech, and Signal Processing, October 1986). v
Contents
Steady State Analysis of the Generalized Sidelobe Canceller by Adaptive Noise Cancelling Techniques 213 N. K. Jablon (IEEE Transactions on Antennas and Propagation, March 1986). Adaptive-Adaptive Array Processing 221 E. Brookner and J. M. Howell (Proceedings of the IEEE, April 1986). ESPRIT-Estimation of Signal Parameters via Rotational Invariance Techniques 224 R. Roy and T. Kailath (IEEE Transactions on Acoustics, Speech, and Signal Processing, July 1989). Spectral Self-Coherence Restoral: A New Approach to Blind Adaptive Signal Extraction Using Antenna Arrays 236 B. G. Agee, S. V. Schell, and W. A. Gardner (Proceedings of the IEEE, April 1990). Sensor Array Processing Based on Subspace Fitting 250 M. Viberg and B. Ottersten (IEEE Transactions on Signal Processing, May 1991). Direction-of-Arrival Estimation via Exploitation of Cyclostationarity-A Combination of Temporal and Spatial Processing 261 G. Xu and T. Kailath (IEEE Transactions on Signal Processing, July 1992). Space-Alternating Generalized Expectation Maximization Algorithm 272 J. A. Fessler and A. O. Hero (IEEE Transactions on Signal Processing, October 1994). Unitary ESPRIT: How to Obtain Increased Estimation Accuracy with a Reduced Computational Burden 286 M. Haardt and J. A. Nossek (IEEE Transactions on Signal Processing, May 1995). Joint Angle and Delay Estimation (JADE) for Multipath Signals Arriving at an Antenna Array 297 M. C. Vanderveen, C. B. Papadias, and A. Paulraj (IEEE Communications Letters, January 1997).
Chapter 3
Performance Issues
301
Smart Antennas for Mobile Communication Systems: Benefits and Challenges 303 G. V. Tsoulos (Electronics & Communication Engineering Journal, April 1999). 314 An Adaptive Array in a Spread-Spectrum Communication System R. T. Compton, Jr. (Proceedings of the IEEE, March 1978). 324 On the Performance of a Polarization Sensitive Adaptive Array R. T. Compton, Jr. (IEEE Transactions on Antennas and Propagation, September 1981). Effect of Mutual Coupling on the Performance of Adaptive Arrays 332 I. J. Gupta and A. A. Ksienski (IEEE Transactions on Antennas and Propagation, September 1983). Optimum Combining in Digital Mobile Radio with Co-channel Interference 339 J. H. Winters (IEEE Transactions on Vehicular Technology, August 1984). On Optimum Combining at the Mobile 351 R. G. Vaughan (IEEE Transactions on Vehicular Technology, November 1988). The Performance of an LMS Adaptive Array with Frequency Hopped Signals 359 L. Acar and R. T. Compton, Jr. (IEEE Transactions on Aerospace and Electronic Systems, May 1985). An LMS Adaptive Array for Multipath Fading Reduction 371 Y. Ogawa, M. Ohmiya, and K. Itoh (IEEE Transactions on Aerospace and Electronic Systems, January 1987). Optimum Combining for Indoor Radio Systems with Multiple Users 378 J. H. Winters (IEEE Transactions on Communications, November 1987). The Performance Enhancement of Multibeam Adaptive Base-Station Antennas for Cellular Land Mobile Radio Systems 387 S. C. Swales, M. A. Beach, D. J. Edwards, and J. P. McGeehan (IEEE Transactions on Vehicular Technology, February 1990). Combination of an Adaptive Array Antenna and a Canceller of Interference for Direct-Sequence SpreadSpectrum Multiple-Access System 399 R. Kohno, H. Imai, M. Hatori, and S. Pasupathy (IEEE Journal on Selected Areas in Communications, May 1990). Direction Finding in the Presence of Mutual Coupling 406 B. Friendlander and A. J. Weiss (IEEE Transactions on Antennas and Propagation, March 1991). vi
Contents
Improving the Performance of a Slotted ALOHA Packet Radio Network with an Adaptive Array 418 J. Ward and R. T. Compton, Jr. (IEEE Transactions on Communications, February 1992). Signal Acquisition and Tracking with Adaptive Arrays in the Digital Mobile Radio System IS-54 with Flat Fading 427 J. H. Winters (IEEE Transactions on Vehicular Technology, November 1993). Effect of Fading Correlation on Adaptive Arrays in Digital Mobile Radio 435 J. Salz and J. H. Winters (IEEE Transactions on Vehicular Technology, November 1994). 444 Capacity Improvement with Base-Station Antenna Arrays in Cellular CDMA A. F. Naguib, A. Paulraj, and T. Kailath (IEEE Transactions on Vehicular Technology, August 1994). 452 Analytical Results for Capacity Improvements in COMA J. C. Liberti and T. S. Rappaport (IEEE Transactions on Vehicular Technology, August 1994). Adaptive Transmitting Antenna Arrays with Feedback 463 D. Gerlach and A. Paulraj (IEEE Signal Processing Letters, October 1994). Adaptive Antennas for Third Generation DS-CDMA Cellular Systems 466 G. V. Tsoulos, M. A. Beach, and S. C. Swales (Proceedings of 45th Vehicular Technology Conference, July 1995). The Spectrum Efficiency of Base Station Antenna Array System for Spatially Selective Transmission 471 P. Zetterberg and B. Ottersten (IEEE Transactions on Vehicular Technology, August 1995). Capacity Enhancement and BER in a Combined SDMA/TDMA System 481 J. Fuhl and A. F. Molisch (Proceedings of the 46th Vehicular Technology Conference, April 1996). Performance of Wireless CDMA with M-ary Orthogonal Modulation and Cell Site Antenna Arrays 486 A. F. Naguib and A. Paulraj (IEEE Journal of Selected Areas in Communications, December 1996). Smart Antenna Arrays for CDMA Systems 500 J. S. Thompson, P. N. Grant, and B. Mulgrew (IEEE Personal Communications Magazine, October 1996). Efficient Direction and Polarization Estimation with a COLD Array 510 J. Li, P. Stoica and D. Zheng (IEEE Transactions on Antennas and Propagation, April 1996). Upper Bounds on the Bit-Error Rate of Optimum Combining in Wireless Systems 519 J. H. Winters and J. Salz (IEEE Transactions on Communications, December 1998). The Range Increase of Adaptive Versus Phased Arrays in Mobile Radio Systems 525 J. H. Winters and M. J. Gans (IEEE Transactions on Vehicular Technology, March 1999). 535 A Comparison of Two Systems for Downlink Communication with Base Station Antenna Arrays P. Zetterberg (IEEE Transactions on Vehicular Technology, September 1999).
Chapter 4
Implementation Issues
551
Fundamentals of Digital Array Processing 553 D. E. Dudgeon (Proceedings of the IEEE, June 1977). A Novel Algorithm and Architecture for Adaptive Digital Beamforming 560 C. P. Ward, P. J. Hargrave, and J. G. McWhirter (IEEE Transactions on Antennas and Propagation, March 1986). Nonlinearities in Digital Manifold Phased Arrays 569 B. D. Mathews (IEEE Transactions on Antennas and Propagation, November 1986). Adaptive Beamforming with the Generalized Sidelobe Canceller in the Presence of Array Imperfections 579 N. K. Jablon (IEEE Transactions on Antennas and Propagation, August 1986). 596 An Efficient Algorithm and Systolic Architecture for Multiple Channel Adaptive Filtering S. M. Yuen, K. Abend, and R. S. Berkowitz (IEEE Transactions on Antennas and Propagation, May 1988). Mutual Coupling Compensation in Small Array Antennas 603 H. Steyskal and J. S.Herd (IEEE Transactions on Antennas and Propagation, December 1995). 607 A Unified Approach to the Design of Robust Narrow-Band Antenna Array Processors M-H. Er and A. Cantoni (IEEE Transactions on Antennas and Propagation, January 1990).
vii
Contents
Design Trades for Rotman Lenses 614 R. C. Hansen (IEEE Transactions on Antennas and Propagation, April 1991). Optimum Networks for Simultaneous Multiple Beam Antennas 623 E. C. DuFort (IEEE Transactions on Antennas and Propagation, January 1992). Direction Finding in Phased Arrays with a Neural Network Beamformer 630 H. L. Southall, J. A. Simmers, and T. H. O'Donnell (IEEE Transactions on Antennas and Propagation, December 1995). Application of Orthogonal Codes to the Calibration of Active Phased Array Antennas for Communication Satellites 636 S. D. Silverstein (IEEE Transactions on Signal Processing, January 1997). The Analogy Between the Butler Matrix and the Neural-Network Direction-Finding Array 649 R. J. Mailloux and H. L. Southall (IEEE Antennas and Propagation Magazine, December 1997). Forward-Backward Averaging in the Presence of Array Manifold Errors 655 M. Zatman and D. Marshall (IEEE Transactions on Antennas and Propagation, November 1998).
Chapter 5
Experiments
661
Multiple Source DF Signal Processing: An Experimental System 663 R. O. Schmidt and R. E. Franks (IEEE Transactions on Antennas and Propagation, March 1986). An Implementation of a CMA Adaptive Array for High Speed GMSK Transmission in Mobile Communications 673 T. Ohgane, T. Shimura, N. Matsuzawa, and H. Sasaoka (IEEE Transactions on Vehicular Technology, August 1993). A Four-Element Adaptive Antenna Array for IS-136 PCS Base Stations 680 R. L. Cupo, G. D. Golden, C. C. Martin, K. L. Sherman, N. R. Sollenberger, J. H. Winters, and P. W. Wolniasky (IEEE 46th Vehicular Technology Conference, May 1996). Ericsson/Mannesmann GSM Field-Trials with Adaptive Antennas 685 S. Anderson, U. Forssen, J. Karlsson, T. Witzschel, P. Fischer, and A. Krug (IEEE 46th Vehicular Technology Conference, May 1996). 690 Preliminary Measurement Results from an Adaptive Antenna Array Testbed for GSM/UMTS P. E. Mogensen, K. I. Pedersen, P. Leth-Espensen, B. Fleury, F. Frederiksen, K. Olesen, and S. L. Larsen (IEEE Vehicular Technology Conference, May 1997). Performance Evaluation of a Cellular Base Station Multibeam Antenna 695 Y. Li, M. Feuerstein, and D. O. Reudink (IEEE Transactions on Vehicular Technology, February 1997). Space Division Multiple Access (SDMA) Field Trials. Part 1: Tracking and BER Performance 704 G. V. Tsoulos, J. McGeehan, and M. Beach (lEE Proceedings of Radar, Sonar, and Navigation, February 1998). 710 Space Division Multiple Access (SDMA) Field Trials. Part 2: Calibration and Linearity Issues G. V. Tsoulos, J. McGeehan, and M. Beach (lEE Proceedings of Radar, Sonar, and Navigation, February 1998).
Chapter 6
Applications and Planning Issues
717
High Data Rate Indoor Wireless Communications Using Antenna Arrays 719 M. J. Gans, R. A. Valenzuela, J. H. Winters, and M. J. Carloni (6th International Symposium on Personal, Indoor and Mobile Radio Communications, September 1995). On Optimizing Base Station Antenna Array Topology for Coverage Extension in Cellular Radio Networks 726 J-W. Liang and A. J. Paulraj (IEEE 45th Vehicular Technology Conference, July 1995). Usage of Adaptive Arrays to Solve Resource Planning Problems 731 M. Frullone, P. Grazioso, C. Passerini, and G. Riva (Proceedings of the 46th Vehicular Technology Conference, April 1996). viii
Contents
Subscriber Location in CDMA Cellular Networks 735 J. Caffery, Jr. and G. L. Stuber (IEEE Transactions on Vehicular Technology, May 1998). On the Capacity Formula for Multiple Input-Multiple Output Wireless Channels: A Geometric Interpretation 745 P. F. Driessen and G. J. Foschini (IEEE Transactions on Communications, February 1999). Optimum Space-Time Processors with Dispersive Interference: Unified Analysis and Required Filter Span 749 S. L. Ariyavisitakul, J. H. Winters, and I. Lee (IEEE Transactions on Communications, July 1999).
Author Index
761
Subject Index
763
ix
Preface
O
technology. The key areas are separated in six chapters as follows:
VE R the last few years, the demand for service provision via the wireless communication bearer has risen beyond all expectations. This fact introduces one of the most demanding technological challenges: the need to increase the spectrum efficiency of wireless networks. Whereas great effort until today has been focused toward the development of modulation methods, coding techniques, communication protocols, and so forth, the antenna-related technology has received significantly less attention up to now. Nevertheless, in order to achieve the ambitious requirements introduced for future wireless systems, new "intelligent" or "self-configured" and highly efficient systems will most certainly be required. In the pursuit for schemes that will solve these problems, attention has recently turned to spatial filtering methods using advanced antenna techniques: adaptive or "smart" antennas. Filtering in the space domain can separate spectrally and temporally overlapping signals from multiple mobile units, and hence the spatial dimension can be exploited as a hybrid multiple access technique complementing the basic underlying multiple access technique. Adaptive antennas have been studied for many years by the sonar and radar research communities as interferenceresistant aids (the first known case of an adaptive antenna dates back to 1959: L. C. Van Atta, Electromagnetic Reflection, U.S. Patent 29080002, October 6, 1959), and their main application until recently has been military. Advances in processor cost and speed have only recently made it possible to overcome the major obstacle of hardware cost and complexity and start considering the possibility of applying this technique to commercial communications. This book targets a very wide audience. It can be used as a reference source (e.g., in conjunction with other texts on signal processing, antennas, mobile communications) for students at the undergraduate and/or postgraduate level, academics, researchers, professionals, and managers who either are specifically interested or want to understand general aspects of this technology. In order to achieve these goals, a large number of published works on a variety of issues related to adaptive antennas have been gathered. The papers included in this volume, along with the cited references, constitute a very detailed source of information dealing with almost all the important issues related to this
Chapter 1: One introductory paper that provides important background information on adaptive antennas, followed by three papers with the channel models necessary for simulations and material dealing with the spatial characteristics of the radio channel for different operational environments. Chapter 2: Nineteen papers with the most representative, widely used and researched adaptive methods and algorithms such as MUSIC, ESPRIT, and SAGE. Chapter 3: Twenty-seven papers dealing with the issue that has attracted most of the attention in terms of research up to now, the performance of adaptive antennas with different adaptive methods and algorithms under a variety of conditions in mobile communication environments. Chapter 4: Thirteen papers dealing with implementation issues for adaptive antennas: beamforming techniques, calibration, mutual coupling, nonlinearity problems, and so forth. Chapter 5: Eight papers presenting experimental results for issues related to this technology, mainly from adaptive antenna test beds. Chapter 6: Six papers that deal with more general issues related to adaptive antennas such as specific applications for user location, indoor wireless high data rate networks, planning issues for adaptive antennas, and novel techniques that seem promising to open new directions for this technology in the future. The work included in the different chapters is sorted chronologically except for papers that present overviews or comparisons for the issues of focus in a chapter. The latter are always at the beginning of the chapter. I sincerely hope that you find this source of reference useful. If it manages to stimulate you and as a result opens new horizons for you in this very exciting and promising area, then it will have succeeded in its purpose.
George V. Tsoulos xi
Chapter One Introduction and Channel Models
A
DAPTIVE antenna arrays have long been an attractive solution to a plethora of problems related to signal detection and estimation. An array of antenna elements can overcome the directivity and beamwidth limitations of a single antenna element, and when it is combined with methods from statistical detection and estimation and control theory, a self-adjusting or adaptive system emerges. This key capability was recognized in 1967 by Widrow and his colleagues in their publication in the IEEE Proceedings, with which this book opens. This paper offers a valuable introduction to the adaptive antenna concepts. A smart antenna system relies heavily on the spatial characteristics of the operational environment to improve the output signal. In order to study the performance of
adaptive algorithms in radio operational environments (Chapters 2 and 3), it is essential to employ suitable channel models that provide both spatial and temporal information. For that reason, three papers are included in this chapter. There is still a lot of work to be done in terms of characterizing the radio channel and producing propagation models capable of providing all the information needed to efficiently study wideband systems that also exploit the spatial dimension. This need was recently underlined by the international standardization organisations, and several research activities are already under way (e.g., subgroup on spatial propagation models of the COST-European Union Forum for Cooperative Scientific ResearchAction 259).
Adaptive Antenna Systems B. WIDROW,
MEMBER, IEEE,
P. E. MANTEY, MEMBER, IEEE, L. J. GRIFFITHS, B. B. GOODE, STUDENT MEMBER, IEEE
STUDENT MEMBER, IEEE, AND
Ahstract-A system consisting of an antenna array and an adaptive processor can perform filtering in both the space and the frequency domains, thus reducing the sensitivity of the signal-receiving system to interfering directional noise sources. Variable weights of a signal processor can be automatically adjusted by a simple adaptive technique based on the least-mean-squares (LJ\lS) algorithm. During the adaptive process an injected pilot signal simulates a received signal from a desired "Iook' direction. This allows the array to be "trained" so that its directivity pattern has a main lobe in the previously specified look direction. At the same time, the array processing system can reject any incident noises, whose directions of propagation are different from the desired look direction, by forming appropriate nulls in the antenna directivity pattern. The array adapts itself to fonn a main lobe, with its direction and bandwidth determined by the pilot signal, and to reject signals or noises occurring outside the main lobe as well as possible in the minimum meansquare error sense. Several examples illustrate the convergence of the L~IS adaptation procedure toward the corresponding Wiener optimum solutions. Rates of adaptation and misadjustments of the solutions are predicted theoretically and checked experimentally. Substantial reductions in noise reception are demonstrated in computer-simulated experiments. The techniques described are applicable to signal-reech'ing arrays for use over a wide range of frequencies.
T
INTRODUCTIO~
H E SENSITIVITY of a signal-receiving array to interfering noise sources can be reduced by suitable processing of the outputs of the individual array elements. The combination of array and processing acts as a filter in both space and frequency. This paper describes a method of applying the techniques of adaptive filtering! I} to the design of a receiving antenna system which can extract directional signals from the medium with minimum distortion due to noise. This system will be called an adaptive array. The adaptation process is based on minimization of mean-square error by the LMS algorithm.[2 1- [-+] The system operates with knowledge of the direction of arrival and spectrum of the signal, but with no knowledge of the noise field. The adaptive array promises to be useful whenever there is interference that possesses some degree of spatial correlation ~ such conditions manifest themselves over the entire spectrum, from seismic to radar frequencies. .
Manuscript received May 29. 1967; revised September 5, 1967. B. Widrow and L. J. Griffiths are with the Department of Electrical Engineering, Stanford University, Stanford, Calif. P. E. Mantey was formerly with the Department of Electrical Engineering, Stanford University. He is presently with the Control and Dynamical Systems Group, IBM Research Laboratories, San Jose. Calif. B. B. Goode is with the Department of Electrical Engineering, Stanford University, Stanford, Calif., and the Navy Electronics Laboratory, San Diego, Calif.
The term "adaptive antenna" has previously been used by Van Atta[5] and others!"! to describe a self-phasing antenna system which reradiates a signal in the direction from which it was received. This type of system is called adaptive because it performs without any prior knowledge of the direction in which it is to transmit. For clarity, such a systern might be called an adaptive transmittinq array: whereas the system described in this paper might be called an adaptive receiving array. The term "adaptive filter" has been used by Jakowatz, Shuey, and White[7] to describe a systern which extracts an unknown signal from noise, where the signal waveform recurs frequently at random intervals. Davisson!"! has described a method for estimating an unknown signal waveform in the presence of white noise of unknown variance. Glaser!"! has described an adaptive system suitable for the detection of a pulse signal of fixed but unknown waveform, Previous work on array signal processing directly related to the present paper was done by Bryn. Merrnoz, and Shor. The problem of detecting Gaussian signals in additive Gaussian noise fields was studied by Bryn, (lOl who showed that. assuming K antenna elements in the array, the Bayes optimum detector could be implemented by either K 2 linear filters followed by "conventional" beam-forming for each possible signal direction, or by K linear filters for each possible signal direction. In either case, the measurement and inversion of a 2K by 2K correlation matrix was required at a large number of frequencies in the band of the signal. Merrnoz! 11] proposed a similar scheme for narrowband known signals, using the signal-to-noise ratio as a performance criterion. Shor[l:!] also used a signal-to-noise-ratio criterion to detect narrowband pulse signals. He proposed that the sensors be switched off when the signal was known to be absent, and a pilot signal injected as if it were a noisefree signal impinging on the array from a specified direction. The need for specific matrix inversion was circumvented by calculating the gradient of the ratio between the output power due to pilot signal and the output power due to noise, and using the method of steepest descent. At the same time, the number of correlation measurements required was reduced, by Shor's procedure, to 4K at each step in the adjustment of the processor. Both Mermoz and Shor have suggested the possibility of real-time adaptation. This paper presents a potentially simpler scheme for obtaining the desired array processing improvement in real time. The performance criterion used is minimum meansquare error. The statistics of the signal are assumed
Reprinted from IEEE Proceedings, \'01 55, No. 12, pp. 2143-2159, December 1967.
3
to be known, but no prior knowledge or direct measurements of the noise field are required in this scheme. The adaptive array processor considered in the study may be automatically adjusted (adapted) according to a simple iterative algorithm, and the procedure does not directly involve the computation of any correlation coefficients or the inversion of matrices. The input signals are used only once, as they occur, in the adaptation process. There is no need to store past input data; but there is a need to store the processor adjustment values, i.e., the processor weighting coefficients Cweigh ts" ). Methods of adaptation are presented here, which may be implemented with either analog or digital adaptive circuits, or by digital-computer realization.
a cycle at frequency j~ (i.e., a 90° phase shift), denoted by 1/(4/0}. The output signal is the sum of all the weighted signals, and since all weights are set to unit values, the directivity pattern at frequency fo is by symmetry the same as that of Fig. l(a). For purposes of illustration, an interfering directional sinusoidal "noise" of frequency wfo incident on the array is shown in Fig. 2(a), indicated by the dotted arrow. The angle of incidence (45.5°) of this noise is such that it would be received on one of the side lobes of the directivity pattern with a sensitivity only 17 dB less than that of the main lobe at 0=0°. If the weights are now set as indicated in Fig. 2(b)., the directivity pattern at frequency j~ becomes as shown in that figure. In this case, the main lobe is almost unchanged from that shown in Figs. l(a) and 2(a), while the particular side lobe that previously intercepted the sinusoidal noise in DIRECTIONAL AND SPATIAL FILTERING Fig. 2(a) has been shifted so that a null is now placed in the An example of a linear-array receiving antenna is shown in direction of that noise. The sensitivity in the noise direction Fig. l(a) and (b). The antenna of Fig. l(a) consists of seven is 77 dB below the main lobe sensitivity, improving the noise isotropic elements spaced ;"0/2 apart along a straight line, rejection by 60 dB. where i.. o is the wavelength of the center frequency j~ of A simple example follows which illustrates the existence the array. The received signals are summed to produce an and calculation of a set of weights which will cause a signal array output signal. The directivity pattern.. i.e., the relative from a desired direction to be accepted while a "noise from sensitivity of response to signals from various directions, a different direction is rejected. Such an example is illusis plotted in this figure in a plane over an angular range of -n/2 < f) < rc/2 for frequency J~. This pattern is symmetric trated in Fig. 3. Let the signal arriving from the deabout the vertical line 8 = o. The main lobe is cen tered at sired direction 0 = 0 be called the "pilot" signal p( t) = P () = O. The largest-amplitude side lobe.. at V= 24 . has a sin wot., where Wo ~ 2rrj~, and let the other signal. the noise, be chosen as n(l) = N sin ((Jot, incident to the receiving array maximum sensitivity which is 12.5 dB below the maximum at an angle 0 = rt/6 radians. Both the pilot signal and the main-lobe sensitivity. This pattern would be different if it noise signal are assumed for this example to be at exactly were plotted at frequencies other than f~. the same frequency .f~. At a point in space midway between The same array configuration is shown in Fig. ltb): howthe antenna array elements, the signal and the noise are ever.. in this case the output of each element is delayed in assumed to be in phase. In the example shown, there are time before being summed. The resulting directivity pattern. two identical omnidirectional array elements. spaced i~o/2 now has its main lobe at an angle of'" radians.. where apart. The signals received by each element are fed to two variable weights., one weight being preceded by a quarter. - 1 (;~oc5j~) 1 ( 1) ~ = SID - - = sIn wave time delay of 1/(4j~). The four weighted signals are d d then summed to form the array output. The problem of obtaining a set of weights to accept p(t) in which and reject net) can now be studied. Note that with any set wfo = frequency of received signal of nonzero weights, the output is of the form A sin (wa t + 4», ;"0 = wavelength at frequency j~ and a number of solutions exist which will make the output b = time-delay difference between neighboring-element be p(t). However, the output of the array must be indepenoutputs dent of the amplitude and phase of the noise signal if the d = spacing between antenna elements array is to be regarded as rejecting the noise. Satisfaction of c = signal propagation velocity = ;"oj~. this constraint leads to a unique set of weights determined as The sensitivity is maximum at angle t/J because signals re- follows. The array output due to the pilot signal is ceived from a plane wave source incident at this angle" and delayed as in Fig. l(b), are in phase with one another and produce the maximum output signal. For the example illustrated in the figure, d=A.o/2, £5=(0.12941/ j~), and thereFor this output to be equal to the desired output of p(t)=P fore t/!=sin- 1 (2£5/0 ) = 15°. There are many possible configurations for phased arrays. sin wot (which is the pilot signal itself), it is necessary that Fig. 2(a) shows one such configuration where each of the antenna-element outputs is weighted by two weights in (3) parallel, one being preceded by a time delay of a quarter of 4
. - (C6)'
4
LOOK
DIRECTION
o·
DIRECTIVITY PATTERN
"S
NOSE
S·~RECTION /(NOISE AT FRED. t.)
ANTENNA ELEMENTS
/\ d
\
I a)
o· ,
I bl W, ""'
0 .0 99
w:t- - 1.255
w] = - 0 2 6 6
.....4 =- I 51 8 """,""' 0 . 18 2 w. ~- I 6 10 w.," O.OCX>
Fig . I.
Dir ecti vit y pattern fo r a linea r a rray . (a ) Sim ple a rr ay . (0 ) Dela ys added .
" PILOT" SIGNAL p(t)=PSltlw..t
F ig. 2.
l
....\. - - I 255
Direct ivity pa tte rn o f linea r a rray . (a ) With equal weighting. (b ) With weighting fo r no ise elimina tio n.
/ ' NOISE" / n (t ) =NSl n( £)..1
I
/--K
I i
.....- - 1 2 3 3 .... ... - 0 18 2 ""10=-- 1.6 10 '* 11 0 26 6 w1z· - 1 5 19 'IIIII [] _ -0999
6 ;.'
/
/
/
i
'-------o t~f~T Fig. 3.
Array confi guration for noise elimination example.
5
With respect to the midpoint between the antenna elements, the relative time delays of the noise at the two antenna elements are ± [1/(4fo)]sin n/6 = ± 1/(810)= ± Ao/(8c), which corresponds to phase shifts of ± n/4 at frequency.fo . The array output due to the incident noise at () = n/6 is then
N
[WI sin
(root -~) + W2sin (root - 34n) + W3 sin (root + ~) +
W4
sin
(wot - ~)]
(4)
For this response to equal zero, it is necessary that Fig . 4.
(5)
Adaptive array configuration for receiving narrowband signals .
Thus the set of weights that satisfies the signal and noise response requirements can be found by solving (3) and (5) simultaneously. The solution is
(6) With these weights, the array will have the desired properties in that it will accept a signal from the desired direction. while rejecting a noise, even a noise which is at the same frequency 10 as the signal, because the noise comes from a different direction than does the signal. The foregoing method of calculating the weights is more illustrative than practical. This method is usable when there are only a small number of directional noise sources, when the noises are monochromatic, and when the directions of the noises are known a priori. A practical processor should not require detailed information about the number and the nature of the noises. The adaptive processor described in the following meets this requirement. It recursively solves a sequence of simultaneous equations. which are generally overspecified, and it finds solutions which minimize the mean-square error between the pilot signal and the total array output.
;;:5 , Fig . 5.
0
Adaptive ar ra y contigurauou for receiving broadband signals.
Thus the two weights and the I 14};) time delay provide completely adjustable linear processing for narrowband signals received by each individual antenna element. The full array of Fig. 4 represents a completely general way of combining the antenna-element signals in an adjustable linear structure when the received signals and noises are narrowband. It should be realized that the same generality (for narrowband signals) can be achieved even when the time delays do not result in a phase shift of exactly nl2 at the center frequency }~. Keeping the phase shifts CONFIGURAnONS OF ADAPTIVE ARRA YS clo se to 7[/2 is desirable for keeping required weight values Before discussing methods of adaptive filtering and signal small. but is not necessary in principle. processing to be used in the adaptive array, various spatial When one is interested in receiving signals over a wide and electrical configurations of antenna arrays will be band of frequencies. each of the phase shifters in Fig. 4 can considered. An adaptive array configuration for processing be replaced by a tapped-delay-line network as shown in narrowband signals is shown in Fig. 4. Each individual Fig. 5. This tapped delay line permits adjustment of gain antenna element is shown connected to a variable weight and phase as desired at a number of frequencies over the and to a quarter-period time delay whose output is in band of interest. If the tap spacing is sufficiently close, this turn connected to another variable weight. The weighted network approximates the ideal filter which would allow signals are summed, as shown in the figure. The signal, complete control of the gain and phase at each frequency assumed to be either monochromatic or narrowband, is in the passband . received by the antenna element and is thus weighted by a ADAPTIVE SIGNAL PROCESSORS complex gain factor AeP. Any phase angle
R+
6
The procedure should produce a given array gain in the specified look direction while simultaneously nulling out interfering noise sources. Fig. 6 shows an adaptive signal-processing element. If this element were combined with an output-signal quantizer, it would then comprise an adaptive threshold logic unit. Such an element has been called an "Adaline"[13] or a threshold logic unit (TLU).[14 1 Applications of the adaptive threshold element have been made in pattern-recognition systems and in experimental adaptive control systems.[2],[3],[14j-[17]
s lt) OUTPUT
d(t)
DESIRED RESPONSE
Fig. 6.
In Fig. 6 the input signals xt(t), ... , xi(t), ... , xn(t) are the same signals that are applied to the multiplying weights WI' ... , Wi' ... , W n shown in Fig. 4 or Fig. 5. The heavy lines show the paths of signal flow; the lighter lines show functions related to weight-changing or adaptation processes. The output signal s(t) in Fig. 6 is the weighted sum s(t) ==
n
L
i==: 1
Xi(t)Wi
Basic adaptive element.
This signal is used as a control signal for the "weight adjustment circuits" of Fig. 6.
Solving Simultaneous Equations The purpose of the adaptation or weight-changing processes is to find a set of weights that will permit the output response of the adaptive element at each instant of time to be equal to or as close as possible to the desired response. For each input-signal vector XU), the error e(j) of (10) should be made as small as possible. Consider the finite set of linear simultaneous equations
(7)
where n is the number of weights: or, using vector notation
(8) where W T is the transpose of the weight vector
WTX(l)
W TX(2)
= =
d(l)
d(2) (11)
WTX(N)
=
d(N)
where N is the total number of input-signal vectors; each vector is a measurement of an underlying n-dimensional random process. There are N equations, corresponding to N instants of time at which the output response values are of concern ~ there are n "unknowns," the n weight values which form the components of W. The set of equations (11) will usually be overspecified and inconsistent, since in the present application, with an ample supply of input data, it is usual that N» 11. [These equations did have a solution in the simple example represented in Fig. 3. The solution is For digital systems, the input signals are in discrete-time given in (6). Although the simultaneous equations (3) in that example appear to be different from (11), they are really the sampled-data form and the output is written same, since those in (3) are in a specialized form for the case (9) when all inputs are deterministic sinusoids which can be easily specified over all time in terms of amplitudes, phases, where the index j indicates the jth sampling instant. and frequencies.] In order that adaptation take place, a "desired response" When N is very large compared to n, one is generally signal., d(t) when continuous or dU) when sampled, must be interested in obtaining a solution of a set of N equations supplied to the adaptive element. A method for obtaining this signal for adaptive antenna array processing will be [each equation in the form of (10)] which minimizes the sum of the squares of the errors. That is, a set of weights W discussed in a following section. The difference between the desired response and the out- is found to minimize put response forms the error signal £U): N (12) L c; 2 U)·
and the signal-input vector is
( 10)
j= I
7
When the input signals can be regarded as stationary stochastic variables, one is usually interested in finding a set of weights to minimize mean-square error. The quantity of interest is then the expected value of the square of the error, i.e., the mean-square error, given by
to solve (19). This solution is generally straightforward, but presents serious computational problems when the number of weights n is large and when data rates are high. In addition to the necessity of inverting an n x n matrix, this method may require as many as n(n+ 1)/2 autocorrelation and crosscorrelation measurements to obtain the elements of $(x, x). E[£2(j)] £ 2. (13) Furthermore, this process generally needs to be continually The set of weights that minimizes mean-square error can repeated in most practical situations where the input signal statistics change slowly. No perfect solution of (19) is posbe calculated by squaring both sides of (10) which yields sible in practice because of the fact that an infinite stac; 2 U) = d 2(j) + WTX(j)XU)TW - 2dU)WTX(j) (14) tistical sample would be required to estimate perfectly the elements of the correlation matrices. and then taking the expected value of both sides of (14) Two methods for finding approximate solutions to (19) E[82 U)] = E[d 2 + WTXU)XTU)JV - 2W T dU)XU)] will be presented in the following. Their accuracy is limited = E[d2 ] + WT<J)(.r, x)W - 2W T<J)(x, (l) (15) by statistical sample size, since they find weight values based on finite-time measurements of input-data signals. These where methods do not require explicit measurements of correlation functions or matrix inversion. They are based on gradient-search techniques applied to mean-square-error functions. One of these methods, the LMS algorithm, does not even require squaring, averaging, or differentiation in order to make use of gradients of mean-square-error funcX,.X 1 tions. The second method, a relaxation method, will be discussed later. and The LJ\1S Alqorithm
A number of weight-adjustment procedures or algorithms exist which minimize the mean-square error. Minimization (17) is usually accomplished by gradient-search techniques. One method that has proven to be very useful is the LMS Xi" algorithm.[1}-{3J.(17 1 This algorithm is based on the method of steepest descent. Changes in the weight vector are made along the direction of the estimated gradient vector. Accordingly, The symmetric matrix (J)(x, x) is a matrix of cross correlaW(j + 1) = W(j) + k.~V(j) C~O) tions and autocorrelations of the input signals to the adaptive element, and the column matrix
VE[82 ]
= 2(x, (/).
mean-square-error function is to take the gradient of a single time sample of the squared error
(18)
When the choice of the weights is optimized, the gradient is zero. Then
From (10) V[r.(j)] = V[d(j) - WT(j)X(j)]
(19)
= -
The optimum weight vector WLMS is the one that gives the least mean-square error. Equation (19) is the Wiener-Hopf equation, and is the equation for the multichannel leastsquares filter used by Burg(18) and Claerbout-'"! in the processing of digital seismic array data. One way of finding the optimum set of weight values is
Thus
X(j).
v(j) = - 28(j)X{j).
(21)
The gradient estimate of(21) is unbiased, as will be shown by the following argument. For a given weight vector W(j),
8
the expected value o f the gradient es tim ate is
E[V(j)J =
- 2E[ ld (j ) - WT(j )X(j )}X(j)J 2[$ (x , d) - WT(j )$(x , x )].
= -
wE IGHT SETTING
(22)
Comparing (18) and (22), we see th at
E[ V(j)J = VE[I;2] WEIGHT SETT ING
and therefore, for a give n weight vector. th e expec ted va lue o f the esti mate eq ua ls the true va lue. Using the g ra d ient es timatio n form ula give n in (2 1), th e weig ht iteration rule (20) becomes W(j
+
I)
=
W (j ) - 2k,l;(j)X(j)
(b)
ERROR SlGNAL
Fig . 7, Bloc k d iag ra m rep resentat ion o r LMS a lgo rith m. (a) D igital rea lizatio n, (b ) A na log real iza tio n,
a nd th e next weight vecto r is o btai ned by adding to th e present weight vect or the input vector sca led by th e value of the error. The LMS a lgo rithm is given by (23). It is d irectl y usable as a weight-adaptation formula for digital sys te ms . Fig. 7(a) sho ws a block-diagram re prese n ta tio n of thi s eq ua tio n in terms of one component lV i o f th e weight vector W. An eq uiva len t diffe rent ial equatio n which can be used in a nalog implementation of conti n uo us sys te ms (see Fi g. 7(b)) is given by
d
- W(f) dt
=
" It )
(23)
,,<>---
-
--{ /}--
' . o---
_ - {/}--
'-----.,.
-
-"'
-2 k,;;( £) Xlt ). d =OESlRED. RESPONSE . SIGNAL
This equat ion can a lso be writt en as
WIt)
= -
Fig . x.
Ot
21\,
Jo
1;1~)Xf~J d~ .
E[Wlj
F ig. S sho ws how ci rc ui try of the type indi ca ted in F ig. 7(a) o r tb ) might be inco rpora ted into the im p lementa tio n of the ba sic adaptive elem ent o f Fig. 6. Conterqence of the ,\1 l!all
or the Pr'l!iyhr
+
I I]
= [I +
~ k ,$\ s ..,,}] j - ln/ (Ol
L: 1
[I
i =0
+
2k ,$(s. S)T $(s . d) .
(~ 5 )
Equ ati on (25) ma y be put in di ag on al fo rm by using the appropriate simil arity tran sformat ion Q for th e matri x $ (s. .x}, that is.
VeClvr
$\ s . s l =
Q- I EQ
whe re
0
0 e,
0
0
L' l
o o
E~
is th e diagon al matrix o f eigen values. The eigen values are a ll positi ve, since $ (x, x) is positive definite [ see (16)]. Equat ion (25) m a y no w be ex pressed as
E[ WU + 1)] = [ I
+ 2k, Q - 1 EQ]i + t W(0) j
1)]= E[ W( j)] - 2k,E[ :tI(j) - W /(j)X(j ))X (j )]
= [I +
+
- 2k,
For the purpose of the following di scu ssion. we assume that the time between s uccessive iterations o f th e LMS a lgo rithm is su fficien tly lon g so th at the sa m p le inpu t vecto rs X(j ) a nd Xtj + I) are unco rrela ted , Thi s assumptio n is co mmon in the field of stoc ha stic a pproxi ma tio n.1201-122] Becau se th e wei gh t vec to r W(j) is a func tio n only o f th e inp ut vecto rs X(j-I ), X(j-2), " ' . XIO) [ see (23)J and beca use th e successive in put vec tors a re un correlat ed. W (j ) is independent o f X(j). For sta tio na ry input pr ocesses meeting thi s condition, the expec ted valu e E[W(j)] o f the weight vecto r afte r a la rge number of ite ra tio ns ca n th en be sho wn to co nve rge to th e Wiener so lutio n given by (19 ). T aking th e ex pec ted va lue of bo th sides o f (23). we obtain a differen ce eq ua tion in t he ex pec ted va lue of the weight vector
E[W(j
A nulog d igita l rmplcm entution of L7vlS weig ht-adjustme nt a lgo rit hm.
- 2k,
I
21-:,$ (.\: . .\: )] E[W(j)] - 2k,$( .\:. til (24)
= Q -t[! +
where 1 is the identity matrix. With an initial weight vect or WID). j + I iterations o f (24) yield
- 2k sQ -
9
+ 2ksQ - t EQ J «I>(x , d)
[I
i= O
2k, E]i + I QW(O) j
I
I
i =O
[1 +
2k sE]iQ$( X, d).
(26)
Consider the diagonal matrix [I + 2k~J. As long as its diagonal terms are all of magnitude less than unity
"
I 1 E[x?J
+ 2k sEJi+ 1 --+ 0
lim [1
i- 00
1
....
p
Thus, in the limit, (26) becomes lim E[W(j ) - 00
+
I)J= Q-1E-1Q(x, d)
=
(J) - 1(x, X )
d).
Comparison of this result with (19) shows that as the number of iterations increases without limit, the expected value of the weight vector converges to the Wiener solution. Convergence of the mean of the weight vector to the Wiener solution is insured if and only if the proportionality constant k s is set within certain bounds. Since the diagonal terms of [I + 2ksE] must all have magnitude less than unity. and since all eigenvalues in E are positive, the bounds on ks are given by
r= p
2( -
1 ,p=1~2~···.n ks)ep
r
- - < k, < 0
where em ax is the maximum eigenvalue of
(28)
where trace [(J)(x, x)J £ E[XT(j)X(j)]
=
n
I
i= 1
E[xfJ !
total input power,
it follows that satisfactory convergence can be obtained with n
I
i= 1
-1
E[xrJ
< ks <
1
== - - 2( -
(27)
e max
(30)
where e p is the pth eigenvalue of the input-signal correlation matrix (J)(x, x], In the special case when all eigenvalues are equal, all time constants are equal. Accordingly,
or -1
(29)
State-variable methods, which are widely used in modern control theory, have been applied by Widrow!'! and Koford and Gronerlf to the analysis of stability and time constants (related to rate of convergence) of the LMS algorithm. Considerable simplifications in the analysis have been realized by expressing transient phenomena of the system adjustments (which take place during the adaptation process) in terms of the normal coordinates of the system. As shown by Widrow, [1} the weight values undergo transients during adaptation. The transients consist of sums of exponentials with time constants given
I (1 + 2k.ep)' = 1 _ (1 + 2k) = ~k . se se p
o.
Time Constants and Learning Curve with LMS Adaptation
-1
i= 0
k, <
It is the opinion of the authors that the assumption of independent successive input samples used in the foregoing convergence proof is overly restrictive. That is, convergence of the mean of the weight vector to the LMS solution can be achieved under conditions of highly correlated input samples. In fact, the computer-simulation experiments described in this paper do not satisfy the condition of independence.
where the formula for the sum of a geometric series has been used, that is, .
«
i=
and the first term of (26) vanishes as the number of iterations increases. The second term in (26) generally converges to a nonzero limit. The summation factor I{=o[l +2k sEJi becomes
00
-1
o.
One very useful way to monitor the progress of an adaptive process is to plot or display its "learning curve." When mean-square error is the performance criterion being used, one can plot the expected mean-square error at each stage of the learning process as a function of the number of adaptation cycles. Since the underlying relaxation phenomenon which takes place in the weight values is of exponential nature, and since from (15) the mean-square error is a quadratic form in the weight values" the transients in the mean-square-error function must also be exponential in nature. When all the time constants are equal, the mean-squareerror learning curve is a pure exponential with a time constant r
'tmse
In practice, when slow, precise adaptation is desired, k s is usually chosen such that
10
ks)e
= 2=
1
4( -ks)e·
The basic reason for this is that the square of an exponential function is an exponential with half the time constant.
Estimation of the rate of adaptation is more complex when the eigenvalues are unequal. When actual experimental learning curves are plotted, they are generally of the form of noisy exponentials because of the inherent noise in the adaptation process. The slower the adaptation, the smaller will be the amplitude of the noise apparent in the learning curve.
M isadjustment with Ll\1 S Adaptation All adaptive or learning systems capable of adapting at real-time rates experience losses in performance because their system adjustments are based on statistical averages taken with limited sample sizes. The faster a system adapts. in general" the poorer will be its expected performance. When the LMS algorithm is used with the basic adaptive element of Fig. 8, the expected level of mean-square error will be greater than that of the Wiener optimum system whose weights are set in accordance with (19). The longer the time constants of adaptation" however" the closer the expected performance comes to the Wiener optimum performance. To get the Wiener performance. i.e.. to achieve the minimum mean-square error. one would have to know the input statistics a priori, or. if (as is usual) these statistics are unknown. they would have to be measured with an arbitrarily large statistical sample. When the LMS adaptation algorithm is used. an excess mean-square error therefore develops. .A measure of the extent to which the adaptive system is rnisadjusted as compared to the Wiener optimum system is determined in a performance sense by the ratio of the excess mean-square error to the minimum mean-square error. This dimensionless measure of the loss in performance is defined as the "misadjustrnent" AJ. For LMS adaptation of the basic adaptive element. it is shown by Widrow' 11 that " dijustrnent M isa
~ _. 1 ,\;f == ,.1 L -
p= 1
Tp
(31)
The value of the rnisadjustment depends on the time constants (settling times) of the filter adjustment weights. Again. in the special case when all the time constants are equal, M is proportional to the number q( weights and inversely proportional to the time constant. That is. 11
A1 ==2r n
(32)
Although the foregoing results specifically apply to statistically stationary processes, the LMS algorithm can also be used with nonstationary processes. It is shown by Widrow[ 2 3 1 that, under certain assumed conditions, the rate of adaptation is optimized when the loss of performance resulting from adapting too rapidly equals twice the loss in performance resulting from adapting too slowly.
ADAPTIVE SPATIAL FILTERING
If the radiated signals received by the elements of an adaptive antenna array were to consist of signal components plus undesired noise, the signal would be reproduced (and noise eliminated) as best possible in the least-squares sense if the desired response of the adaptive processor were made to be the signal itself. This signal is not generally available for adaptation purposes, however. If it were available, there would be no need for a receiver and a receiving array. In the adaptive antenna systems to be described here. the desired response signal is provided through the use of an artificially injected signal" the "pilot signal", which is completely known at the receiver and usually generated there. The pilot signal is constructed to have spectral and directional characteristics similar to those of the incoming signal of interest. These characteristics may, in some cases, be known a priori but, in general, represent estimates of the parameters of the signal of interest. Adaptation with the pilot signal causes the array to form a beam in the pilot-signal direction having essentially flat spectral response and linear phase shift within the passband of the pilot signal. Moreover. directional noises impinging on the antenna array will cause reduced array response (nulling) in their directions within their passbands. These notions are demonstrated by experiments which will be described in the following. I njection of the pilot signal could block the receiver and render useless its output. To circumvent this difficulty, two adaptation algorithms have been devised, the .... onemode" and the "two-mode." The two-mode process alternately adapts on the pilot signal to form the beam and then adapts on the natural inputs with the pilot signal off to eliminate noise. The array output is usable during the second 1110de., while the pilot signal is off. The one-mode algorithm permits listening at all times. but requires more equipment for its implementation.
The Two-Mode Adaptation Alqorithm Fig. 9 ill ustrates a method for providing the pilot signal wherein the latter is actually transmitted by an antenna located some distance from the array in the desired look direction. Fig. 10 shows a more practical method for providing the pilot signal. The inputs to the processor are connected either to the actual antenna element outputs (during "mode II"), or to a set of delayed signals derived from the pilot-signal generator (during "mode 1'''). The filters b l ' . . . , bK (ideal time-delays if the array elements are identical) are chosen to result in a set of input signals identical with those that would appear if the array were actually receiving a radiated plane-wave pilot signal from the desired "look" direction, the direction intended for the main lobe of the antenna directivity pattern. During adaptation in mode I, the input signals to the adaptive processor derive from the pilot signal, and the desired response of the adaptive processor is the pilot signal
11
ANTENNAS I ~-..,.-----l
\
OUTPuT
Fig. 9. Adaptation with external pilot-signal generator. Mode I: adapration with pilot signal present ; Mode II : adaptation wah pilot signal absent.
/
Fig. II.
ADAPTIVE
~
!
ERROR
n . ~--_. MOOE
MOOE ;
r I
:
/
/
)
Single-m ode adaptation with pilot signal.
The One-Mode Adaptation Algorithm
DESIRED RESPONSE
~-----_._-
/
/
\
of all signals received by the antenna elements which are uncorrelated with the pilot signals, subject to the constraint that the gain and phase in the beam approximate predetermined values at the frequencies and angles dictated by the pilot-signal components.
SIGNAL 1--...--."..""" , OUTPUT 1,i. ----fS,·t-<'"""-----1 PROCESSOR I
/
/
\
PILOT SIGNAL
GENERATCR
Fig. 10. Two-mode ada ptuuo n wuh Internal pilot- signal generato r. Mode I : adaptation with pilot Signal present : Mode II : adaptuuon with pilot signal a bsent.
itself. If a sinusoidal pilot signal at trequencyj., is used. for example, adapting the weights to minimize mean-square error will force the gain of the antenna array in the look direction to have a specific amplitude and a specific phase shift at frequency j~. During adaptation in mode II. all signals applied to the adaptive processor are received by the antenna elements from the actual noise field. In this mode , the adaptation process proceeds to eliminate all received signals. since the desired response is set to zero . Continuous operation in mode II would cause all the weight values to tend to zero. and the system would shut itself off. However, by alternating frequently between mode I and mode II and causing only small changes in the weight vector during each mode of adaptation, it is possible to maintain a beam in the desired look direction and, in addition, to minimize the reception of incident-noise power. The pilot signal can be chosen as the sum of several sinusoids of differing frequencies. Then adaptation in mode I will constrain the antenna gain and phase in the look direction to have specific values at each of the pilot-signal frequencies. Furthermore, if several pilot signals of different simulated directions are added together, it will be possible to constrain the array gain simultaneously at various frequencies and angles when adapting in mode I. This feature affords some control of the bandwidth and beamwidth in the look direction. The two-mode adaptive process essentially minimizes the mean-square value (the total power)
In the two-mode adaptation algorithm the beam is formed during mode L and the noises are eliminated in the least-squares sense (subject to the pilot-signal constraints) in mode II. Signal reception during mode I is impossible because the processor is connected to the pilot-signal generator. Reception can therefore take place only during mode II. This difficulty is eliminated in the system of Fig. II. in which the actions of both mode [ and mode II can be accomplished simultaneously. The pilot signals and the received signals enter into an auxiliarv. adaptive processor. just as des~ribed prev iously . For this processor. the desired response is the pilot signal p(t ). A second weighted processor (linear element) generates the actual array output signal. but it performs no adaptation . Its input signals do not contain the pilot signal. It is slaved to the adaptive processor in such a way that its weights track the corresponding weights of the adapting system. so that it never needs to receive the pilot signal. In the single-mode system of Fig. II. the pilot signal is on continuously. Adaptation to minimize mean-square error will force the adaptive processor to reproduce the pilot signal as closely as possible, and. at the same time. to reject as well as possible (in the mean-square sense) all signals received by the antenna elements which are uncorrelated with the pilot signal. Thus the adaptive process forces a directivity pattern having the proper main lobe in the look direction in the passband of the pilot signal (satisfying the pilot signal constraints), and it forces nulls in the directions of the noises and in their frequency bands. Usually, the stronger the noises , the deeper are the corresponding nulls.
12
COMPUTER SIMULATION OF ADAPTIVE ANTENNA SYSTEMS
To demonstrate the performance characteristics of adaptive antenna systems, many simulation experiments, involving a wide variety of array geometries and signal-
9~o' I
i
9 ! I
+- -
o
o
(0I
0
o -0 - - 9~90'
o
ANTENNA ~ &----j
I b)
Fig. 12.
Array configurati on and pr oce ssing fo r narrowband experiments .
DESIRED
"LOOK" DlRECOON '
' I .
- ".
.-
40" .
-DIRECTION OF SINUSQlQAL NOISE
r
..
..,.
r
..
T ~ I OO
I. '
T- 0 5
" r
" ;-.. 30 0
T- 4
r r-50
T _ 4 00
~.. '
Fig . 13. Evolution of the directivity pattern while learning to eliminate a d irccuonal no ise and uncorrelatcd noises . (Arra y configuration of Fig . 12.) T = number of elapsed cycles of frequenc yj., (total number of adaptations = 20n.
and noise-field configurations, have been carried out using an IBM 1620-11 computer equipped with a digital output plotter. For simplicity of presentation, the examples outlined in the following are restricted to planar arrays composed of ideal isotropic radiators. In every case, the LMS adaptation algorithm was used . All experiments were begun with the initial condition that all weight values were equal. Narrowband Processor Experiments
used . The pilot signal was a unit-amplitude sine wave (power = 0.5, frequency fo) which was used to train the array to look in the ()= 0° direction. The noise field consisted of a sinusoidal noise signal (of the same frequency and power as the pilot signal) incident at angle () = 40°, and a small amount of random, uncorrelated, zero-mean, "white" Gaussian noise of variance (power)=O.1 at each antenna element. In this simulation, the weights were adapted using the LMS two-mode algorithm. Fig. 13 shows the sequence of directivity patterns which evolved during the "learning" process. These computerplotted patterns represent the decibel sensitivity of the array at frequency fo. Each directivity pattern is computed from the set of weights resulting at various stages of adaptation. The solid arrow indicates the direction of arrival of the interfering sine-wave noise source. Notice that the initial directivity pattern is essentially circular. This is due to the symmetry of the antenna array elements and of the initial weight values. A timing indicator T, the number of elapsed cycles of frequency j~ , is presented with each directivity pattern. The total number of adaptations equals 20T in these experiments. Note that if j~ = I kl-lz, T = I corresponds to I ms real time : if j~= 1 MHz. T= 1 corresponds to I us. etc. Several observations can be made from the series of directivity patterns of Fig . 13. Notice that the sensitivity of the array in the look direction is essentially constant during the adaptation process. Also notice that the array sensitivity drops very rapidly in the direction of the sinusoidal noise source : a deep notch in the directivity pattern forms in the noise direction as the adaptation process progresses. After the adaptive transients died out. the array sensitivity in the noise direction was '27 dB below that of the array in the desired look direction. The total noise power in the array output is the sum of the sinusoidal noise power due to the directional noise source plus the power due to the "white" Gaussian. mutually uncorrelated noise-input signals. The total noise power generally drops as the adaptation process commences, until it reaches an irreducible level. A plot of the total received noise power as a function of T is shown in Fig. 14. This curve may be called a "learning curve." Starting with the initial weights, the total output noise power was 0.65, as shown in the figure. After adaptation. the total output noise power was 0.01. In this noise field, the signal -to-noise ratio of the array! after adaptation was better than that of a single isotropic receiving element by a factor of about 60. A second experiment using the same array configuration and the two-mode adaptive process was performed to investigate adaptive array performance in tile presence of several interfering directional noise sources. In this example, the noise field was composed of five directional sinus-
Fig. 12 shows a twelve-clement circular array and signal processor which was used to demonstrate the performance of the narrowband system shown in Fig. 4. In the first computer simulation, the two-mode adaptation algorithm was
, Signal-to-noi se ratio is defined as
SNR =
13
array output power due to signal array output power due to noise
1.0
DESIRED
'. r -. .....___" LOOK " DIRECT ION . - :.-- "
a: O.B
INITIAL NOISE POWER
~
\ 'J - •
;
w !!l06
-
!
...
RECTION CF
SlNUSC1DAL NOISES
o
z
T- 150
...::>
a. ~O.4
o
'.= - 0 0 0 25
...J
~ 0 .2
T-IO
'- ---
T_300
o L_---I.-=======±==~ 400 10 0 200 300 o TIME . T ( cycles of f.)
Fig. 14.
Learning curve for narrowband system of Fig . 12. with noise from one direction onl y.
I( T.5 0 0
TABLE I
I'
SENSITIVITIES OF ARRAY IN DIRECTlO:-;S Of HIE FIVE :-JOISE SOl'R(,[~~ OF FIG . 15. AFTER ADAPTATlo:-;
Noise Direction td egrecs )
Noise Frequency (times 10 )
67 134 191 236 338
1.\0 0 .95 1.00 O.l)O I.OS
Array Sensitivity in Noise Direcu on , Relative to Sensitivit y in De sired Lo ok Directi on (dB)
n
24 4r ms e
T-68 2
r-
( a)
-30
- 2S -30
- .~ X
6 14
= - - = - - = -00 = 0.43 percent. 4r ms e
T-70
-26
oidal noises , each of amplitude 0.5 and power 0.125. acting simultaneously, and, in addition. superposed uncorrelated "white" Gaussian noises of power 0,5 at each of the antenna elements. The frequencies of the five directional noises are shown in Table 1. Fig. 15(a) shows the evolution of the directivity pattern. plotted at frequency j ;j, from the initial conditions to the finally converged (adapted) state. The latter was achieved after 682 cycles of the frequency j~. The learning curve for this experiment is shown in Fig . 15(b). The final array sensitivities in the five noise directions relative to the array sensitivity in the desired look direction are shown in Table 1. The signal-to-noise ratio was improved by a factor of about IS over that of a single isotropic radiator, In Fig. 15(b), one can roughly discern a time constant approximately equal to 70 cycles of the frequency fo. Since there were 20 adaptations per cycle of j~, the learn ing curve time constant was approximately 'mse = 1400 adaptations. Within about 400 cycles of 10, the adaptive process virtually converges to steady state. If fo were 1 MHz, 400 J1s would be the realtime settling time . The misadjustment for this process can be roughly estimated by using (32), although actually all eigenvalues were not equal as required by this equation : M
,.
This is a very low value of misadjustment, indicating a very slow, precise adaptive process. This is evidenced by the
F iu, 15. Evoluti on o f the direcriv uv pattern whr lc lcurrung III elim inate - live direction al noise s and uncorrelutcd no ises. I.·\rra~ configuration o f Fig . 12.) (a) Sequence of dircctiv ity patterns Juring adaptation. (b) Learning curve uotal number o f adaptations = 20T) .
learning curve Fig. 15(b) for this experiment. which is very smoo th and noise-free. Broadband Processor Experiments
Fig . 16 shows the antenna a rra y configuration and signal processor used in a series of computer-simulated broadband experiments. In these experiments, the one-mode or simultaneous adaptation process was used to adjust the weights, Each antenna or element in a five-element circular array was connected to a tapped delay line having five variable weights. as shown in the figure. A broadband pilot signal was used, and the desired look direction was chosen (arbitrarily, for purposes of exam ple) to be ()= - 13 . The frequency spectrum of the pilot signal is shown in Fig. 17(a). This spectrum is approximately one octave wide and is centered at frequency lo. A time-delay increment of I /(4j~) was used in the tapped delay line, thus providing a delay between adjacent weights of a quarter cycle at fre14
2 .0
1.6
...
a::
...
r
19 =0'
lJf:SlRED
LOOK
~
DIRECTION
-\~.
I I
~ O.8
0. ....
-0-" I -,
I 10 I
1.2
'" g
-,. , rA
(5
;q
0.0
II
,, ,,
0 '
(0
25
I
50
75
TIME . T (cycles of f.)
10 0
2 .0
1.6
a:
~
:r 12 ...
'" 6
Fig. 16. Array configura tio n a nd pr ocessing for broadband experiments. (a) Arra y geo metry . (b) Ind ividu al d ement signa l processor.
z
....0 8
~:0
o
kl == - 0 .0002 5
0 .0 0
a:
0.8 1.
'" 3:
1
o
~
in
500
TIME. T
750
(cyCles 01
t.l
1000
1250
F ig. 18. Learning. curves for broa d ba nd experiments. t a ) Rapid lea rni ng 1.\1= 13 percent ). (b l Slow lea rmng IM = 1.3 percent ). .PILOT SIGNAL
0.
.J 06
250
(b )
I
AT - i ,3-
w
JESrRED _OOK
~ 0 .4
"... w
9 - - 13' ' 8 - 0 '
DIRECTION
a:
02
°0L..L-_ _ ..J,---:>....~2----:3 - ---:.
10 )
REL ATIV E FREOUENCY. f I I.
10 )
'0 DESIRED LOOK
08
a::
~ 06 w
'" 6 z
8--13'
DIRECTION-
SPECTRUM OF NOiSE INCIDENT AT - 70 ·
SPECTRUM OF NOISE INCIDENT AT 50'
w
~ 0.4
'"a: ..J
Fig. 19. Comparison o r optimum broadband dire cti vity pattern with experimental pattern after former has been adapted during 625 cycles o r .I~ . (Plo tted at frequency fo ') (a ) Optimum pattern. (b) Adapted with k , = -0.00025.
W
0.2
(b)
Fig. 17.
I 2 3 RELATI VE FREOUENCY, f / f.
4
Freq ue ncy spect ra to r br oadband experiments. (a I Pilot signa l a t 0= - 13 ' . (b) Incid ent noises at 0 = 50 ' and 0 = - 70 '
15
quency 10, and a total delay-line length of one wavelength 19(b), the broadband directivity pattern which resulted at this frequency. from adaptation (after 625 cycles of 10' with k s = -0.0025) The computer-simulated noise field consisted of two is plotted for comparison with the optimum broadband wideband directional noise sources/ incident on the array pattern. Note that the patterns are almost indistinguishable at angles ()= 50 u and 0 = - 70 u • Each source of noise had from each other. power 0.5. The noise at 8= 50° had the same frequency The learning curves of Fig. 18(a) and (b) are composed spectrum as the pilot signal (though with reduced power): of decaying exponentials of various time constants. When while the noise at 8 = - 70° was narrower and centered at k, is set to - 0.00025, in Fig. 18(b), the misadjustment is a slightly higher frequency. The noise sources were un- about 1.3 percent, which is a quite small, but practical value. correlated with the pilot signal. Fig. 17(b) shows these fre- With this rate of adaptation, it can be seen from Fig. 18(b) quency spectra. Additive "white" Gaussian noises (mutually that adapting transients are essentially finished after about uncorrelated) of power 0.0625 were also present in each of 500 cycles of"j~. If j~ is 1 MHz, for example, adaptation could be completed (if the adaptation circuitry is fast the antenna-element signals. enough) in about 500 ps. If j~ is 1 kHz, adaptation could To demonstrate the effects of adaptation rate, the experiments were performed twice, using two different values be completed in about one-half second. Faster adaptation (-0.0025 and -0.00025) for k s ' the scalar constant in (23). is possible, but there will be more misadjustment. These Fig. 18(a) and (b) shows the learning curves obtained under figures are typical for an adaptive antenna with broadband these conditions. The abscissa of each curve is expressed noise inputs with 25 adaptive weights. For the same level in cycles ofj~, the array center frequency ~ and, as before, of misadjustment, convergence times increase approxithe array was adapted at a rate of twenty times per cycle mately linearly with the number of weights.!!' The ability of this adaptive antenna array to obtain of j~. Note that the faster learning curve is a much more "frequency tuning" is shown in Fig. 20. This figure gives noisy one. Since the statistics of the pilot signal and directional the sensitivities of the adapted array (after 1250 cycles of noises in this example are known (having been generated in j~ at k.. = - 0.(0025) as a function of freq uency for the the computer simulation), it is possible to check measured desired look direction. Fig. 20(a), and for the two noise values of misadjustment against theoretical values. Thus directions. Fig. 20(b) and (c). The spectra of the pilot signal the «D(x, x) matrix is known, and its eigenvalues have been and noises are also shown in the figures. In Fig. 20(a). the adaptive process tends to make the computed.' Using (30) and (31) and the known eigenvalues, the mis- sensitivity of this simple array configuration as close as adjustment for the two values of k, is calculated to give the possible to unity over the band of frequencies where the pilot signal has finite power density. Improved performance following values: might be attained by adding antenna elements and by adding more taps to each delay line: or.. more simply. by bandTheoretical Experimental k.. limiting the output to the passband of the pilot signal. Fig. Value of.W Value of Jt 20(b) and (c) shows the sensitivities of the array in the direc0.1288 0.134 -0.0025 tions of the noises. Illustrated in this figure is the very strik0.Ol70 0.0129 -0.00025 ing reduction of the array sensitivity in the directions of the noises, within their specific passbands. The same idea is The theoretical values of misadjustment check quite well illustrated by the nulls in the broadband directivity patterns with corresponding measured values. which occur in the noise directions" as shown in Fig. 19. From the known statistics the optimum (in the least- After the adaptive transients subsided in this experiment, squares sense) weight vector Wl MS can be computed, us-ing the signal-to-noise ratio was improved by the array over (19). The antenna directivity pattern for this optimum weight that of a single isotropic sensor by a factor of 56. vector WLMS is shown in Fig. 19(a). This is a broadband directivity pattern, in which the relative sensitivity of the I MPLEMENTATION array versus angle of incidence is plotted for a broadband The discrete adaptive processor shown in Figs. 7(a) and received signal having the same frequency spectrum as the pilot signal. This form of directivity pattern has few side 8 could be realized by either a special-purpose digital apparatus or a suitably programmed general-purpose malobes, and nulls which are generally not very deep. In Fig. chine. The antenna signals would need analog-to-digital conversion, and then they would be applied to shift regis2 Broadband directional noises were computer-simulated by first ters or computer memory to realize the effects of the tapped generating a series of uncorrelated ("white") pseudorandom numbers. applying them to an appropriate sampled-data (discrete. digital) filter to delay lines as illustrated in Fig. 5. If the narrowband scheme achieve the proper spectral characteristics. and then applying the reshown in Fig. 4 is to be realized, the time delays can be sulting correlated noise waveform to each of the simulated antenna eleimplemented either digitally or by analog means (phase ments with the appropriate delays to simulate the effect of a propagating wavefront. shifters) before the analog-to-digital conversion process. 3 They are: 10.65,9.83, 5.65~ 5.43, 3.59, 3.44,2.68, 2.13. ) .45~ 1.35. 1.20. The analog adaptive processor shown in Figs. 7(b) and 8 0.99,0.66, 0.60,0.46, 0.29, 0.24, 0.20, 0.16, 0.12. 0.01,0.087,0.083.0.075, could be realized by using conventional analog-computer 0.069.
e
16
stru cture would be a capacitive voltage divider rather than a resistive one . Other possible realizations of analog weights include the use of a Hall -effect multiplier combiner with magnetic storage[241 and also the electrochemical memistor of Wid row and HoffYSI Further effort s will be req uired to impro ve existing weigh ting ' elements and to de velop new ones which are sim ple, chea p, a nd adaptable according to the requ irements of the various adaptation algorithms. The realization of the processor ultimately found to be useful in cert ain application s may be composed of a combination of analog and d igital techniques.
10
0.8 -,.- ARRAY SENSITIVITY 8~-13'
06
0 .4
0 .2
o o~'----'--_>-J._---'------' I 2 RELATIVE FREOUENC Y,
( a)
3
4
t / I.
R ELAXATION ALGORITHMS AND TH EIR IMPLEM ENTATI ON 10
ARRAY
/ SENSITIVITY .' AT~
08
>j-,
~
;;;
06
z
~
~
a:
04
"
02
k .~
- 0 .00025
O ;--~-7"':-----"~---~--~
Ib ) 0
08
I 2 3 RELATIVE FREOUENCY. 1 / t.
4
.sPECTRUM . OF NOISE AT - 70· J.RRAY
.' SENSITIVIT Y AT - 70 '
06
04
0.2
( c)
°O~-~--:---=-'->-::---:------' 4 I 2 3 RELA TIVE FREOUENCY. f / f.
F ig. 20. Array sens itivity vers us frequen cy, for broadband experime nt of F ig. 19. (a) Desired look direct ion. Ii= -13 . (b) Sensiti vity In o ne no ise di rectio n. Ii= 50' . (e ) Sen siti vity in the o ther noise d irectio n. IJ= - 70 .
apparatus, such as multipliers, integrators, summers, etc. More economical realizations that would , in add ition. be more suitable fo r high-frequency operation might use fieldeffect transistors as the variable-gain multipliers, whose control (gate ) signals could come from capacitors used as integrators to form and store the weight values . On the other hand, instead of using a va ria ble resistance struc ture to form the vector dot products, the sa me functi on could be achieved using variable-voltage capacitors, with ordinary capacitors again storing the weight values . The resulting
Algorithms other than the LMS procedure described in the foregoing exist that may permit considerable decrease in complexity with specific adaptive circuit implementations. One method of adaptation which may be easy to imp lement electronicall y is based on a relaxation algorithm described by Southwell. [26 ] This algo rithm uses the sa me erro r signal as used in the LMS technique. An estimated mean-squ are error formed by squaring and averaging this error signal over a finite time interval is used in determining the proper weight adjustment. Th e relaxat ion algorithm adjusts one weight at a tim e in a cyclic sequence, Each weight in its turn is adjusted to minimize the measured mean-squ are err or. This method is in contras t to the simultaneou s adj ustment procedure of the LMS steepest-descent a lgo rithm. The relaxation procedure can be shown to produce a misadjustment th at increases with the square of the number of weight s, as opposed to the LMS algorithm whose misadju stm ent increases o nly linearl y with the number of weights. For a given level of misadjustment, the ada pta tio n sett ling time of the relax ation process increases with the sq ua re of the number of weights. For implementation of the Southwell relaxation algo rithm. the configura tio ns of the array and adaptive processor remain the sa me, as does the use of the pilot signal. Th e relaxat ion a lgorithm will work with eith er the two-mode o r th e one-mode adaptation pr ocess. Savings in circu itry ma y result , in that cha nges in th e adj ustments of the weight values depend only upon error measurements and not upon confi gurations of error measurements and simultaneous input-signal mea surements. Circuitry for implementing the LMS systems as shown in Fig. 7(a)' and (b) ma y be more co mplicated. The relaxati on method ma y be applicable in cases where the adjustments are not obvious " weight" settings. For example, in a microwave system, the adj ustments might be a system of motor-dri ven apertures or tuning stubs in a waveguid e or a network of waveguides feeding an antenna. Or the adj ustments may be in the antenna geometry itself. In such cas es, th e mean-square error can still be measured, but it is likely that it would not be a simple quadratic fun ction of the adjustment parameters, In any event, some very interesting pos sibilities in automatic optimization are presen ted by relaxation adaptation methods.
17
has been computer simulated and shown to operate as expected. However. much work of a theoretical and experimental nature needs to be done on capture and rejection phenomena in such systems before they can be reported in detail.
OTHER ApPLICATIONS AND FURTHER WORK ON
ADAPTIVE ANTENNAS
Work is continuing on the proper choice of pilot signals to achieve the best trade-off between response in the desired look direction and rejection of noises. The subject of "nullsteering, where the adaptive algorithm causes the nulls of the directivity pattern to track moving noise sources" is also being studied. The LMS criterion used as the performance measure in this paper minimizes the mean-square error between the array output and the pilot signal waveform. It is a useful performance measure for signal extraction purposes. For sicnal detection, however, maximization of array output signal-to-noise ratio is desirable. Algorithms which achieve the maximum SNR solution are also being studied. Goode[27] has described a method for synthesizing the optimal Bayes detector for continuous waveforms using Wiener (LMS) filters. A third criterion under investigation has been discussed by Kelley and Levin[28] and . more recently" applied by Capon et ale [29] to the processing of large aperture seismic array (LASA) data. This filter. the maximum-likelihood array processor.. is constrained to provide a distortionless signal estimate and simultaneously minimize output noise power. Griffiths'<'" has discussed the relationship between the maximum likelihood array processor and the Wiener filter for discrete systems. The examples given have illustrated the ability of the adaptive antenna system to counteract directional interfering noises.. whether they are monochromatic.. narrowband. or broadband..Although adaptation processes have been applied here exclusively to receiving arrays. they may also be applied to transmitting systems. Consider. tor example, an application to aid a low-power transmitter. If a fixed amplitude and frequency pilot signal is transmitted from the receiving site on a slightly different frequency than that of the carrier of the low-power information transmitter, the transmitter array could be adapted (in a receiving mode) to place a beam in the direction of this pilot signal. and. therefore" by reciprocity the transmitting beam would be directed toward the receiving site. The performance of such a system would be very similar to that of the retrodirective antenna systems.. [5J,[6 1 although the methods of achieving such performance would be quite different. These systems may be useful in satellite communications. An additional application of interest is that of "signal seeking." The problem is to find a coherent signal of unknown direction in space, and to tind this signal by adapting the weights so that the array directivity pattern receives this signal while rejecting all other noise sources. The desired response or pilot signal for this application is the received signal itself processed through a narrowband filter. The use of the output signal of the adaptive processor to provide its own desired response is a form of unsupervised learning that has been referred to as "bootstrap learning. "[31] Use of this adaptation algorithm yields a set of weights which accepts all correlated signals (in the desired passband) and rejects all other received signals. This system
CONCLUSION
'I"
I t has been shown that the techniques of adaptive filterins can be applied to processing the output of the individual elements in a receiving antenna array. This processing results in reduced sensitivity of the array to interferin{;! noise sources whose characteristics may be unknown ~ priori. The combination of array and processor has been shown to act as an automatically tunable filter in both space and frequency. ACKNOWLEDG~1ENT
The authors are indebted to Dr. 1\11. E. Hoff. r-. for a number of useful discussions in the early development of these ideas" and to Mrs. Mabel Rockwell who edited the
18
rnanuscri pt.
REFERENCES
B. Widrow, "Adaptive filters I: Fundamentals," Stanford Electronics Labs., Stanford, Calif., Rept. SEL-66-126 (Tech. Rept. 6764-6), December 1966. 121 J. S. Koford and G. F. Groner, "The use of an adaptive threshold element to design a linear optimal pattern classifier," IEEE Trans. Information Theory, vol. IT-12, pp. 42-50, January 1966. [31 K. Steinbuch and B. Widrow, "A critical comparison of two kinds of adaptive classification networks," IEEE Trans. Electronic Computers (Short Notes), vol. EC-14, pp. 737-740, October 1965. 4 1 \ C. H. Mays, "The relationship of algorithms used with adjustable threshold elements to differential equations," IEEE Trans. Electronic Computers (Short Notes), vol. EC-14, pp. 62-63, February 1965. [5) L. C. Van Atta, "Electromagnetic reflection," U.S. Pattent 2 908002, October 6, 1959. 161 "Special Issue on Active and Adaptive Antennas," IEEE Trans. Antennas and Propagation, vol. AP-12, March 1964. (7) C. V. Jakowatz, R. L. Shuey, and G. M. White, "Adaptive waveform recognition," 4th London Symp. on Information Theory, London: Butterworths, September 1960,pp. 317-326. IH) L. D. Davisson, "A theory of adaptive filtering," IEEE Trans. Information Theory, vol. IT-12, pp. 97-102, April 1966. 19 \ E. M. Glaser, "Signal detection by adaptive filters," IRE Trans. Information Theory, vol. IT-7, pp. 87-98, April 1961. /10) F. Bryn, "Optimum signal processing of three-dimensional arrays operating on gaussian signals and noise," J. Acoust. Soc. Am., vol. 34, pp. 289-297, March 1962. [Ill H. Mermoz, "Adaptive filtering and optimal utilization of an antenna," U. S.Navy Bureau of Ships (translation 903of Ph.D. thesis, Institut Polytechnique, Grenoble, France), October 4, 1965. [12) S. W. W. Shor, "Adaptive technique to discriminate against coherent noise in a narrow-band system," J. Acoust. Soc. Am., vol. 39, pp. 74-78, January 1966. [13) B. Widrow and M. E. Hoff, JI., "Adaptive switching circuits," IRE WESCON Conv. Rec., pta4, pp. 96-104,1960. (14) N. G. Nilsson, Learning Machines, New York: McGraw-Hill, 1965. [l51 B. Widrow and F. W. Smith, "Pattern-recognizing control systems," 1963 Computer and Information Sciences (COINS) Symp. Proc. Washington, D.C.: Spartan, 1964. (16) L. R. Talbert et aI., "A real-time adaptive speech-recognition system," Stanford Electronics Labs., Stanford University, Stanford, Calif., Rept. SEL 63-064 (Tech. Rept. 6760-1), May 1963. [17} F. W. Smith, "Design of quasi-optimal minimum time controllers," IEEE Trans. Automatic Control, vol. AC-11, pp. 71-77, January 1966. (18)J. P. Burg, "Three-dimensional filtering with an array of seismome11)
ters," Geophysics, vol. 29, pp. 693-713, October 1964. lJ9) J. F. Claerbout, "Detection of P waves from weak sources at great distances," Geophysics, vol. 29, pp. 197-211, April 1964. [20) H. Robbins and S. Monro, "A stochastic approximation method," Ann. Math. Stat., vol. 22, pp. 400-407, March 1951. [21] J. Kiefer and J. Wolfowitz, "Stochastic estimation of the maximum of a regression function," Ann. Math. Stat., vol. 23, pp. 462-466, March 1952. [221 A. Dvoretzky, "On stochastic approximation," Proc. 3rd Berkeley Symp. on Math. Stat. and Prob., J. Neyman, Ed. Berkeley, Calif.: University of California Press, 1956, pp. 39-55. [231 B. Widrow, "Adaptive sampled-data systems," Proc. 1st lnternat'l Congress ofthe Internat'l Federation ofAutomatic Control (Moscow, 1960). London: Butterworths, 1960. [241 D. Gabor, W. P. L. Wilby, and R. Woodcock, "A universal nonlinear filter predictor and simulator which optimizes itself by a learning process," Proc. lEE (London), vol. 108 B, July 1960. 125] B. Widrow and M. E. Hoff, Jr., "Generalization and information storage in networks of adaline 'neurons'," in SelfOrganizing Systems 1962,
M. C. Yovits, G. T. Jacobi, and G. D. Goldstein, Eds. Washington, D. C.: Spartan, 1962, pp. 435-461. [26) R. V. Southwell, Relaxation Methods in Engineering Science, London: Oxford University Press, 1940. 127) B. B. Goode, "Synthesis of a nonlinear Bayes detector for Gaussian signal and noise fields using Wiener filters," IEEE Trans. Information Theory (Correspondence), vol. IT-13, pp.116-118, January 1967. [28) E. J. Kelley and M. J. Levin, "Signal parameter estimation for seismometer arrays," M.LT. Lincoln Lab., Lexington, Mass., Tech. Rept. 339, January 8,1964. [291 J. Capon, R. J. Greenfield, and R. J. Kolker, "Multidimensional maximum-likelihood processing of a large aperture seismic array," Proc. IEEE, vol. 55, pp. 192-211, February 1967. [301 L. J. Griffiths, "A comparison of multidimensional Wiener and maximum-likelihood filters for antenna arrays," Proc. IEEE (Letters), vol. 55, pp. 2045-2047, November 1967. [31) B. Widrow, "Bootstrap learning in threshold logic systems," presented at the American Automatic Control Council (Theory Committee), IFAC Meeting, London, England, June 1966.
19
Abstract
Throughout the history of wireless communications. spatial antenna diversity has been important in improving the radio link between wireless users. Historically, microscopic antenna diversity has been used to reduce the fading seen by a radio receiver. whereas macroscopic diversity provides multiple listening posts to ensure that mobile communication links remain intact over a wide geographic area. In recent years, the concepts of spatial diversity have been expanded to build foundations for emerging technologies, such as smart (adaptive) antennas and position location systems. Smart antennas hold great promise for increasing the capacity of wireless communications because they radiate and receive energy only in the intended directions, thereby greatly reducing interference. To properly design, analyze, and implement smart antennas and to exploit spatial processing in emerging wireless systems. accurate radio channel models that incorporate spatial characteristics are necessary. In this tutorial. we review the key concepts in spatial channel modeling and present emerging approaches. We also review the research issues in developing and using spatial channel models for adaptive antennas.
Overview ofSpatial Channel Models for Antenna AlTay Communication Systems RICHARD
B.
ERTEL AND PAULO CAROIERI, VIRGINIA POLYTECHNIC INSTITUTE
KEVIN W. SOWERBY, UNIVERSITY OF AUCKLAND, NEW ZEALAND THEODORE
S. RAPPAPORT AND JEFFREY H. REED,
VIRGINIA POLYTECHNIC INSTITUTE
ith the advent of antenna array systems for both interference cancellation and position locadon applications comes the need to better understand the spatial properties of the wireless communications channel. These spatial properties of the channel will have an enormous impact on the performance of antenna array systems: hence, an understanding of these properties is paramount to effective system design and evaluation. The challenge facing communications engineers is to develop realistic channel models that can efficiently and accurately predict the performance of a wireless system. It is important to stress here that the level of detail about the environment a channel model must provide is highly dependent on the type of system under consideration. To predict the performance of single-sensor narrowband receivers.. it may be acceptable to consider only the received signal power and/or time-varying amplitude (fading) distribution of the channel. However. for emerging wide band multisensor arrays, in addition to signal power level, information regarding the signal multipath delay and angle of arrival (ADA) is needed. Classical mode Is provide information about signal power level distributions and Doppler shifts of the received signals. These models have their origins in the early days of cellular radio when wideband digital modulation techniques were not readily available. As shown subsequently, many of the emerging spatial .nodels in the literature utilize the fundamental principles 01 the classical channel models. However, modern spatial channel models build on the classical understanding of fading and Doppler spread, and incorporate additional con-
cepts such as time delay spread, ADA. and adaptive array antenna geometries. In this article, we review the fundamental channel models that have led to the present-day theories of spatial diversity from both mobile user and base station perspectives. The evolution of these models has paralleled that of cellular systems. Early models only accounted for amplitude and time-varying properties of the channel. These models were then enhanced by adding time delay spread information. which is important when dealing with digital transmission performance. Now, with the introduction of techniques and features that depend on the spatial distribution of the mobiles, spatial information is required in the channel models. IA.S shown in the next sections. more accurate models for the distribution of the scatterers surrounding the mobile and base station are needed. The differentiation between the mobile and base station is important. Classical work has derno nst r ate d that models must account for the physical geometry of scattering objects in the vicinity of the antenna of interest. The number and locations of these scattering objects are dependent on the heights of the antennas, particularly regarding the local environment. This article, then, explores some of the emerging models for spatial diversity and adaptive antennas, and includes the physical mechanisms and motivations behind the models. A literature survey of existing RF channel measurements with ADA information is also included. The article concludes with a summary and suggestions for future research.
Wireless l\1ultipath Channel Models This section describes the physical properties of the wireless communication channel that must be modeled. In a wireless system, a signal transmitted into the channel interacts with the environment in a very complex way. There are reflections from large objects, diffraction of the electromagnetic waves
This work was partially supported by the DARR4 Globdo program, Virginia Tech's FederalHighwaysResearch Center of Excellence. Virginia Tech's BradleyFoundation. the Brazilian National Science CoullcilC.VPq, and .VSF PresidentialFaculty Fellowship.
Reprinted from IEEE Personal Communications Magazine, Vol 5, No.1, pp. 10-22, February 1998.
20
A
1,2
(t) e j~I , 2(t)S(r -
't
~
Mobile 2
-e;,~ l (a)
Base
(b)
Beam of the bas e sta tio n ste ered towa rd mobile
• Figure 1, Multipath propagation channel: a) side view; b ) top view. where j;" is th e maximum Doppler shift give n by vl ); wh ere A is the wavelength of the transmitted signa l at frequency { . Figure :2 show s the recei ved sig n a ls a t the base station , assuming that mobiles I and :2 have tra nsmitt ed narrow pul ses at the same time . Al so s ho wn is the output of an antenna array syste m adapted [0 mobile I. The channel model in Eq . I do es not consid er the AOA of each multipath component shown in Fig s. I and 2. For narrowb and signals. the AOA ma y be include d int o the vec to r channel impulse response usin g
around objects. and signal scattering. The result of these complex interactions is the presence of many signal components. or multipatli signals. at the receiver. Another property of wireless channels is the presence o f Doppler shift , which is caused by the motion of the receiver, the transmitter, and /or any other objects in the channel. A sim plified pictorial of the rnultipath environment with two mobile stations is shown in Fig. 1. Each signa l component exp e rie nces a different path environment. which will determine the amplitude A /.k . carri er phase shift <J>/.k, time delay ' I.b AOA 8u , and Doppler shift if of the lth sign a l co m p o n e n t of the kth mobile . In ge ne r a l. each of these signal parameters will be time-varying. The early classical models. which were developed for narrowb and transmission syst em s. only provide information ab out signal amplitude level distributions a nd Doppler sh ifts of the received signals. The se models ha ve their ori gins in the e arl v da ys of cellular radio [1--1] when wideband di gital modul ation techniques were not readily ava ilable. As cellular systems became more co m p lex a nd more accu rate models were re q u ired . additional co nce pts. suc h as time delay sp read . were incorporated int o the mode l. Representing the RF channel as a time -vari ant c ha nne l and using a base band complex envelope repre sentation . the channel impulse response for mobile 1 has class ically be er: represented as [51
h\(1.,)=
L (r) - I
I
AI.I (r )e! <jl " I '8 (i - r u
(T) )
I~\(l.t )=
s(
.
=
ref
l ·m
1
j
f - ;;. \o f m
Ar. I (r )eJ<jl ;!' )Zi (8 1(11)O( t -: .l T))
(2)
where d (8 /(t)) is the arrav respon se rector. The a rray response vecto r is a function o f the arrav zcorn etrv a nd ,-\ O A . Figure 3 sho ws the case for an a rbitra rY' a rra v ueometrv when the- arrav and signal are res tricte d to tw()-dim~;s ional space . The resulting array respo nse vecto r is give n bv
Ir exp(- J.lf/ I I .) ii I
i exp]- i lf/ I.2 )
l.•
£1(8,(1 )) = i e xpl - i lf/u )
(I )
N ,,,, )
where L(t) is the number of rnultipath compon ents a nd th e other variables have already be en defined. The am p litude A u of the multipath co m po ne n ts is usually modeled as a Ra yleigh distributed rand om vari able . while the ph ase shift <J>/.k is uniformly distributed. The time-varying nature of a wireless c ha nnel is caused by the motion of obj ects in the channel. A measure of the time rate of change of the c h a n ne l is the Doppler pow er spec trum. introduced by M . J. Gans in 1972 [2J . The Doppler power spectru m provides us with sta tistical information on th e variation of the frequency of a tone rec eiv ed by a mobile tr aveling at speed v . Based on th e tlat fading channel model dev eloped by R . H . Clarke in 1968. G an s ass ume d that the received signal a t the mobile s t a t io n ca m e from all directions a n d wa s un iformly distributed . U nd e r the se assumptions and for a A/4 ve rt ica l antenna , the Doppler power sp ectrum is give n by [5]
where 'I'{.i(t) =[x,cos(8 {(t)) + y ,s i n ( 8 , (T )) ] ~ a nd ~ = 2reiA. is the wave numbe r. The spa tia l c h a nn e l impulse re sponse give n in Eq . :2 is a su m m a t io n of several multip ath compon ents. e ach of which has its own amplitude . ph ase. a nd AOA. The distribution of these parameters is dependent o n the type of en vironment. In particular . the angle sp re ad o f th e channel is known to be a fu nctio n of both the en vironment and the base sta tio n anten na hei ght s . In the ne xt se c t io n . we de scribe macrocell a nd rnicr ocell e nv iro n m e nt s and di scu ss how the e nvir o n m e n t affects the signal parameters.
,Vlacrocell V5. Microcell
,\iIQcrocell Environment - Figure 4 sho ws the c ha n ne l on the forward link for a m acro c ~ll en v ironm ent. It is usuallv assumed that the scatt e re rs surrounding the mobile station are a bo ut the same hei ght as o r are higher than the mobile . This implies th at the received signal a t the mobile antenna a rr ives from all directions afte r bouncing fro m the su rro und ing scat terers as illustra ted in Fig. -I. Under these conditions, Gans ' assum ptio n that the AOA is uniformly distributed o ve r [0 . :2re] is va lid . Th e clas si cal
If - J;·I<J;n
1.5
I
/= 1)
1= 0
nj
L IIi - 1
2
else where
21
Received signal
I
90 . ,
Mobile 1 9"
fi}.'
I 92,1
Received signal
Received signal
1 *' '~i t 2. ,
Delay
(a)
Received signal 9 •
02
I
M obile
Delay
(c)
21
(d)
Delay
Delay
II Figure 2. Channel impulse responses for mobiles I and 2: a) received signal from mobile I to the base station: b) received signal from
mobile 2 to the base station: c) combined received signal from mobiles I and 2 at the base station: d) received signal at the base station when a beam steered toward mobile I is employed.
Rayleigh fading envelope with deep ~ /vlicrocell Environment - In the microfades approximatelv 1../2 apart cell environment. the base station Plane wave emanates from this model [5J. antenna is usuallv mounted at the same However. the AOA of the received height as the surrounding objects. This signal at the base station is quite difimplies that the scattering spread of fe-rent. In a macrocell environment. the AOA of the received signal at the e typically. the base station is deployed base station is larger than in the ! I higher than the surrounding scattermacrocell case since the scattering pro X I i er;. Hence . the received signals at cess also happens in the vicinity of the the base station result from the scatbase station. Thus. as the base station antenna is lowered. the tendencv is for tering process in the vicinity of the mobile station. as shown in Fig . 5 . the multipath AOA spread to increase. The multipath components at~the This change in the behavior of the base station are restricted to a smallreceived signal is very important as far as antenna array applications are coner angular region . BBW. and the dis• Figure 3. Arbitrary antenna array cerned. Studies have shown that statistribution of the AOA is no longer configuration. uniform over [O.2lt] . Other AOA distical characteristics of the received tributions are considered later in this signal are functions of the angle spread . Lee [3J and Adachi [6J found that the correlation article . The base station model of Fig. 5 was used to develop the between the signals received at two base station antennas theory and practice of base station diversity in today's cellular increases as the angle spread decreases. svstem and has led to rules of thumb for the spacing of diverThis section has presented some of the physical properties of a wireless communication channel, A mathematical expressity antennas on cellular towers [3J. sion that describes the time-varying spatial channel impulse response was given in Eq. 2. In the next section , several models that provide varying levels of information about the spatial channel are presented.
Space: The Final Frontier
Details ofthe Spatial Channel Models Base
station
In the past when the distribution of angle of arrival of multipath signals was unknown, researchers assumed uniform distribution over [0, 21tJ [7J. In this section, a number of more realistic spatial channel models are introduced. The defining equations (or geometry) and the key results for the models
ost atio n Base
til Figure 4. Macrocell environment - the mobile station perspective.
22
Top view
are d escr ib e d . Also provided is an exte nangle spreads and e lement spacings result sive list of references. in lower corre la tio ns, which provide an Table 1 lists so me representative active increased diversi ty gai n. Measurements of researc h groups in the field and their Web the correlation observed a t both the base site addresses where m or e informatio n o n station and the mo b ile are consisten t with the subject can be found . (Note that this is a narrow a ngle spread at the base sta tion by no means an exhaustive list.) and a large a ngle spread at the mobile . The Gaussia n Wide Sense St ationary Correlation meas u re me n ts made at the Uncorre lated Scattering (GWSSUS) , base station indicate tha t the typical rad ius Gaussia n A ngle of Arrival (GAA) , Typiof scatt e re r s is f rom 100 to 200 wavec a l Urba n (TU) , and Bad Urban (BU) lengths [3]. • Base station models described be low were developed Assumi ng that N scatterers are un iformin a series of papers at the R oyal Institute ly p lace d on t h e circle wit h radi us Rand • Figur e 5. Macrocell-s- base of Tech nology and may be downlo aded oriented such that a scatterer is loca ted on station perspective. from the Web si te. Further details of the the line of sight, the discrete AOAs are [91 Geometrically Based Single Bounce . - I torl= 0.I.. . .. N -l. 6 i "" - R Sin (GBSB) models are given in theses at VirD N ginia Tech , wh ich are available at h ttp r//etd .vt .edu/etd / index.htm!. From the di screte AOAs, the cor re lation of the signals These various models were developed and used for differbetween any two elements of the array ca n be foun d using [9] j V.1 ent ap plications. Some of the models were intended to prop(d.6 0.R .D )=-; cos(6 0+6 ,)]. vide information about only a sin gle channe l characteristic. N ; ; 1) such as angle sp re ad , while others at te mpt to capture all the properties of t he wireless channel. In the discussion of th e where d is the element spacing and 60 is me asur ed with respect models, an effort is made to identify the original motivation of to the line h .'tween the two elements as shown in Fig. 6. the model and to co nvey the information the model is intendThe origina l model provided information regarding o nly ed to provide. sign al corre lations . Mo tiva ted by the need to consider smallscale fading in diversity systems. Staple ton et al. proposed an Lee's /v1odel ex te nsion to Lee 's model tha t accounts fo r Dopp ler shift by In Lee 's model, scatterers are evenly spaced o n a circular ring imposing an angul ar ve locity o n the ring of sca tterers [10. 11]. about the mobi le as shown in F ig. 6. Each of the scatt e re rs is For the model to give t he a ppropriate maxim um Doppler inte nded to represent the effect of many shift. the angular velocity of the sca tte rscatte rers wit hin the region. and hence ers m ust equal VI R where \. is the vehiy are referred to as effective scatterers. The cle velocitv and R is t h e r adius of th e model was originally used to predict the scatterer ring [ II ]. Using this model to correlation between the signa ls re ceived simu late a Rayleigh fadi ng spatia l chanEffective scatterers by two sensors as a function of element nel model. the BER fo r a It/4 differen sp acing. However. since the co rr e la tio n tial quadratu re phase shift keyed matrix of the rece ive d sign a l ve cto r o f (DQPSK) signal was sim u lated . Th e an antenna array ca n be determi ned by res ul ts were compared wi th measure consideri ng the correlation betwe en ments take n in a typical suburban env ieach p a ir of elements . the model h as ron me nt. The resu lt ing BER estimates application to any arbitrary array size . .-""-.-'. .x were within a factor of two of the actu al The level of correlation will determeas ured BER, indicating a reasonable mine the performance of spatial diversidegree of accuracy for the model [10]. ty met hods [3 ,9] . In gen er al. large r • Figure 6. Lee 's model. When the model is use d to provide
(11t. ). ,
Iexp[-j11td
~)~~~~l¥t::·'~:<:-~:~::·:;~:;·~'~tir;~::::.:, ·'::·:·~_i~~~:ji~~\~~~1
I
! Center for Communications Research -
University of Bristol
http://www.fen'.bris.ac.uk/elec/research/ccr/ccr.html
i'qmter.for Personkommunikation ~ Aalborg University
! Center for Wireless Telecommunications I Research.Group for RF Communications II
http://www.mprg.ee.vt.edu
University of Kaiserlautern
Royal tnstituteotTechnoloqy
I
i
http://www. cwt.vt.edu/
Virginia Tech
I Smart Antenna Research Group - Stanford University and Information Systems Engineering II Telecommunicaticns University of Texas at Austin !
http://www.kom .auc .dk/CPK!
Virginia Tech
i Mobile and Portable Radio Research Group -
I
http://www.e-technik.uni-kl.de! http://www.s3.lcth.se http://www-isl.stanford.edu/groups/SARG http://www.ece.utexas.edu/projects/tise!
'
http://www.crl.mcmaster.ca
Wireless Technology Group - McMaster University
• Tab le 1. Some active research group s in the field of adaptive antenna arrays.
23
I
r
joint ADA and time of arrival (TDA) tributed (see the discussion of the GAA channel information, one finds that the model later). However, in practice the Effect ive resulting power delay profile is " UADA will bediscrete (i.e ., a finite numscatterers shaped" [12]. By considering the interber of samples from a Gaussian distribusections of the effect ive scatterers by tion), and therefore it is not valid to use ellipses of con stant delay, one finds that a continuous ADA distribution to estithere is a high concentration of scattermate the correlation present between ers in ellipses with minimum delay, a different antenna elements in the arrav. h igh concentration of scatterers in The correlation that results from a conellipses with maximum delay , and a tinuous ADA distribution decreases • Figure 7. Discrete uniform geometry. lower concentration of scatterers monotomically with element spacing. between . Higher concentrations of where as the correlation that results scatterers with a given delay correfrom a discrete ADA has damped Scatterer reg ion spo nd with larger powers, and hence oscillations present. Therefore, a cony tinuous ADA distribution will underlarger values on the power delay prof ile . The "Uvshaped " power delay estimate the correlation that e xists profile is not consi stent with measurebetween the elements in the array [9]. D x ments . Therefore, an extension to In [9], a comparison is made Base Lee's model is proposed in [II] in between the correlation obtained stati on which additional scatterer rings are using the discrete uniform distribution model, Lee 's model. and a continuous added to provide different power Gaussian ADA as a function of eledelay profiles. • Figure 8. Circularscatterer densitygeometry. While the model is quite useful in ment spacing. The comparisons indi cate that , for small element predicting the correlation between any separations (two wavelengths) , the two elements of the arrav, and hence the array correlation matrix, it is not well suited for simulathree models have nearly identical correlations. For larger element separations (greater than two wavelengths), the correlations requiring a complete model of the wireless channel. tion values using the continuous Gaussian ADA are close to Discrete Uniform Distribution zero . while the two discrete models have oscillation peaks A model similar to Lee 's model in terms of both motivation with correlatio ns as high as 0.2 even beyond four wavelengths. Additionally, it was found that the correlation of the discrete and analysis was proposed in [9]. The model (referred to here uniform distribution falls off more quickly than the correlaas the discrete uniform distribution) evenly spaces N scattertion in Lee's model. as within a narrow beamwidth centered about the line of sight to the mobile as shown in Fig. 7. The d iscrete pos sible Again. while the model is useful for predicting the correlation between any pair of elements in the array (which can be ADAs. assuming N is odd. are given by [9] used to calculate the array correlation matrix), it fails to I ,v-I N-I 8 i = --8 BlI' i. i = - - -..... - - . include all the phenomena, such as delay spread and Doppler N-l 2 2 spread, required for certain types of simulations. From this . the correlation of the signal s present at two antenna elements with a separation of d is found to be Geometrically Based Single-Bounce
Statistical Channel Models
.V- I
!
'v - I 1= - - ,-
exp[-j21tdcos(8o+8;J]'
Geometrically Based Single -Bounce (GBSB) Statistical Channel Models are defined by a spatial scatterer density function . These models are useful for both simulation and analysis pur poses . Use of the models for simulation involves randomly placing scatterers in the scatterer region according to the form
Measurements reported in [9J suggest that the ADA statistics in rural and suburban en vironments are Gaussian dis-
c: a c> g
2 1.5
.~ 0. 5 ai 0 'D .~ -O. 5
~
e a..
.0
-1
5
o
4
~4
-5
3 .8 3.9
Angle of arrival (deg rees)
Angle of arrival (degrees)
Time of arrival
(~s) ~
• Figure 10. Joint TDA and ADA probabilitydensityfunction at the mobile, circular model (log-scale).
• Figure 9. Joint TDA and ADA probability density function at the basestation, circularmodel (log-scale).
24
y
Scatt erer region 1+----'---'--- - D ------+1 MHz, which provides a range of of the sp a t ia l scatterer density ---l-'~----'------,r--------4t-j-L-"X 30-60 m, roughly the width of Base station function . From the location of wide urban streets. each of the scatterers, the AOA, The GBSBCM can be used to TO A , and signal amplitude are ----t;:::::=~a;-:.m generate random channel s for determined. simulation purposes . Generation From the spatial scatterer den• Figure 11. Ellipti cal scatterer density geometry. of sa mples from the GBSBCM is sity function , it is possible to derive accomplished by uniforml y placthe jo int and marginal TOA a nd ing scatt erers in the circular sca tte re r region about the mobile AO A probability density funct ion s. Knowledge of these sta tisand then calculating the corre sponding AOA , TOA. a n d tics ca n be used to pr edict th e perform ance of a n ad apti ve power levels . array. Furthermore , knowledge of th e underlying structure of the resulting array response vecto r may be exploited by be amGeometrically Based Elliptical Model (M icro cell Wideband forming and position location algor ithm s. Ivl odel) - The Geometrically Based Single Bounce Elliptical The shape and size of the spatial scattere r density functi on Model (GBSBEM) assumes that scatterers are uniformly disrequired to provide an accura te model of the channel is sub tr ibuted within an e llipse, as shown in Fig. 11, where the base ject to debate . Validation of these models through extensive station and mobile are the foci of the ellipse. The model was measurements remains an active are a of research. proposed for microcell environments where antenna heights are relatively low, and therefore multipath scattering near the Geometrically Based Circular Model (Macrocell Model) - The ba se statio n is just as likely as multipath scatterering near the geometry of the Geometrically Based Single Bounce Circular Model (GBSBCM) is shown in Fig. 8. It assumes that the scatmobile [17,18] . A nice attribute of the elliptical model is the physical interterers lie within radius Rm about the mobile . Often the requirepr etation that o nly multipath sig na ls which arri ve with an ment that R m < D is impo sed. Th e model is based o n th e assumption that in macrocell e nviro nme nts where antenna abso lute delay s 1 m ar e accounted for by the model. Ignoring co mpo ne nts with larger delays is possible since signa ls with he ights are rel ativel y large. ther e will be no signa l scatterering fro m loc ations near the base sta tio n. The ide a of a circula r longer dela ys will expe ri e nce greater path loss. and hence regi o n of sca u erers centere d abo ut the mob ile was o riginally ha ve relativel y lo w power co m p a re d to those with s ho rte r proposed by Jakes [13] to derive the or etical result s for the co rde lays . There for e. pr ovided that 1 m is chose n su ff ici e ntly la rge . the model wi ll acc ount for nearly a ll the pow er a nd relation observed between two ante nna elements. Later. it was AOA of the mult ipath signa ls. used to determine the effects of beamform ing on the Doppler spe ct ru m [ 14. 15] fo r narrowb and sig na ls. It was shown t ha t Th e par ameters a m a nd h m are th e se rnimajo r axis and th e rate and the depth of the enve lo pe fades are significant ly semiminor axis values. which are given bv reduced when a narrow-be am beam former is used . c1 'n (1m =~- . Th e jo int TOA a nd AOA density func tio n obtai ned fro m the model provides so me in sights into the properties of th e mod el. Us ing a Jacobian tr an sf orm ati on. it is easv to derive the joint TO.A. and AOA density fu nction at both the base statio n and the mobile. The re sulting joint probability density functio ns ( PD Fs ) at the At the base statio n: base sta tio n and the mob ile a re shown in the box on this page [16]. The joint TOA and AOA PDFs for the GBSBCM are shown in Figs . ') and 10 fo r 2 2 2 2c 2 _ 1 C + 1 \ ·3 - 2 1 C Dcos(Sb)) the case of D = I km a n d R m = 100 m from the base station and mobile perspe c47tR;, ( DCos(Sb) _ 1C)3 tives. respectively. The circula r model pre d icts a relatively high pr obabilit y o f mu ltipath co mpo ne n ts with sma ll e xcess else. a del ays a lo n g the line o f s ig h t. Fr om th e base-station perspective . a ll o f th e multi path co mponents are restricted to lie within a small range of an gles. At the mob ile: The app ro pri a te va lue s fo r th e rad ius of scatt e re rs can be determined by eq uatin g the a ng le s p rea d pr edi ct e d by t he model (wh ic h is a fu nct io n o f R m ) wi th 2 2 2 2 3 _1 C c -2"tc 2 Dcos(Sm)) me asured values . Me asurements reported in [9] s ugge st th at typica l an gl e sp re a ds 47tR,~( Dcos(Sm) -1c / for ma crocell envir onment s with a T- R sepa ra tio n of I km a re a ppro xima te ly two to six degrees . Also , it is s ta te d th at th e o else. angle sp re a d is inversel y pr op ort ional to the T-R se p a r a t io n , which le ad s to a radius of scatterers that ranges from 30 to where ef> and em are the angle of arrival measured relative to the line of sight 2UU m [16] . In [3]. it is s t a t e d th at t h e from the base station and the mobile, respectively. active scattering region around the mobile is a bo u t 100-200 wav el en gth s fo r 900
- --.{
(D
)(D
(D
)(D\ ·+"t
25
c: - 1 ~-2
G WSSUS. Figure 13 shows the geometry assumed for the GWSSUS model corresponding to £I = 3 clusters. The mean AOA for the kth cluster is denoted SOk. It is assumed that the location and delay associated with each cluster remains constant over several data bursts. b. The form of the received signal vector is
]' -3
'; -4 -5
.~
~ -6
~ -7
ii
'"o
.0
5
et
X,,(l) =
Time of arrival (us)
Angle of arrival (degrees)
where Vk.b is the superposition of the steering vectors during the bth data burst within the kth cluster. which mav be expressed as . v, "t." = I<XC ieJQ I.'a(SOk -Su).
• Figure 12.Joint TOA and ADA probability densityfunction.
elliptical model (log-scale).
i= 1
where N k denotes the number of scatterers in the kth cluster. <Xk.i is the amplitude. lPkj is the phase. Sk.i is the angle of arrival of the ith ret1ected scatterer of the kth cluster, and a( S) is the array response vector in the direction of S [9). It is assumed that the steering vectors are independent for different k. If v, is sufficiently large (approximately 10 or more [J 9]) for each duster of scatterers, the central limit theorem may be applied to the elements of Vk./> . Under this condition, the elements of vk.b are Gaussian distributed. Additionally. it is assumed that Vk./, is wide sense stationary. The time delays tk are assumed to be constant over several bursts. b. whereas the phases
where c is the speed of light and t", is the maximum TOA to be considered. To gain some insight into the properties of this model, consider the resulting joint TOA and AOA density function. Using a transformation of variables of the original uniform scatterer spatial density function, it can be shown that the joint TOA and AOA density function observed at the base station is given by [16] J~.e i' (t.S/,) =
C 3 2 2 C)( 2 (D - t C D e + t e -
1f l
2t1'
C
D."COS(S',)) D
-htlllllblll(DCOOS(S,,)-t1')
.
-
" U,s(l - td· 2>
k=1
$ t$ till
c
elsewhere. where Sb is AOA observed at the base station. A plot of the joint TOA and AOA PDF is shown in Fig . 12 for the case of D = I km and t m = 5 us. From the plot of the joint TOA and AOA PDF, it is apparent that the GBSBEM results in a high probability of scatterers with minimum excess delay along the line of sight. The choice of t", will determine both the delay spread and angle spread of the channel. Methods for selecting an appropriate value of t", are given in [18]. Table 2 summarizes the techniques for selecting t m where L, is the reflection loss in dB. n is the path loss exponent. and to is the minimum path delay . To generate multipath profiles using the GBSBEM, the most efficient method is to uniformly place scatterers in the ellipse and then calculate the corresponding AOA. TOA, and power levels from the coordinates of the scatterer, Uniformly placing scatterers in an ellipse may be accomplished by first uniformly placing the scatterers in a unit circle and then scaling each x and y coordinate by £/11I and b"" respectively [16].
s, = E{ vk. b vt,,,}
The model provides a fairly general result for the form of the covariance matrix. However. it does not indicate the number or location of the scattering clusters. and hence requires some additional information for application to typical environments.
Gaussian Angle of Arrival
The Gaussian Angle of Arrival (GAA) channel model is a Gaussian Wide Sense Stationary special case of the GWSSUS model described above where Uncorrelated Scattering only a single cluster is considered (£I = 1), and the AOA statistics are assumed to be Gaussian distributed about some The GWSSUS is a statistical channel model that makes nominal angle , So, as shown in Fig. assumptions about the form of the received signal vector 14. Since only a single cluster is con[19-22]. The primary motivation of .J~I ~: \"':7 . sidered, the model is a narrowband 'E;cp~~si'o~ :. the model is to provide a general ,. r ..c channel model that is valid when equation for the received signal cor, the time spread of the channel is t m = const ant Fixed maximum delay, t m relation matrix. In the GWSSUS small compared to the inverse of model, scatterers are grouped into the signal bandwidth; hence , time t m = t o 1O(T - Lr)!1On clusters in space. The clusters are Fixed threshold Tin dB shifts may be modeled as simple such that the delay differences withFixed delay spread, crt 't m = 3.244<>, + t o phase shifts [231. in each cluster are not resolvable The statistics of the steering vecwithin the transmission signal bandFixed max. excessdelay, 'te 't m = t o + 'te tor are distributed as a multivariate width . By including multiple clusGaussian random variable. Similar ters. frequency-selective fading • Table 2. Methodsfor selection t m • to the GWSSUS model, if no line of channels can be modeled using the '
"
26
:. ~,
y
Scatterer cluste r
kt h scatterer clust er
___._LBase station
I
+ X ,I
I
bution in all directions away from the mobile [24]. Both the time and spatial co rr e la tio n properties of the model are compared to theoretical results in (24) . The comparison shows that there is good agreement between the two .
x
Two Simulation Models (TU and BU)
Base stat io n
Next we describe tw o spatial channel models • Figure 14. GM geometry. • Figure 13. G WSS US geom etry. that have been developed for simulation purposes. The Typical Urban (TU) model is designed to have time properties similar to the GSM-TU defined in sight is present. then E {vk./,} = 0: otherwise . the mean is proGSM 05 .05 . while the Bad Urban (BU) model was developed portion al to the array response vector a( 80d . For th e special to model environments with large reflectors that are not in case of uniform linear arrays. the co va r ia nce matrix may be the vicinity of the mobile . Although the models are designed described by for GSM. DCS1800 , and PCS1900 formats . extensions to H R(80.<Js) '" pa(8 o)a (80) @B(8 0 ·<J s ). other formats are possible (251) . Both of these models obtain the received signal vector where the (k.l) element of B(8 0 • <Js) is given by using B( 8 0 .<Js )u = ex p[ -2( 1tu(k _1)) 2 <J~ cos' I (t) .) ( I, (r) \ x(t) = ~u,, (I)exp - j 2 ;rf; ~+ f3 5 I -~ +~ r )a(tl,,(I)) p is the receive r signal power. .J. is the element spacing. a nd @ 11 = 1 denotes e le me nt -wise multiplication [231. where N is the number of scatterers. .f~. the carrier frequency. c is the speed o f light . I,,(t) the path propagation distance. ~ a Time-Varying Vector r andom phase. and ur random delay . In general. the path Channel A/lodel (Raleigh 's ,\!lode/) propagation distance I ,,(t) will vary continuously with time : hence. Doppler fading occurs naturally in the model. Raleigh's time-varying vector ch annel model was developed to provide both small scale Rayleigh fad ing and theoretical spaTypical Urban (TU) - In the TU model. 120 scatterers are rantial correlation properties [24 J. The propag ation environment domly placed within a I km radius a bo ut th e mobile [25] . The considered is densely populated with large dominant reflectors (Fig. IS) . It is assumed that at a particu lar time th e chanposition of th e sc a tt e re rs is held fixed over the duration in which the mobile travels a distance of 5 m. At the end of the 5 nel is characterized by L dominant re fle cto r s. The rece ive d signa l vector is then modeled as rn, the scatterers are returned to their original position with L(r) - I re spect to the mobile . At each 5-m interval. random phases ar e x(t)= Ia(8 1)u l(t ls(t - e ) + n(t l. as s ign e d to the sca tre r e rs as well as randomi zed s ha d ow in g 1=0 e ffe cts, which ar e modeled as log-normal with distance with a where a is the array response ve cto r. Ut(t) is the complex path standard devi ation of 5- 10 dB [25] . The re ce ive d signal is amplitude . s(t ) is the modulated signal. and n(t) is additive determined by brute force from the location of each of th e sca tnoise. This is equivalent to the impulse response given in Eq . 2. terers. An exponential path loss law is also applied to account The unique fea t u re of th e model is in the calculation of for large-scale fad ing [21]. Simulations have shown th at the TU the complex amplitude term. aM) . which is expressed as model and the GSM- T U model have ne arly identical power del ay profiles. Doppler spectru ms. and delay spreads (25). Furu ,(t)= ~ I(t) · \I f llJl(e l )' thermore . the AOA sta tistics are ap proxima te ly Gaussian a nd sim ilar to those of the GAA model described above . where f l accounts for log-norm al fading. '11(" 1) describes the power del ay profile. a nd ~/ (t ) is the complex intensity of th e radiation pattern as a functio n o f tim e . The co mp lex intensity Bad Urban (BU) - The BU is identical to the TU model with is described by the addition o f a second sca t te re r cluster with a no t h e r 120 NI sca tte re rs offse t 45 ' from the first, as shown in Fig. 16. The sca tte re rs in the second cluster are as signed 5 dB less average ~ 1(t) = K c, (8 1 ) exp ( jW " cos(n ".1)t), n= 1 power tha n the o rig inal cluster [25] . The presence of the secwhere N, is the number of s ig na l ond cluster results in an increased components contributing to the Ith angle spread . which in turn dominant reflecting s u r f a c e . K reduces the off-diagonal el ements Dominant a c co u n t s for the antenna g a i n s of the array covariance matrix . ~Iectors and transmit signal power . C,,(81) The presence of the second cluster is the complex radiation of the nth also causes an increase in the delay co m p o n e n t of the Ith d ominant spread . reflecting surface in the direction Uniform Sectored Distribution of 8t , wi! is the maximum Doppler shift , a nd n".! is the angle toward The defining geometry of Uniform the nth component of the Ith dom Sectored Distribution (USD) is Base sta tion inant reflector with respect to the sho w n in Fig. 17 [26]. The model motion of the mobile. The resultassumes that scatterers are uniing complex intensity, ~ t(t) , formly distributed within an angle exhibits a complex Gaussian distri• Figure 15. Raleigh's model signal environment. distribution of 8BW and a radial
e].
f
I
27
(
range of L1R centered about the mobile . The magnitude and phase associated with each scatterer is selected at random from a uniform distribution of [0,1] and [0, 2lt], respectively. As the number of scatterers approaches infinity , the signal fading envelope becomes Rayleigh with uniform phase [26]. In [26], the model is used to study the effect of angle spread on spatial diversity techniques. A key re sult is that beam-steering techniques are most suitable for scatterer distributions with widths slightly larger than the beamwidths.
Modified Saleh-Valenzuela's Model
mation was developed by Klein and Mohr [29]. The channel impulse response is represented by
w
h(.,t .S) = Ia",(t)o(. -'", )o(S - SlY). w=1
This model is composed by W tap s. each with an associated time de lay r., complex amplitude a.., and AOA Sw - The • Figure 16. Bad Urban vector chanjoint density functions of the model nel model geometry. parameters should be determined from measurements. As shown in [29], measurements can provide histograms of the joint distribution of la I, t and S, and the density functions, which are proportional to these histograms, can be chosen.
Elliptical Subregions Model (Lu, Lo, and Litva's Model)
Saleh and Valenzuela developed a multipath channel model for indoor environment based on the clustering phenomenon observed in experimental data [27]. The clustering phenomenon refers to the observation that multipath components arrive at the antenna in groups. It was found that both the clusters and the rays within a cluster decayed in amplitude with time. The impulse response of this model is given by
Lu et al. [30] proposed a model of rnultipath propagation based on the distribution of the scatterers in elliptical subregions. as shown in Fig. 18. Each subregion (shown in a different shade) corresponds to one range of the excess delay time. This approach is similar to the GBS(3) BEM ·proposed by Liberti and Rappah(t) = IUijo(t - T; -' ij) i = llj = O port [18] in that an ellipse of scatt e re rs y where the sum over i corresponds to is considered. The primary difference the clusters and the sum over j reprebetween the two models is in the selecse nts the rays within a cluster. The vari tion of the number of scatterers and the ables uij are Rayleigh distributed with di stribution of those scatterers. In the the mean square value described by a GBSBEM. the scatterers were uniformly distributed within the entire ellipse. In double-exponential decay given by Lu, Lo, and Litva 's model. the ellipse is first subdivided into a number of elliptical subregions. The number of scatterers where rand yare the cluster and ray within each subregion is then selected from a Poisson random variable. the time decay constant, respectively. Motivated bv the need to include AOA in mean of which is chosen to match the the cha~nel mode , Spencer et al. promeasured time delay profile data. Basestation It was also assumed that the multiposed an extension to the Saleh- Valenpath components arrive in clusters due zuela's model (18]. assuming that time • Figure 17. Geometry of the uniform and the angle are statistically indepento the multiple reflecting points of the sectored distribution. scatterers. Thus, assuming that there dent, or are L scatterers with K1 retlecting points l1(t,S) = h(t)h(S) . each. the model proposed is represented by Similar to the time impulse response in Eq. 3, the proL C posed angular impulse response is given by 11(1.10)=
I
l1(t) =
f IUijo(s- e,
IE (of l) 1
i=1
-Ol ij)
K,
i = Oj =O
X I,a ik exp(-(21if;klo + r« ))8(t- fik )Er(Oik )
where U ij is the amplitude of the jth ray in the ith cluster. The variable 6 i is the mean angle of the ith cluster and is assumed to be uniformly distributed over [0. 2lt). The var iable Olij corresponds to the ray angle within a cluster and is modeled as a Laplacian distributed random variable with zero mean and standard deviation 0':
k=O
where iXib 'ik' and Yik correspond to the amplitude. time delay, and phase of the signal component from the ikth reflecting point, respectively. fik is the Doppler frequency shift of each individual path, Sik is the angle between the ikth path and the receiver-to-transmitter direction, and SVl is the angle of the ith scatterer as seen from the transmitter. £1(S) and £r(8) are the radiation patterns of the transmit and receive antennas, respectively. The variable Sik was assumed to be Gaussian distributed. Simulation results using this model were presented in [30], showing that a 60° beamwidth antenna reduces the mean RMS delay spread by about 30-43 percent. These results are consistent with similar measurements made in Toronto using a sectorized antenna (31].
This model was proposed based on indoor measurements which will be discussed in the fourth section.
Extended Tap-Delay-Line Model
A wide band channel model that is an extension of the traditional statistical tap-delay-line model and includes AOA infor-
28
Measurement-Based Channel Model
• By using direction al a nte nnas, it is possible to re d uc e th e time dispersion . A no the r se t of TD A and A DA me asur em ents is rep orted in [39] for urban are as. Th e me asurem ents were made using a A cha nne l model in whi ch the par am et er s are based o n me atwo-e le me nt rec e iver th a t was mou nt ed o n th e test ve h icle sure me nt was proposed by Bla nz et al. [32]. T he idea be hind w it h a n e leva tio n of 2.6 m . Th e t ra ns m itti ng a n te n na was this a pproach is to characte rize the propagatio n environm ent , placed 30 m high on th e side of a buildi ng. A bandwidt h of 10 in terms of sca tte ring po ints, based on meas ure me nt data . The M H z wit h a ca rr ie r fre q ue nc y of 2.33 GH z was use d . Th e time- var iant impulse response ta kes the form de lay- Doppl e r spect ra ob se rved at the mobil e was use d to 2rr obtain the del ay-AD A spec tra. T he seco nd ant enn a e leme nt is h(1".t ) = 6(1",t ,8) * g(1".8)* f( 1; )d8 use d to rem ove th e a mbigu ity in A D A th at wo u ld occu r if o o nly the D oppl er spect ra we re know n. The resul ts indic at e th at it is possible to acco unt for most of the major fe atures of whe re f(1") is the im p u lse re s pon se rep rese n ting th e jo int th e del ay-ADA spec tra by co nsi de ring the la rge bui ld ings in tr an sfer ch ar acteristi c of the tra nsmissio n syste m compo nents the environment. (mo dulato r, demodulat or , filte rs, etc.), and g(1;, 8) is the cha racte ristic of the ba se sta tio n a nte nna . Th e term v(1" , t, 8) is Motivated by di ve rsity co mbi ning methods. ear lier me asure me nts were con ce rn ed primar ily with determ in ing t he the time -variant d irect ion al d istribu tio n of ch annel impulse response seen from the base sta tio n. T his distribution is timeco rr e latio n between th e signa ls a t two ante nna e le me nts as var iant due to mobile mot ion a nd depends on th e loca tion, a fun ction of th e e le me nt se pa ra tio n di stance . The se st udo rie nta tio n. and vel ocity of th e mob ile sta tio n antenn a a nd ies found th at , a t t he mob ile , rel at ively sm a ll se p a ra t io n th e to pog ra p h ica l a nd mo r phogra p h ica l pr op erti es o f t he dis ta nces we re requ ir ed to o btai n a sma ll degree o f co rrelati on be twee n th e e le me nts, whe reas at the ba se sta tio n propagation are a as we ll. Me asurem ent is use d to det ermine the distribution tl(1", t. 8) . very lar ge spac ing was ne eded . Th e s e f ind in gs indi c at e th at Ray Tracing Models th er e is a rel at ivel v sm a ll a n gle sp rea d o bse rve d a t~ th e base St a Th e mod e ls pr esented so fa r a re bas ed o n st a tistica l a na lys is a n d tion [6]. Pr e v io u s ly , a n ex tens ion to me a sur em ent s. a n d pr o vid e us wi t h the av e ra ge p a th lo ss and Sale h-V ale nzuela's indoo r mode l. d e la y sp rea d , a dj us ting so me incl ud ing A DA inf o r matio n. wa s pa ra me te rs acc ording to the e nvipr e s e n t e d . Thi s e xtensio n w as ronm ent ( in d o o r. o u td o o r , pro pos e d base d o n indoo r me a o bs tr ucted, etc .) . In th e past few su r c m e n ts of d e la y s p r e a d a n d yea rs, a determi nis tic mode l. ca lled A DA a t 7 G Hz ma de a t Br igh a m ray traci ng , h a s b e e n pr o p o se d Y ou ng U n ive r s it y [40] . Th e • Figure 18. Elliptical subregions spatial scatterer base d on the geo metric theo ry and AD As we re me asured using a 60 dens itv. em pa ra bol ic d ish ant enn a t hat re flec tion. d iffracti on . and sca tte rhad a 3 d B be am width of 6°. Th e ing mod els. By usin g site-spe cific info rmatio n, such as building dat abases or ar chitecture drawres ul ts sho we d a cl uste ri ng pattern in both ti me a nd a ng le ings, thi s technique de te rmi nis tica lly mod els the pr op agat ion do mai n, which led to the pr op osed channe l mod el descri bed ch ann el [33- 36], inclu d in g t he path loss e xpo ne nt a nd th e in [28]. Also . it was ob se rved th at the clu ster me an angle of de lay spre ad . However. th e hi gh co mputa tio nal burden and ar riva l was un iformly dis tribute d [0, 2It]. The d istribu tio n of th e angle of arrival of the rays with in a clu st er pre sented a lack of detailed terrain and building databases make ray tracing models difficult to use . Alt ho ugh so me progress has been sha rp pe ak at th e me an . leadin g to the Lapl acian d istribumad e in ove rcom ing the co mp uta tio na l burden , th e develop tio n modeling. The stand ard de via tio n found for thi s dis tr iment of an e ffec tive an d e ff icie nt pro cedure for ge ne ra ting buti on wa s a ro un d 25°. Based o n t hes e me asurem en ts. a ter rain and bu ildin g da ta for ray tr acing is still necessary . c ha n nel model inclu din g del a y sprea d an d AD A info rm atio n wa s pr op o se d , s up posing th at t ime a nd a ng le wer e Channel lvlodelSummary inde pe nde nt variables. Table 3 summari zes eac h of the spa tial models prese nted above. In [4 1L two- d im en sion al A DA a nd del a y sp rea d m e a s u r e me n t a nd es timatio n we re pr e sent ed . T he me asu re me n ts we re m ad e in d ow n tow n P a r is u s in g a c ha nnel so u nd e r a t 900 MHz a nd a ho rizo n ta l rect an gul a r p la na r There have be e n o nly a few pu blicatio ns re lat ing to spat ial a rr ay a t the re ce ive r. Th e est ima tio n of ADA , including cha nnel measurements. In this sect io n, references are given to azimut h a nd eleva tion a ngle . was perfor me d using 20 un ithese papers, and th e key res ults are de scribed . ta ry ES P R IT [42 ) with a ti me resolu tion of 0.1 us and angle In [38], TD A a nd ADA measure me nts are prese nted for resol utio n o f 5°. T he results pre se n te d con fi r me d as sump outdoor macrocellular e nviro nments. Th e meas ure me nts were tio ns mad e in ur ban prop aga tion , such as th e wave -guidi ng mad e using a ro tat in g 9 ° azimut h be a m d irectio nal rec e ive r m e ch an ism o f s t r e e ts a n d th e ex po ne n t ia l de cay of t he a nte nna with a 10 M Hz ba ndwid t h ce nte red a t 1840 M Hz . power de lay pr ofile . Also, it was observed tha t 90 perce nt of Three e nviro nme nts ne ar Mu nic h we re co nsidered, includ ing t he re ce ived power was co ntai ned in the p aths wit h elevaru ral , suburba n, a nd urb an a reas wit h base sta tio n a nte n na tio n betwe en 0° an d 40° wi t h t he lo w e leva te d path s co nheight s of 12.3 m, 25.8 rn, a nd 37 .5 rn, res pectively. Th e key tr ibuting a lar ger amo unt. obse rvatio ns mad e includ e [38]: Fina lly, in [43] me asurements are use d to show the var ia• Mo st of the signa l ene rgy is co ncentra te d in a sma ll inte rval tion in th e spa tia l sig na ture wit h both t im e a nd fre q ue ncy. o f del ay and wit hin a sma ll A D A in ru ral, suburba n . a nd Tw o me asures of cha nge are given, th e relative a ngle cha nge even many urban e nviro nme nts. given by
f
Spatial Signal Measurements
29
"
Model
.
-' "
.
,
"
r1escription
References: .
Lee's Model
Effective scatterers are evenly spaced on a circular ring about the mobile Predicts correlation coefficient using a discrete ADA model Extension accounts for Doppler shift
[3,9, 11)
Discrete Uniform Distribution
N scatterers are evenly spaced over an ADA range Predicts correlation coefficient using a discrete ADA model Correlation predicted by this model falls off more quickly than the correlation in Lee's model
(9)
Geometrically Based Circular Model (Macrocell Model)
Assumes that the scatterers lie within circular ring about the mobile ADA, TDA, joint TDA and ADA, Doppler shift, and signal amplitude information is provided Intended for macrocell environments where antenna heights are relatively large
[12-14, 16,37]
Geometrically Based Elliptical Model (Microcell Wideband Model)
Scatterers are uniformly distributed in an ellipse where the base station and the mobile are the foci of the ellipse ADA, TDA, joint TDA and ADA, Doppler shift, and signal amplitude information is provided Intended for microcell environments where antenna heights are relatively low
[17, 18J
Gaussian Wide Sense Stationary Uncorrelated Scattering (GWSSUS)
N scatterers are grouped into clusters in space such that the delay differences within each cluster are not resolvable within the transmission signal BW Provides an analytical model for the array covariance matrix
[19-22]
Gaussian Angle of Arrival (GAA)
Special case of the GWSSUS model with a single cluster and angle of arrival statistics assumed to be Gaussian distributed about some nominal angle Narrowband channel model Provides an analytical model for the array covariance matrix
(23)
Time-Varying Vector Channel Model (Raleigh's Model)
Assumes that the signal energy leaving the region of the mobile is Rayleigh faded Angle spread is accounted for by dominant reflectors Provides both Rayleigh fading and theoretical spatial correlation properties
[20)
Typical Urban
Simulation model for GSM, DCS 1800, and PCS 1900 Time domain properties are similar to the GSM-TU defined in GSM 05 .05 120 scatterers are randomly placed within a 1 km radius about the mobile Received signal is determined by brute f orce from the location of each of the scatterers and the time-varying location of the mobile ADA statistics are approximately Gaussian
[21, 22, 25)
Bad Urban
Simulation model for GSM, DCS 1800, and PCS 1900 Accounts for large reflectors not in the vicinity of the mobile Identical to the TU model with the addition of a second scatterer cluster offset 45' from the first
[21,22,25J
Uniform Sectored Distribution
Assumes that scatterers are uniformly distributed within an angle distribution of 9Bwand a radial range of M centered about the mobile Magnitude and phase associated with each scatterer are selected at random from a uniform distribution of [0,1) and [0, btl. respectively
[26]
Modified SalehValenzuela's Model
An extension to the Saleh-Valenzuela model, including ADA information in the channel model Assumes that time and the angle are statistically independent Based on indoor measurements
[28)
Extended Tap-Delay-Line Model
Wideband channel model Extension of the traditional statistical tap-delay-line model which includes ADA information The joint density functions of the model parameters should be determined from measurements
[29J
Model of multi path propagation based on the distribution of the scatterers in elliptical Spatio-Temporal Model subregions, corresponding to a range of excess delay time (Lu, Lo, and Litva's Model) Similar to the GBSBEM
,
I
I
Parameters are based on measurement Characterizes the propagation environment in terms of scattering points
[32)
RayTracing Models
Deterministic model based on the geometric theory and reflection, diffraction, and scattering models Uses site-specific information, such as building databases or architecture drawings
[33-36)
30
i I
[30]
Measurement-Based Channel Model
J! Table 3. Sum m ary ofspatia l chann el m od els.
I
i I
Conclusions Relative Angle Change (%)
As antenna technology advances, radio system engineers are increasingly able to utilize the spatial domain to enhance system performance by rejecting interfering signals and boosting desired signal levels. However, to make effective use of the spatial domain, design engineers need to understand and appropriately model spatial domain characteristics, particularly the distribu tion of scatterers, angles of arrival, and the Doppler spectrum. These characteristics tend to be dependent on the height of the transmitting and receiving antennas relative to the local environment. For example, the distributions expected in a microcellular environment with relatively low base station antenna heights are usually quite different from those found in traditional macroccllular systems with elevated base station antennas. This article has provided a review of a number of spatial propagation models. These models can be divided into three groups: • General statistically based models • More site-specific models based on measurement data • Entirely site-specific models. The first group of models (Lees Model, Discrete Uniform Distribution Model, Geometrically Based Single Bounce Statistical Model. Gaussian Wide Sense Stationary Uncorrelated Scattering Model, Gaussian Angle of Arrival Model, Uniform Sectored Distributed Model, Modified Saleh-Valenzue las Model, Spatio-Temporal Model) are useful for general system performance analysis. The models in the second group (Extended Tap Delay Line Model and Measurement-Based Channel Model) can be expected to yield greater accuracy but require measurement data as an input. An example from the third group of models is Ray Tracing, which has the potential t o be extremely accurate but requires a comprehensive description of the physical propagation environment as well as measurements to validate the models. Further research is required to validate and enhance the models described in this article. Bearing in mind that an objective of modeling is to substantially reduce the amount of physical measurement required in the system planning process, it is important for design engineers to have reliable models of AOA. TDOA. delay spread, and the power of the multipath components. Further measurement programs that focus on spatial domain signal characteristics are required. These programs would greatly benefit from the development of improved measurement equipment. Armed with improved spatial channel modeling tools and a greater understanding of signal propagation, engineers can begin to me e t the challenges inherent in designing future high-capacity/high-quality wireless communication systems, including the effective use of smart antennas.
and the relative amplitude change, found using Relative Amplitude Change(dB)
= ~~Oloblo 0
tJ Iladl
where a, and 3j are the two spatial signatures (array response vectors) being compared. The measurements indicate that when the mobile and surroundings are stationary, there are relatively small changes in the spatial signature. Likewise, there are moderate changes when objects and the environment are in motion and large changes when the mobile itself is moving. Also, it was found that the spatial signature changes significantly with a change in carrier frequency. In particular. the measurements found that the relative amplitude change in the spatial signal could exceed 10 dB with a frequency change of only 10 Ml-lz. This result indicates that the uplink spatial signature cannot be directly applied for downlink beamforming in most of today's cellular and pes systems that have ~5 MHz and 80 MHz separation between the uplink and downlink frequencies, respectively.
Application of Spatial Channel Models The effect that classical channel properties such as delay spread and Doppler spread have on system performance has been an active area of research for several years and hence is fairly well understood. The spatial channel models include the AOA properties of the channel, which are often characterized by the angle spread. The angle spread has a major impact on the correlation observed between the pairs of elements in the array. These correlation values specify the received signal vector covariance matrix, which is known to deterrnine the performance of linear combining arrays [-l41. In general, the higher the angle spread the 10\N"er the correlation observed between any pair of elements in the array. The various spatial channel models provide different angle spreads and hence will predict different levels of system performance. The channel models presented here have various applications in the analysis and design of systems that utilize adaptive antenna arrays. Some of the models were developed to provide analytical models of the spatial correlation function, while others are intended primarily for simulation purposes.
Simulation
More and more companies are relying on detailed simulations to help design and develop today's wireless networks. The application of adaptive antennas is no exception. However, to obtain reliable results. accurate spatial channel models are needed. With accurate simulations of adaptive antenna array systems, researchers will be able to predict the capacity improvement, range extension, and other performance measures of the system. which in turn will determine the cost effectiveness of adaptive array technologies.
References
(1] R. H. Clarke, "A Statistrcal Theory of Mobile-Radio Reception," Bell Sys. Tech. I, vol. 47, 1968, pp. 957-1000. [2] M. J. Gans, "A Power Spectral Theory of Propaqanon In the Mobile RadIO Environment," IEEE Trans. Vehic. Tech., vo1.VT-21, Feb. 1972, pp. 27-38. [3] W. C. Y. Lee, Mobile Communications Engineering, New York: McGraw Hill, 1982. [4] Turin, "A Statistical Model for Urban Multipath Propagation," JEEE Trans. Vehic. Tech., vol. VT-21, no. 1, Feb. 1972, pp. 1-11. [5] T. S. Rappaport, Wireless Communications: Principles & Practice, Upper SaddleRiver, NJ: Prentice Hall PTR, 1996. (6J F. Adachi et al., "Crosscorrelation Between the Envelopes of 900 MHz Signals Received at a Mobile Radio Base Station Site," lEE Proc., vol. 133, Pt. F, no. 6, Oct. 1986, pp. 506-12. [7] J. D. Parsons, The Mobile Radio Propagation Channel, New York: John Wiley & Sons, 1992. [8] W. c. Y. Lee, Mobile Cellular Telecommunications Systems, New York: McGraw Hill, 1989.
Algorithm Development
The availability of channel models also opens up the possibility of developing new maximum likelihood smart antennas and L~OA estimation algorithms based on these channel models. Good analytical models that will provide insights into the structure of the spatial channel are needed.
31
[9] D. Aszetly, "On Antenna Arrays In Mobile Cornrnumcatron Systems: Fast Fading and GSM Base Station Receiver Algorithms," Ph.D. dissertation, Royal Inst. Technology, Mar. 1996. [10] S. P. Stapleton, X. Carbo, and T. McKeen, "Spatial Channel Simulator for Phased Arrays," Proc. IEEE vrc, 1994, pp 1789-92. [11] S. P. Stapleton, X. Carbo, and T. Mckeen, "Tracking and Diversity for a Mobile Communications Base Station Array Antenna," Proc. IEEE VTC, 1996, pp. 1695-99. [12] R. B. Ertel, "Vector Channel Model Evaluation," Tech.rep., SW Bell Tech. Resources, Aug. 1997. [13] J. William C. Jakes, ed., Microwave Mobile Communications, New York: John Wiley & Sons, 1974. [14] P. Petrus, "Novel Adaptive Array Algorithms and Their Impact on Cellular System Capacity," Ph. D. dissertation, Virginia Polytechnic lnst. and State Univ., Mar. 1997. [15] P. Petrus, J. H. Reed, and T. S. Rappaport, "Effects of Directional Antennas at the Base Station on the Doppler Spectrum," IEEE Commun. Lett., vol. 1, no. 2, Mar. 1997. (161 R. B. Ertel, "Statistical Analysts of the Geometrically Based Single Bounce Channel Models," unpublished notes, May 1997. [17] J. C. Liberti, "Analysis of CDMA Cellular Radio Systems Employing Adaptive Antennas," Ph.D. dissertation, Vrrqrrua Polytechnic Inst. and State Uruv , Sept. 1995. (18] J. C. Liberti and T. S. Rappaport, "A Geometrically Based Model for line of Sight Multipath Radio Channels," IEEE VTC, Apr. 1996, pp.
[40] Q. Spencer et al., "Indoor Wideband Time/Angle of Arrival Multrpath Propagation Results," IEEE VTC, 1997, pp. 1410-14. [41] J. Fuhl, J-P Rossi, and E. Bonek, "High Resolution 3-D Direction-ofArnval Determination for Urban Mobile Radio, IEEE Trans. Antennas and Propagation, vol. 45, no. 4, Apr. 1997, pp. 672-81. [42J M. D. Zoltowski, M. Haardt, and C. P. Mathews, "Closed-Form 2-D Angfe Estimation With Rectangular Arrays in Element Space or Beamspace via Unitary ESPRIT," IEEE Trans. Signal Processing, vol., vol. 44, Feb. 1996, pp. 316-28. [43] S. S. Jenget et al., "Measurements of Spatial Signature of an Antenna Array," Proc. IEEE 6th PIMRC, vol. 2, Sept. 1995, pp. 669-72. [441 R. A. Monzinqo and T. W. Miller, Introduction to Adaptive Arrays, New York: John Wiley & Sons, 1980. II
Additional Reading
[1 J M. J. Devasirvatharn, "A Comparison of Time Delay Spread and Signal Level Measurements With Two Dissimilar Office BUildings," IEEE Trans. Antennas and Propagation, vol. AP-35, No.3, Mar. 1994, pp 319-24. [2) M. J. Feuerstein et al., "Path Loss, Delay Spread, and Outage Models as Functions of Antenna for Microcellular Systems Design," IEEE Trans. Vehic. Tech., vol. 43, no. 3, Aug. 1994, pp. 487-98. (3) J. C. Liberti and T. S. Rappaport, "Analytical Results for Capacity Improvements In CDMA," IEEE Trans. Vehic. Tech., VT-43, no. 3, Aug. 1994. [4J D. Molkdar, "Review on Radio Propagation into and Within Buildings," lEE Proc., vol. 138, no. 1, Feb. 1991. [5] A. F. Naguib, A. Paulraj, and T. Kallath, "Capacity Improvement With Base-Station Antenna Array," IEEE Trans. Vehic. Tech., VT-43, no. 3, Aug. 1994, pp. 691-98. (6) A. F. Naqurb and A. Paulraj, "Performance Enhancement and Trade-offs of a Smart Antenna 10 CDMA Cellular Network," IEEE V7C, 1995, pp. 225-29. [7] S. Y. Seidel et al., "Path Loss, Scattering and Multipath Propagation Stattstics for European Cities for DIgital Cellular and Microcellular Radiotelephone," IEEE Trans. Vehic, Tech" vol. VT-40, no. 4, Nov. 1991, pp. 721-30. [8] S. C. Swales, M. A. Beach, and J. P. MacGeehan, "The Performance Enhancement of Multi-beam Adaptive Base-station Antenna for Cellular Land Mobile Radio System," IEEE Trans. Vehic. Tech., vo1.VT-39, Feb 1990, pp. 56-67.
844-48.
[19] P. Zetterberg and B. Ottersten, "The Spectrum Efficiency of a Basestation Antenna Array System for Spatially Selective Transmission," IEEE VTC,1994. (20] P. Zetterberg, "Mobile Communication with Base Station Antenna Arrays: Propagation Modeling and System Capacity," Tech. rep., Royal Inst. Technology, Jan 1995. [21] P. Zetterberg and P L. Espensen, A Downlink Beam Steering Technique for GSM/DCS 1800/PCS 1900," IEEE PIMRC, Taipei, Taiwan, Oct., 1996. [22] P. Zetterberg, P. L. Espensen, and P. Mogensen, "Propaqatron. Beamsteering and Uplink Combrning Algorithms for Cellular Systems," ACTS Mobile Commun. Summit, Granada, Spam, Nov., 1996. [231 B. Ottersten "Spatial Division Multiple Access (SDMA) In Wireless Communications, , Proc. Nordic Radio Symp., 1995. [24] G. G. Raleigh and A. Paulraj, "Time Varyinq Vector Channel Estimation for Adaptive Spatial Equalization," Proc. IEEE Globecom, 1995, pp. 218-24. [25] P. Mogensen et et., "Algorrthms and Antenna Array Recomme-ndations," Tech.rep. A020/AUC/A 12/DR/P/1/xx-D2.1.2, Tsunami (II), Sept. 1996. [26] O. Norklit and J. 8. Anderson, "Mobrle Radio Environments and Adaptive Arrays," Proc. IEEE PIMRC, 1994, pp. 725-28. [27] A. M. Saleh and R. A. Valenzuela, "A Statistical Model for Indoor Multipath Propagation," IEEE JSAC, vol. SAC-5, Feb. 1987. [28] Q. Spencer et al., "A Statistical Model for Angle of Arrival I n Indoor Multipath Propagation," IEEE VTC, 1997, pp 1415-19. [29] A. Klein and W. Mohr, "A Statistical Wideband Mobile Radio Channel Model Including the Direction of Arrival," Proc. IEEE 4th tnt'l. Symp. Spread Spectrum Techniques & Applications, 1996, pp. 102-06. [30] M. Lu, T. Lo, and J. Litva, "A Physical Spatio-Temporal Model of Multipath Propagation Channels," Proc. IEEE VTC, 1997, pp, 180-814. [31 J E. S. Sousa et al., "Delay Spread Measurements for the Digital Cellular Channel In Toronto," IEEE Trans. vebtc. Tech., vol. 43, no. 4, Nov. 1994, pp.837-47. [32J J. J. Blanz, A. Klein, and W. Mohr, "Measurement-Based Parameter Adaptation of Wldeband Spatial Mobile Radio Channel Models," Proc. IEEE 4th Int'l. Symp. Spread Spectrum Techniques & Applications, 1996, pp. 91-97. [33] K. R. Schaubach, N. J. DaVIS IV, and T. S. Rappaport, "A Ray Tracing method for Predicting Path Loss and Delay Spread in Microcellular EnVIronment," IEEE VTC, May 1992, pp. 932-35. [34] J. Rossi and A. Levi, "A Ray Model for Decimetric Radiowave Propagation in an Urban Area," Radio Science, vol. 27, no. 6,1993, pp. 971-79. [35] R. A. Valenzuela, "A Ray Tracing Approach for Predictinq Indoor Wir~ less Transmissron." IEEE IITC, 1993, pp. 214-18. [36] S. Y. Seidel and T. S. Rappaport, "Site-Specific Propagation Prediction for Wireless In-Budding Personal Communication System Design," IEEE Trans. Vehic. Tech., vol. 43, no. 4, Nov. 1994. [37J P. Petrus, J. H. Reed, and T. S. Rappaport, "Geometncally Based Statistical Channel Model for Macrocellular Mobile Environments," IEEE Proc. GLOBECOM, 7996, pp. 1197-1201. [38] A. Klein et al., "Direction-af-Arnval of Partial Waves in Wideband Mobile Radio Channels for Intelligent Antenna Concepts," IEEE VTC, 1996, pp. 849-53. [39] H. J. Thomas, T. Ohgane, and M. Mizuno, "A Novel Dual Antenna Measurement of the Angular Distribution of Received Waves in the Mobile Radio Environment as a Function of Position and Delay Time," Proe. IEEE VTC, vol. " 1992, pp 546-49. II
32
Antenna Systems for Base Station Diversity in Urban Small and Micro Cells Patrick C. F. Eggers, J0rn Toftgard, and Alex M. Oprea
Abstract-This paper describes cross-correlation properties for compact urban base station antenna configurations, nearly all resulting in very low envelope cross-correlation coefficients of about 0.1 to 0.3. A focus is set on polarization diversity systems for their potential in improving link quality when hand-held terminals are involved. An expression is given for the correlation function of compound space and polarization diversity systems. Dispersion and envelope dynamic statistics are presented for the measured environments. For microcell applications, it is found that systems such as GSM having a bandwidth of 200 kHz or less can use narrowband cross-correlation analysis directly.
As
1.
INTRODUCTION
the bandwidths of newer digital land/mobile and personal communications systems increase, radio channel time dispersion can produce noticeable frequency-selective fading within the band. The capacity demand on such systems is also increasing, leading to network layouts with smaller cell sizes. A way to assist with cell layout. and to combat interference and fading degradation. is to use base station diversity. A normal figure of merit for narrowband antenna diversity systems is the envelope cross-correlation coefficient P12,.nv. For phase-modulated systems, the phase decorrelation is also relevant especially for predetection combining, and here the complex cross-correlation coefficient PI'2 can be used. The work presented in this paper falls in two areas. The paper describes investigations of the overall diversity potential for antenna systems used in urban small and microcells (predominantly range lengths up to 3000 m and 300 m, respectively), and the degree of overall radio channel dispersion by considering the temporal and spatial domain separately. Two base station sites have been investigated. One microcell site has antenna heights of a few meters above rooftops and range lengths from 50 to 800 m. On the other site, the antennas were elevated approximately 30 m above rooftops and ranges from 200 to 3000 m were used. Antenna configurations with vertical and horizontal separations have been used, as well as compound space and polarization diversity configurations. Hand-held terminals in existing mobile systems and upcoming personal systems will most likely have low polarization and will be subject to varying handset orientation. Under such conditions, polarization diversity is an obvious way of improving link quality. Manuscript received March 1992; revised December 1992. This work was supported by the Danish Technical Research Board. This work was presented in part at the Fifth Digital Mobile Radio Conference, Helsinki. Finland, December 1-3, 1992. The authors are with the Mobile Communications Group, Aalborg University, DK-9220 Aalborg, Denmark. IEEE Log Number 9210927.
Digital transmission using antenna diversity in frequencyselective fading channels has been investigated in [1]. The investigations were based on simulations and assuming fully decorrelated branch signals with uncorrelated scattering [(US), i.e., full decorrelation along the temporal axis], with the same average power delay profile (PDP) at each branch. This paper presents an extensive measurement campaign, performed in an urban environment. The radio channel has been sampled simultaneously in the spatial and temporal domains on two antenna branches. Achievable figures of the degree of antenna signal correlation, dispersion, and fading for practical systems are presented, giving a base of comparison to some of the assumptions used in [1].
II.
MOBILE RADIO CHANNEL CHARACtERIZATION
The mobile radio channel is often modeled by a superposition of the following three major effects: a) Large variations, i.e., range dependency (median pathloss) b) Local variations, i.e., shadowing, (generally considered log-normal distributed) c) Short-term variations, i.e., multipath fading (shown to follow Rayleigh or Rician distributions) In general, the mobile radio channel is both time variant and nonstationary. The measurements reported here have mostly been performed in low-density and low-velocity traffic situations. The roof of the measuring van (2.2 m) was higher than most of the other moving vehicles (scatterers). Thus. a timeinvariant channel situation is assumed during the measurement, although channel condition details may have changed for a later measurement at the same location (note it would be very difficult to find exactly the same location in practice). This assumption allows a comparison of the statistics. The measurement runs used have been short, so that global variation statistics (pathloss) are assumed "frozen." Thus, we consider the multipath fading being superimposed with local variations (shadowing) affecting only the mean values of the envelope signal. A removal of the estimated shadowing component is possible. This will stabilize the mean to a quasiconstant value. Thus, a wide sense stationary (WSS) short-term fading channel is extracted for analysis (described in more detail later). Since the, \VSS mobile radio channel may be visualized as a linear fl;~~r at a given time, it can be described either by its impulse response or by its transfer function. Alternatively, the spatially variant behavior of the radio channel can be investigated. This has the advantage of providing a stable channel, invariant to change in mobile terminal velocity.
Reprinted from IEEE Journal on Selected Areas in Communications, Vol. 11, No.7, pp. 1046-1057, September 1993.
33
The spatially variant impulse response h( 7, x) provides a direct illustration of the multipath phenomenon, where r is the temporal lag (delay) and x is the spatial position along the travelled path. The frequency Doppler transfer function H(f, fa) gives an appropriate picture of the spatialvarying behavior via Doppler shifts. These two functions, which describe adequately a deterministic spatially variant channel, form a two-dimensional Fourier pair. The following subsections describes the statistical parameters used for evaluation of the radio channel considered WSS in the spatial domain and fully stationary in the temporal domain.
envelope correlation coefficient P12 e n v is a specialization of (3) when the real envelope functions Ig(T, x) I are used instead of the complex functions g( 7, x). Thus, P12 e n v becomes a real function. For analysis purposes, the power correlation coefficient P12 p o w has also been used (see Appendix A).
B. Temporal Domain For the temporal domain, the power delay profile (PDP) is used as the basis for overall dispersion analysis
PDP(r)
Often, a CW measurement has been used to determine the correlation between fading signals from two diversity antennas. This corresponds to the DC response along the temporal axis, i.e., the complex envelope of the radio channel is found by integration as
.l:
h(r.x)dr
FCF(~f)
(1)
III.
is
and
== E[g;(x) . 92(X + ~x)) . My == E[g(x)] .
(5)
== F-1[PDP(r)].
(6)
where P, is the total power in the PDP. For high temporal resolution systems. the absolute delay function must be taken into account in (5) through (7). The temporal resolution in our experiments is approximately 1 lIS corresponding to a 300 m spatial resolution. As each measurement run was limited to 51 m.. we consider the absolute delay from base to mobile being constant over the integration of PDP in (5). We can then use (7) without modifications.
The normalized spatial complex correlation coefficient function is
~x
2
Ih(r,x)1 dx.
The coherence bandwidth is found at a given correlation level from the normalized FCF and describes the overall dispersion strength represented in the frequency domain. The RMS delay spread (S) is widely used to describe the overall degree of dispersion in the time domain [6], and is given as the square root of the second central moment of the PDP
corresponding to the DC component of the spatial-variant frequency transfer function H (0. .r ). For wide bandwidth systems.. a Received Signal Strength Indicator (RSSI) signal may also be used for driving a diversity combiner. The RSSI signal represents the total power over the band and will.. in frequency-selective channels. exhibit reduced fading dynamics. The RSSI signal is real and is found by integration of the spatially variant frequency transfer function weighted with the receiver filter. i.e.,
where the cross covariance of lag
I:
The PDP is an average power density impulse response. The frequency correlation function (FCF) follows by inverse Fourier transform via the Wiener-Khintchine Theorem as
A. Spatial Domain
g(l;) =
=
R'!Jlg2(~X)
(4)
R g 1g 2 and JL g are the complex cross-correlation functions and complex mean of the CW or RSSI signals following (1) or (2). E[·] is the expectation value (mean value) operator. For a continuous random variable (RV) V with probability function (pdt) j(v), E[V] = J~(X) vf(v) dv. Similarly, a discrete RV of sampled data V = [VI' ·'UN] is treated with ensemble averaging E[l/] = (V) = (liN) L:=1 Vn. The parameter of most interest when considering antenna systems is the correlation function with zero lag, i.e., ~x == O. The value of (3) at zero lag is normally just referred to as the P12. The widely used correlation coefficient, i.e., Pglg2(0)
=
34
THE MEASUREMENT SETUP
Usually, the choice of channel sounding technique depends upon the application foreseen for the collected data. To permit a study of the instantaneous behavior of the mobile radio channel later on, a direct pulse technique was chosen. The channel sounder, having a time resolution capability of approximately 1 JtS and an instantaneous dynamic range of about 26 dB, was operated at 970 MHz. To achieve adequate resolution of Doppler shifts, a sampling interval of 6 ern was used. The following subsections describe the hardware implementation of the measurement system.
A. Transmitter All frequencies used in the transmitter are derived from a stable 10 MHz frequency standard. The maximum transmitted power was a 5 W peak, the signal being radiated from a quarter-wavelength monopole mounted on the metal roof of the measuring vehicle. The cross-polarization discrimination (XPD) of the transmitter was difficult to measure, but field tests indicated a figure of up to 20 dB. This is quite high compared to XPD figures for normal vehicle mounted whip
antennas, but in our case the measuring van (Ford Transit-L) has a large flat roof, providing a better ground plane than most personal cars .
B. Receiver A dual-branch receiver is used to investigate the complex cross-correlation between the two antenna signals . Each branch is a conventional quadrature detection receiver and, as in the transmitter, all frequencies used are synthesized from a stable 10 MHz frequency standard. The dominating output filters limit the bandwidth (-3 dB single sided) to 0.6 MHz. A linear input signal dynamic range of -45 to -105 dBm is available . The I and Q signals from the two branches of the receiver are simultaneously sampled at a 3.3 MHz rate and stored on a hard disk. Two identical planar array directional antennas with an azimuth and elevation 3 dB beam width of 60° were used . Thus, the same illumination of the environment is achieved for both the copolarized and cross-polarized cases . The antennas have a gain of 8 dBi and a XPD better than 30 dB, ensuring sufficient suppression of the unwanted polarization to provide usable figures for the XPD of the radio environment. C. Measurement Data
The length of each test run was 51 meters . The data was stored on a pc, consisting of three consecutive complex impulse responses for both receiver branches at every spatial sampling point. The data transfer rate of the PC limited the vehicle speed to 3 ta]«. IV.
MEASUREMENT SCENARIOS
Two series of field trials were conducted in Aalborg, a medium-sized European city. The principal variable during these trials was the receiver antenna configurati on at the base station . Fig. 1 shows a map of the test area with the base station and measurement site location. In the first experiment, a typical urban environment was covered, corresponding to a microcell. The base station (BS 1) was located on the roof of one of Aalborg University 's buildings, some 18 m above ground level. The antenna position was just above the rooftop level of the surrounding buildings . The test route was chosen in a relatively flat and heavily built-up urban area consisting mostly of five-story buildings which are in close proximity to each other. A square of 0.75 by 0.75 km was covered by 14 measurement sites (shown by numbered circles on the map). Data were recorded on each of the 14 sites for 12 antenna configurations at the base station (Table I). In the second experiment, a small cell was considered. The base station (BS2) antennas were located on Hotel Hvide Hus, a 15 story building in Aalborg, some 30 m higher than the rooftop level of the surrounding buildings . The first part of the route was similar to that of the first experiment. The second part was chosen in an undulating environment, starting some 1.5 krn from the base station, across a 500 m wide river which splits the town in two. On the Nerre Sundby side of the river. the ground slopes upward reaching a height of 45 m at 2.6 km (site 14) from the base station and the area changes gradually
Fig I. Map
into a suburban one. There were 18 measurement sites chosen (shown by numbered triangles on the map). half in Aalborg and half in Nerre Sundby. the furthest point being around 3 km away from the base station . Data were collected for each of the 18 measurement sites for six antenna configurations (Table II). The higher elevation and longer range lengths at 8S2 will lower the effective beam width of the incoming scattered signal. Thus, larger antenna separations have been used at BS2 to obtain comparable decorrelation to the configurations used at BSI. V . DATA PROCESSING
The measured diversity data have been processed collectively for a block of measurements with the same base station antenna configuration. A measurement series consists of a measurement Hie for each location. The measured data are stored in the measurement files with a recorded impulse response for each diversity branch. Three consecutive in-
35
TABLE ANTENNA CONFIGURATIONS USED AT
(f - fo) = ±200 kHz). This filter provides a power spectrum closely resembling the main lobe of a GSM/GMSK power spectrum. For the CW signals, several correlations between the antenna signals have been calculated: P12, P12 e n v ' P12 p o w ' and PII, PIQ (see Appendix A). For the RSSI signals, only envelope correlations have been calculated. For all three envelope signal types and each antenna, the 1 % level of the cumulative envelope distribution (edt) is found. This information is valuable in assessing necessary fading margins in radio network design. Also, assumptions of Rayleigh fading signals (see Appendix A) can be coarsely validated in a compact manner. For a true Rayleigh fading signal, the 1% cdf level corresponds to a signal level 20 dB below the mean of the signal.
I
as1. THE
NUMBER IN THE BRACKETS
REFER TO THE ELEVATION OF THE LoWEST ANTENNA WITH RESPECf TO THE BASE STATION ROOF.
881
Ml
.....
M2
,'m~
M6
~
2m
(3m)
M4
(3m)
~
M7 (1.5m)
M10
~ V s
~
-I
1.45m
,2m~ (3m)
3m.
~. H pol.
M3
2m.
~
(3m)
-1m-
~45m
(1.5m) ~
~
M8
l.45m
(1.5m)
(2. lm)
pol.
Antenna Configurations
M11
"
~
,3m~ (2. 1m)
=46°pol.
~-lm-
M6
.... -I 1.45m
(l.5m)
M9
~o.2m
(1.5m)
..,.. ..,.. 3m
M12
(3m) = 3m above
TABLE II ANTE~Nr\ CONFIGURATIONS USED AT
852.
VI. RESULTS OF THE ANALYSIS
a.1m)
In the following discussions, all data from all antenna configurations are considered in the figures (unless specifically noted otherwise).
BS 1 roof
A. Radio Environment
SV\IBOLS t.:SED.
FOLLOW SAME NOMf:~CLAnJRE AS t.:SED IN TABLE
I.
BS2 Antenna Configurations M21
-I 2.9m I-
M22 ,2.9m~
M2A
~ 3.8m
M25
-I
~
3.8m
~
M23
M26
..... ..... ..... 2.9m
.... 3.8m
stantaneous impulse responses were recorded for each spatial position. Through coherent (complex) averaging of these three impulse responses, a noise suppression of almost 5 dB was obtained. To retrieve the fast fading components of the recorded signal, the log-normal shadowing component was compensated for. The log-normal component of the data was extracted by performing a moving average filtering in the spatial domain. Two consecutive rectangular windows with lengths of 10 and 6.7 m were used. The PDP~s for each branch were calculated by averaging the power of instantaneous impulse responses over the full 51 m run length. The statistical parameters extracted from the PDP's are delay spread (S), mean delay (r), and total power (Pt ) . The FCF's were found by inverse Fourier transform of the PDP's. The coherence bandwidths have been found for 0.9, 0.7, and 0.5 correlation levels of the normalized FCF. Three fading envelope signals have been generated from each data set-one CW signal and two RSSI signals. The RSSI signals have been extracted for the full bandwidth of the measuring equipment (1.2 MHz-3 dB double sided) and for a GSM-like bandwidth (200 kHz-3 dB double sided). A square 2 2 cosine filter IH(f)filterI = COS (O.S1r(f - 10)/200) kHz has been used for the GSM-like signal (truncated to 0 outside
36
From [2] and [3], it is found that short-term fading statistics are independent of impulse response shape and only depend on RMS delay spread (S) [as long as the delay spread bandwidth product is much smaller than unity, i.e., S . BW « 1]. This is referred to as a low-dispersive channel situation. For low-dispersive situations, the envelope correlation coefficient will be fully relevant, as all large phase and timing jitter variations are associated with fades in the instantaneous total power (RSSI signal). Thus, a classical envelope-controlled diversity combining scheme can also suppress the radio channelintroduced phase and timing jitter. Previous investigations [4] have shown log-normal shadowing with a 8 dB from the area covered by BSI. Short-term effect investigations in [5] indicate Rayleigh-distributed fading behavior for most of the strong power components of the PDP, for the areas covered by BS2. Line-of-sight (LOS) peaks, however, show distinctly Rician distributed envelope fading. Fig. 2 shows the 1% level of the cumulative envelope distribution dependence versus normalized delay spread, i.e., S· BW. For the plotting of the CW case, a 25 kHz bandwidth has been used. As expected, the CW signals are insensitive to radio dispersion whereas the RSSI signals reduce dynamics with higher dispersion and larger bandwidth. From Table IV, it follows that the mean 1 % cumulative CW envelope levels are indeed close to -20 dB corresponding to Rayleigh fading. For the RSSI signals, it follows that there is a strong increase in the 1 % envelope level for higher bandwidths, and that this increase is approximately 2 dB stronger for BS2 than for BSI. This is due to a higher degree of radio dispersion (S) at BS2 compared to BS1. The higher dispersion, the more frequencyselective the channel becomes and the probability of total power vanishing within the band is decreased. The transmitter/receiver equipment filters limit the resolution of the measured channel impulse response. The RMS delay spreads found from the PDP's were compensated for
=
0
CO
2.ci
...
0 0.
\ ...~·t
-5
8
-10
.
0.8
,,::..: .
: . :«.
..... -15 .Q II) >
-20
~
-25
c::
10-2
10 '!
...c,
~ II)
til >.
100
0
\
BS2
2
o
8
1.5
"
00
0 a
0
0
0
0 0
0
00 0
0
"
o0"__ 0
0
00
"
0
•
0.8
t
\
\ \ \ \
\
'
\
400
\
\
c= 0.5: c=8·7: c= .9:
\ \
0.4
c
"" ,,"" " " ,,"
500
-'
!
\
.<'
30
\ \
300
\
0 0
0.2 ~
I
" "
o o
40
,
\
!
.
, \ \
-1
\
\
\
i
\
\
\
\
\
\
\200
\
\
\
\
\
I '_ _~_ _...L...:'---::-:
300
500
BW [kHz]
Norm Path Loss [dB] RMS dela v spre ad ve rs us nor ma lized (ex cess ) pa th
\\ 100
'-
\
1L.._-..l._~....L
0
20
\
200
0.6
:03 ~:;f~~;"~ 10
\
\
(u)
o _
0
0
u
0
\ \
0
o~ ~o
0
0
0
\
\
BW [kHz]
0
0
0
0.5
\
\ \ \ \ \ \
100
0
0
x: BS1 0:
\ \ \
10 1
0
~
Fig . 3.
\
I
\ \ \ \
3
-0
\ \
\
Fig. 2. Cu mulative e nve lope dis tribution at 1rr,. lev el ve rs us nor m ali zed delay sp read .
Vi'
\
\
0.2
x:CW 0: 200kHz .:1.2MHz
f-
c=0.5: \ c=8·7: \ c= 9'
\
I
Normalized delay spread S BW
2-
\
0.4
-3{l)-3
2.5
,
\
Q.l
0.
\ \ \ \
0.6
""
~
\
( h)
Fig. 4. Coherence ba ndwidth at 0.5. 0.7. and 0.9 corre latio n level for (a) 8 S1 a nd (b) 8 S2.
Ill SS .
this time interference by simple variance subtrac tion [6] , i.e..
(8) It is, thus, possible to obtai n RMS de lay spread figur es with finer resolution than the time resolut ion of the transmitter/receiver equipment initia lly wo uld permit. Th is make s the RMS delay spread figur e also relevant to syste ms having higher bandwidths than the 1.2 MHz used by the sounding system. Fig. 3 indic ates a dependenc e betw een exc ess pat h loss and RMS dela y sprea d, i.e., larger dela y spreads for increas ing excess path loss (where the excess path loss is the path loss relative to the free -space path loss). The indicated dependence can be explained by a lower prob ability of LOS path s with an increased excess path loss, as LOS path s will generally have lower excess attenuation than scattered and reflected path s. Thus, LOS paths tend to dominate (increase ) the total power and reduce the effective width (dispersion) of the PDP . Fig. 4 shows the cumulative co herence bandwidth for all measurement locations and antenna systems for BS1 and BS2 . For BSI [Fig. 4(a)] , it is observed that the 0.7 coh erence
37
bandwidth is larger than 200 kH z for 90% of the locations. In most cases, this justifies using narrowband considerations for a GSM-like system in this env ironm en t. The coherence bandwidth function for BS2 [Fig. 4(b)] shows a large discontinuit y aro und the 70- 80% level. Thi s is du e to the rather har sh environment picked for this cell type . A river splits the town in two and allows free propagation for strong echoes across the river. Many PDP 's exh ibit a double-spike shape with abo ut 4 /LS separation (corres po nding to twice the river width). T his shows up as a strong periodicity in the FCF and , thus gives rise to the plat eau in the cumulative coherence bandwidth function . For ba ndwidths over 500 kH z, a direct narr owband description alone cannot give a satisfactory description of the propagati on conditions for the micro or the small cell enviro nme nt investigated. T he GS M system has incorporated a slow frequ ency hopping option over 5 MHz . From Fig. 4, it follows th at if the hopp ing frequ ency is just over 400 kH z neith er the micro nor sma ll cell environment will have locat ions with a FCF having
15
8
o
"
~ ~
a ~
10 -
0< qf II
)( JIC
" II
5f->l'
80
0
~
0: 0
0
0
8
c
08
00><8 0
)(~)(
~
~
........
01 0
0
0 u
0 0
~""0 ><0 ... " II
.9
-
0
08
"
x: BS1
0:
"
0
~
0 00
II "
q, 0
0
0
1
0
0
'0
B :ll "3 U
-
BS2
0.8 0.6
0
o
0.4
00
U
0 -0.2
Distance [m]
"
0
8
o
0
0
00
o~.o ·
0
0.2
0>J,
0
8
"
0
"
CIl> 0
>0<
/
/
;,(
/
/
/
/ "
)( o>e)( /<><
""
o /
/
/~
~?""
~~"t
"
"
.. ,0 :
cc
=
Xpol. only 0.3632
-
--,x: Xpol. and space cc
0
0
<e"
0 0
0
0
=
0.8723 0.5
1
Envelope correlation
Fig. 5. Cross polarization discrimination versus range length.
Equatio n (9) with 1'. >n\ ' .\'p,,1 only (Pond ' = 1) and with measu red versus envelope co rrelation coe fficient for physi call y s lant antenna system s. Fig. h .
I" 'II \" i
levels greater than 0.5. This indicates effective frequency diversity gain by use of the slow frequency hopping option .
Experimental test cases are given in Appendix A to support these assumpt ions. The power correlations are related as:
B. Cross Polarization The possibility of using polarization decorrelation (Ppow x po') at a base station has been reported by [9], where the XPD was found in the range around 6 dB for urban areas at 920 MHz. Compact , compound, horizontal, and vertical space diversity antenna systems and polarization decorrelation have also been reported in [10], where macrocells (10-20 km cell radius) were investigated. For urban areas (partly the same area as used for the experiments in this paper), the XPD was around 4 dB in the 900 MHz band . For suburban areas , XPD was found in the range around 12 dB. Fig. 5 shows the XPD versus the range for all antenna configurations at BSI and BS2. It follows from Fig. 5 that there is a large spread of XPD for both BSI and BS2. From Tab le IV, it follows that the urban (BSl) mean XPD is higher (7.4 dB) for small and microcells compared to the macrocells previously investigated. This is expected, as the depolarization is related to the number of reflections, diffractions, etc., that each path is subject to. For small cells, fewer possible pertubating objects will be in the signal path . For longer range lengths, the mean XPD is 11.4 dB (BS2), which can be explained by the environment having a more suburban character with few obstructions between base and mobile. The higher XPD's found for small and microcells means a reduc ed diversity gain by using polarization decorrelation compared to macrocell case. Appendix A gives a simple extension of the work of Vaughan [12]. The result of the analysis shows that polarization and space decorrelation effects are independent and multiplicative for compound antenna systems, as given in (9). The assumptions are noncorrelated Rayleigh fading polarizations, equal XPD (f) at the antennas, and the quadrature components of the vertical and horizontal polarizations exhibit approx imately equal space decor relation prop erties. In practice, this means that the rad iation patterns of the antennas must be identical and rotationally symmetric .
38
P po\\' 1~
= P po w! ' PpmvXpo l( r . n ) r+
t-2
TAB L E 1lI AVERAGE «» AND STANDARD D EVIATION (U) VALUES OF C W ENVELOPE CORRELATION COEFFICIENT AND BRANCH POWER D IFFERENCE.
...."""'.
g'l_
M1
0 ,1 4
, 0 12
-r.o
M2
0 07
0.0 8
· 1 ..
<>
:
CW
..
P,·Pl
0.5
0.. ;
U
"
0 .2 1
0 .27
- l. i'
""
: 0. 12
- 1.6
MS
0 07
: 0.09
0 .s
"
M.
0 .23
0.12
-o.s
::!,Q
M7
0.70
0 .22
<).7
1.7
M'
0.20
0.1.5
M.
O'
0 09
0 .09
Ml0
0 . 1]
o ie
- - ~t~
!,
"
X ... :
o
.,. "
M ll
0 04
l}.O7
"7
0.12
o.u
-1.0
M21
O.jO
0)0
0.'
• - .: M22
"
1000
U9
"I.S
iI "
'"
M22
0,20
0, 17
M2J
0. 37
O.Z6
I .i 0
M 24
0.64
'J 25
: 0.2
\125
0. 36
U 10
~
o.s
,:
\t26
ll ~ "
u 24
I 0. 2
i .:
Fig. K.
i.1
-
I
[",I
XPD
[dB]
cdr ew
[dBI
cdf xo
IdBI
cdf 12
IdBI
<>
a
<>
a
< >
a
<>
a
<>
a
BSI
0.44
0.36
7.'
20
-19.8
1.6
-157
2.2
·11 0
2.•
BS2
0 82
0.8 1
11.4
30
·19.6
1.9
-13.8
3.1
-9.1
3.1
x : BSI BS2
._ o~
-~
~
-0
...: ~ --'
.J
o
X:O
o alP< c soe
}~~ 6 ~ o
,
-:
.:l
=
~
0 0
11 I I !
10 0
I I
I II
101
Vertical polarization S [usee] Fig . 7.
E nvelope corre latio n co efficient versus range len gth
C. Antenna Systems
S
CO
3000
Distance [m]
,
A VERAGE' « » AND STANDARD D EVIATION (u) V ALlJES OF S, X P D, AND 1% LEVEL OF C UMULATIVE R SSI E NVELOPE DISTRI13lJTION (cdf) FOR C W, 200 kHz, AND 1.2 MHz BANDWIDTII S.
0 :
2000
o.
T A B LE IV
Base
MI
; MIO
+ --; M2I
2.1
1.1
MI2
+
[d81
<>
0 .09
MJ
I
.
.y....,
+
+
RMS dela y sprea d for decouplcd (ho rizo ntal) pol ari zat ion RMS delay spre ad for th e co -polari zed ( vertical) signal.
versus
to couple more power into the cross-polarized component , ther eby increasing the polarization diversity gain potential. The PDP's observed for both the co- and cross polarization show ed very similar shapes except in the case of a dominant LOS peak in the copolarized case. Fig. 7 show s the RMS delay spread for the co- (vertical) and cross polarization . It is seen that most of the data lie around the 1: 1 line, although some stray points are present. This indicates equal strength of the me an radio disper sion effect s on the two polarizations.
Th e overall decorrelation properties of each antenna system are given in Table III. Recent theoretical work into base station cross correlation [11] has shown a model that can predict decorrelation of horizontal as well as vertical spaced antenna combinations. The model shows how the correlation increases with range length. The analysis in [11] is, though, mainl y concentrated on longer range lengths (5 km) and larger antenna sepa rations (10-20 A) than used in our experiments. However, some comparisons can be made. From Table III, it follows that most antenna configurations have an average envelope correlation around 0.1 to 0.3 with a standard deviation aro und 0.2. Only the pure vertical space diversity systems show a significantly higher correlation of 0.6 to 0.7. For BS2, somewhat lower correlations ar e found compared with the examples given in [11] (cases with approximately 10 A horizontal or vertical separation), with the horizontal separation being very sensitive to model parameter variation. For BSl , the base station antenna height is so low that the model assumptions in [11] are questionable and lead to much lower measured correlations than the model examples given . Th e modeling of compact spaced configurations, thus, seems to pose higher difficulty for cross correlation prediction, especially for very low base antenna heights as found in rnicrocell impleme ntations. A trend of cross correlation depending on range (as exp ected from [11]) is clearl y visible in Fig. 8, where cross correlation versus range is shown for some selected antenna systems. Local variations in environment may mask this effect (i.e., make it less pronounced), although the measurement area covering the locations around BSI was chosen for its fairly homogenous nature with respect to building heights, street width s, and building density. Fig. 9(a) shows the envelope correlation coefficient increase for the RSSI signals , compared to the CW signals , versus normalized delay spread S . BW. There docs not seem to be an y clear dependence on rad io dispersion for the overall dat a as expected from the high frequency selectivity of the channel, apart from a slight increase in correlation variability
39
o
x : 200kHz 0 : 1.2MHz
0.4
o
0
o o
0.2
0
0
o
~
I
i
I
o
o
10-1
10°
10 1
Normalized Delay spread S BW ( ,' I
1
.~
0.8
-:
-
:J
~
tl
CIl CIl ~
r I
r ;
,i
~
!)
!I
0.6 0.4
r-
:) ., L \ '._ 1 !
_..x : 200 kHz --.0 :
o
1.2 MHz 0.5
CW envelope correlation I hi
i) For the microcell area, the 0.7 coherence bandwidth exceeds 200 kHz at 90% of the locations. This justifies the use of narrowband considerations for GSM, in most cases . ii) For the micro - and small cell areas, no location shows a 0.5 coherence bandwidth exceeding 400 kHz. Thus, the frequency hopping option of GSM will have a high frequency diversity gain potential. iii) The cross polarization discrimination shows a large variance with location and mean values of 7.4 and 11.4 dB for the micro- and small cell areas. These means are larger than previously reported for macrocells in the same type environment. 2) The general evaluation of the antenna systems show : i) The pure vertical space separation of an antenna system can yield acceptable decorrelation properties (mean PenvV around 0.6 to 0.7) for both micro- and small cell areas. ii) All other antenna systems provide very high decorrelation efficiency (mean Penv around 0.1 to 0.3) and, thus, high diversity gain potential. iii) Polarization diversity provides extra decorrelation in the compound antenna systems with about equal strength as the space decorrelation effect. 3) The analysis and experimental treatment of antenna system cross-correlation dependencies show that: i) The polarization and space decorrelation effects in compound antenna systems are independent and multiplicative. ii) RSSI signal decorrelation are largely insensitive to relative dispersion (bandwidth and RMS delay spread) for GSMtype systems. The information contained in this paper verifies the effectiveness (diversity gain potential) of very compact antenna systems in micro- and small cell environments. The dimensions of the antenna systems lead to much easier mounting and site considerations than for standard mast-mounted macrocell implementations .
Fig. 9. (a) Envelope correlation increase with normalized delay spread . (b) RSSI versus CW envelope correlation coefficients.
ApPENDIX DERIVATION AND EXPERIMENTAL VERIFICATION
with increasing dispersion. A very close agreement between CW and RSSI envelope correlations is seen in Fig. 9(b) . Here it -is shown that there is a slight mean and standard deviation increase of correlation for increasing bandwidth Thus. the analysis for compound space and polarization systems, given in Appendix A, may also apply for wideband systems using RSSI driven combining even though the RSSI signals do not exh ibit Rayleigh fading as assumed in the development of (9). Generally, the antenna systems with pure vertical space separation diversity exhibit marginal decorrelation properties. All the other antenna systems exhibit very strong decorrelation properties, promising a high diversity gain .
VII. CONCLUSION
The main findings in this paper are in three areas. 1) From the general radio environment related investigations of the micro- and small cell areas, it follows that:
OF COMPOUND ANTENNA SYSTEM CROSS-CORRELATION FUNCTION
We will now develop an expression for the CW envelope correlation coefficient for two tilted (orthogonal) antennas with respect to the CW envelope correlation coefficient for co-polarized antennas [(9) in Section VI] . In this analysis, however, power correlations are considered as they are easier to handle than envelope correlations. This is analytically justified by a close relation in value between the two [7]. This can also be seen experimentally in Fig. 10, where a very strong correlation (ee) of 0.99 is found between power and envelope correlation coefficients for the data presented in this paper. This relation has also been experimentally displayed in [8] for two vertically separated antennas with a slightly poorer fit, although Ipd 2 was used instead of Ppow ' While theoretically IPJ21 2 = Ppow [7] for Rayleigh fading signals, it follows from Fig. 13 that experimentally this equality is slightly poorer than the approximate relation between the envelope and power correlation as shown in Fig. 10. Higher variances for the
40
1
C
.9
~
...... 0
U u
4.)
,r'! j
0.8 0.6
. /,"
0.4
U > c
0.2
Ul
0 -0.2
l(
/
~
.9
cc=0.9924
u
0.6 "-
u 0
1
U > c4.)
0.4 -
(i;
0.2 -
C 0
N .;::
0
::r:
0-
10. En velope
corre lation coe fficient coe fficie nt.
versu s
power
correlation
~
Ppow H
0
0
0
0
"
-
"
°
x: BSI
"
-I
BS2
0 :
0
-
0.5
1
0
05'
....2"0
u
~
......
"i
c:0
-10 "-15 "-
o
:r::
-20 "-
.....1\
... :t: +
~
~ tb i:+ . +
o
"
+
T
~o$:$~
. "i!;"
*"
" ')<
.r
+
++~-.+-~ + +
«: 0
if
-25 -25
++ + +
cc = 0.9261
-5
N .;::
"
-20
-15
x: CW o : 200
ld-tz + : 1.2 MHz -10
-5
1.J1
Vertical 1% cdf [dB) Fig. 12.
(A- I)
with subscript 1 and 2 den oting th e field at ante nnas 1 and 2, respectively. A ssuming the two ante nnas are horizontally and/o r vertically displ aced (space diver sity), we hav e two power cor relati on coe fficients ( Ppow v and PpowH for the vertica l and hori zontal co mpo ne nts, respectivel y). Fr om [10) and Fig. 11 (sho wing e nvelope correlation s), it follows th at: PpowV
"
° oSl )( 0 " . >c " " "" "0 " 0,," " ° "
0
Fig. II . Enve lope co rrela tion coe fficient for dccoupl cd (horizon ta l) polar ization versus enve lope corre lation coefficie nt for the co-polarized (vertical) signal.
= Ppow relation can be explained by two factors. For the relation to hold, the signals must be truly Rayl eigh fading while both power and env elope correlation s hav e proven to be fairly insensitive to changes in envelope dynami cs (not all expe rime ntal result s being Rayl eigh d istributed ). Secondly, th e expe rime ntal result s allow for negative correlation s but IpI21 2 does not. Th e field components ar e assumed to have Rayl eigh-di stributed envelopes (r ) with random uniformly distr ibuted ph ases ( 0) and G au ssian -distributed quadrature compo ne nts. Th e field compo ne nts of th e two polariz ations at both ante nnas are assume d unc orrelated in envelope and phase. For the envelope. thi s assumption is supporte d by [9], [12), and T able III . Fo llowing Va ughan's [12) procedure, we find ea ch ant enna has vertical and hor izontal Ra yleigh fadin g field compo nents as
E H I.2 = rll1.2cos(wt + OHi .2)
0 0
0
0
0
0
°
0
0
00 0
Vertical envelope correlation
Ipd 2
Evl.2 = rV1.2 cos(wt + OVI.2);
0
0
-0.2
0.5
c_ 0
Po wer correlation Fig.
cc = 0.7665
0..
~
0
0.8"-
......0
l
1
~
U
1,
>II'''
0.. 0
c
,j'
1% cumu lative envelope levels for decoupled (ho rizontal) polarizalion versus co-po larized (vertical) signa l.
polari zati on s. Furt hermore, it follow s fro m [10) and Table III th at it is reasonable to assume approximately equal me an power at th e two antennas for each polarization.
E [Pvd
~
E[P d ;
(A-3)
Thus, the XPD (T = E [Pvd / E [PI/I ) ~ E [PV2]/ E [PH2D is ass ume d appro xima te ly equal at the two antennas. The powers a re PVI.2 = r ~1.2 ' PHi .2 = r ~ 1.2 ' As the envelo pes of both the po larizati on s at each antenna (rV.HI.2) are assumed R ayleigh distributed, th e following relat ionship holds :
(A-2)
is a reason abl e assumption. Th e correlation (cc) bet ween the two is larger for macrocells (cc = 0.88) [10) th an for the small and microcells con sider ed her e (cc = 0.77) . In pr actic e, thi s relati on implies that the antennas hav e approximately equal radiation patterns, and that th e radiation patterns in th e vertical and horizontal plan e are approximately equal, i.e., rotation symmetry of th e radiation pattern aro und th e axis of th e main lobe. Fig. 12 shows th e 1% cumulative envelo pe level for the cross and cop olarized signals. It is seen that the env elope dynamics are also approximately equa l for th e two
E[P ~.Hl .d = 2E[Pv.II 1.2F-
(A-4)
Using (A- 4) and (A -3), we get th e co rrelations
_ E [PV.H1PV,I/2 ] - E[P v HlP PpowV,II E[P)2 ' V.HI
41
(A -5)
(A-lO)
o : quadrature cc = 0.9951
t: o .;::
ro
due to the phases being random, uniformly distributed, and uncorrelated between the polarizations. The cross-power moment is found as [and reduced via (A-3) and (A-6»)
1
~
.... .... o u
-ci ro
5-
.... o
E[P IP2l = aW(E[PVIP V2l + E[PHlPH2])
0.5
+ a4E[PvdE[Pml + b4E [P v2lE[PHll + R(Vl s V 2)
.... 11) ~
o
0..
"'"aW
x: power cc = 0.9559
o
0.4
0.2
0.6
+
0.8
Square complex correlation
E[PvtPd "'" I? E[PHlPH2l .
(A-6)
Now consider the two antennas being rotated to an angle a to the vertical polarization axis. Then, the voltages received at antennas 1 and 2 are proportional to
V 2 = bE v2 - aE H2
(A -7)
with a = cos (a) and b = (sin(a) as the antenna signal quadrature weights. Following Vaughan's [12) procedure and substituting (A-l) into (A-7) and squaring, the antenna branch powers can be found as PI = [arvi cos(8 VI ) =
P2 =
8H1) 8H2) .
(A-B)
The mean power moments are found as [and reduced via (A-3»)
2
= a E[Pvd
E[P2l = b2E[Pd
+ +
8H1 )l
2 b2E[PHIl = E[ Pvtl(a
(A-11)
R(V" V 2) = -4aW(E[Ivllvz)E[IHlIH2l
+ E[Qv, QvzlE[QHI QH2l + E[lv , QV2l E[IHi Qml + E[lvzQvdE[lmQHI])
+~)
2 a2E[PH2l "'" E[Pvd( b
+~) 42
(A-12)
rV.Hl ,Z· where the in-phase components are Iv.HI.2 cos( 8v.HI.z) and the quadrature components QV.HI.2 rV.HI.2 sin( 8V.HI .2). As for each polarization, the signals are assumed Rayleigh fading and the in-phase and quadrature components are Gaussian distributed with zero mean and equal variances (at = a~) . Using (A-3), the ratio between the variances for each polarization is E[Pl
= ai + a~ = 2a z
aIv.1I1 = a~v.HI = aIv.m = a~v.m z r = av
(A-B)
The quadrature component correlation coefficient is then found as PIIV.H =
E[lv.H,lv.ml E[IZV.HI 1
E[QV.HI Qv.lI2l E[Q~.HI)
_ 2E [Iv.HI lv.ml E[Pv. HI)
(A -14)
Similarly, the cross quadrature expectation becomes E[PV.Hl E[lV.HIQV.HZ l> - -E [Q v.nilv.m l> -PIQV.H-2-·
(A-9)
+ 2abE[rVIlE[rHllE[cos(8v1-
E[P vl ]2 + R (V t , V 2) .
a~ '
The antenna branch voltages in (A-7) are a sum of two Rayleigh fading signals which produce a new Rayleigh fading signal as the quadrature components are Gaussian distributed). Then, the power relationship of (A-4) applies for PI and P2 as well, and the power correlation coefficient {Jpowl2 for the two tilted antennas is
E[P,l = a2E[P vd + b2E [PHI l
r
ponents of field components given in (A-I) as
Comparing the two polarization correlations by substituting (A-5) into (A-2), we have
+ brHl cos(8H1W + [arvi sin(8v,) + brHI sin(8 H1 W a2PVI + b2PHI + 2abrVIrHi cos(8 v, b2PV2+ a2PH2 - 2abrV2rH2 cos( 8V2 -
(a 4 + b4 )
E[PV1Pd
R( VI, V 2 ) can be expressed directly by the quadrature com-
Fig. 13. Square quadrature component correlation coefficients (pi, + pJQ) and power correlation coefficient versus square module of complex correlation coefficient (IP12I')·
VI = aE V1 + bE HI :
(1 + ;2)
(A-15)
For Rayleigh fading signals, it can be found that PIQ = - PQI and PII = PQQ [13]. Furthermore, the complex correlation is related as PIZ = 1/2(PII + PQQ) + j1l2(PIQ - PQI = PII + jPIQ' From (7], it follows that PII + PIQ = Ipd z = Ppowv . This is shown in Fig. 13 for the data presented in this paper. The quadrature component correlations (offset by 0.4 for clarity) have an extremely high correlation (cc = 0.995) with the squared complex correlation coefficients. The power
r:=
.9
1
~
0.... .... 0 u
)(
:rt?<
0.5 )( )(
~
{I)
~
.~ .... u
)(
0
X )(
~
.5
)(
>C
>C
>C~
)(
... 0
N
I
cc=0.909
0
-1
-1
-0.5
ACKNOWLEDGMENT
I
>C
·C
~
~
XX
Xx
)(
tU -0.5 s::
:r:
x
)()(.
)(
.J::
0.. ,
into (A-II), the power correlation coefficient in (A-9) reduces to the expression (9) shown in Section VI.
)(
0.5
0
The authors acknowledge the participation of C. Jensen in the experimental part of this work during his employment at Aalborg University, and H. Fredskild from Telecom Denmark Telelaboratoriet for providing a second matching base-station antenna. The comments of the reviewers, who helped enhance the quality of this paper, are greatly appreciated.
REFERENCES
1
[1] B. Glance and L. J. Greenstein, "Frequency-selective fading effects in digital mobile radio with diversity combining" IEEE Trans. Commun., vol. 31, no. 2, pp. 1085-1094, Sept. 1983. [2] J. B. Andersen, P. C. F. Eggers, and B. L. Andersen, "Propagation aspects of datacommunications over the radio channel-A tutorial," in Proc. EUROCON '88, Stockholm, Sweden, pp. 301-307. [3] B. L. Andersen, P. C. F. Eggers, and J. B. Andersen, "Time and phase variations in the mobile channel," in Proc. Nordic Radio Symp. '89, Saltsjobaden, Sweden, pp. 297-304. [4) P. E. Mogensen, P. C. F. Eggers, C. Jensen, and J. B. Andersen, "Urban area radio propagation measurements at 955 and 1845 MHz for small and micro cells," in Proc. IEEE GLOBECOM'91, pp. 1297-1302. [5] P. E. Mogensen, "Preliminary results from short-term measurements in urban area," COST 231 TD(90)-88, Paris, France, Oct. 8-11, 1990. [6] A. A. M. Saleh and R. A. Valenzuela, "A statistical model for indoor multipath propagation," IEEE J. Select. Areas Commun., vol. 5, no. 2, pp. 128-137, Feb. 1987. [7] J. N. Pierce and S. Stein, "Multipath diversity with nonindependent fading," IRE Proc., pp. 89-104, Jan. 1960. [8] M. T. Feeney and J. P. Parsons, "Cross-correlation between 900 MHz signals received on vertically separated antennas in small-cell mobile radio systems," lEE Proc., vol. 138, no. 2, pp. 81-86, Apr. 1991. [9] S. Kozono, T. Tsuruhara, and M. Sakamoto, "Base station polarization diversity reception for mobile radio," IEEE Trans. Vehic. Technol., vol. 33, no. 4, pp. 301-306, Nov. 1984. [10] P. C. F. Eggers and J. B. Andersen, "Base station diversity for NMT900," in Proc. Nordic Radio Symp., Saltsjobaden, Sweden, pp. 77-85. [11] A. M. D. Turkmani and J. P. Parsons, "Characterisation of mobile radio signals: base station crosscorrelation," lEE Proc., vol. 138, no. 6, pp. 557-565, Dec. 1991. [12) R. G. Vaughan, "Polarization diversity in mobile communications," IEEE Trans. Vehic. Technol., vol. 39, no. 3, pp. 177-186, Aug. 1990. [13] D. E. Kerr, Propagation of Short Radio Waves. Boston, MA: Boston Tech. Pub. Inc., 1964.
Vertical inter-in-phase correlation (a)
e .9
1
I
I
I
)(
~
~
.... .... 0 u
....
~
)( >sc)(
~ )(
0.5 -
)(
)(
)( )(
~
~ ....
"0
~
='
':r :n
'"
0--
)(
:n
)(
0.... u
)(
co -0.5 ~
=
)(
cc=O.8809
0
.:N a
~ ~
)C'
-1
-1
-0.5
0
0.5
1
Vertical cross-quadrature correlation ( b) Fig. 14. Horizontal versus vertical (a) inter-in-phase (p,,) and (b) crossquadrature (PtQ) correlation coefficients for BS2.
correlation coefficients have a slightly poorer correlation (cc = 0.96), but are still very high. With the previous discussion, we can reduce (A-I2) (with the use of (A-14) and (A-I5) and rearranging) to
(A-16) It follows from Fig. 14, that it is reasonable to assume that the quadrature component correlations are approximately equal for the two polarizations, though the shown data only represent BS2. At BSl, the antenna cables were changed between the vertical and horizontal polarization experiment. Thus, the phase offset on the complex correlations will be changed from the vertical to horizontal experiment. Consequently, the PH and PIQ relations between the two polarizations at BSI are altered and not usable. With this discussion and inserting (A-16)
43
A Statistical Model for Angle of Arrival in Indoor Multipath Propagation Quentin Spencer, Michael Rice, Brian Jeffs, and Michael Jensen Department of Electrical & Computer Engineering Brigham Young University Provo, Utah 84602 [1], whose work was based on the work of Turin. Their work consisted of collecting temporal data on indoor propagation, from which they proposed a time domain model for indoor propagation. Most indoor propagation research has dealt with the time of arrival and paid little attention to the angle of arrival. In order to predict the performance of adaptive array systems, the angle of arrival is very important information. Some recent papers have begun to address the angle of arrival. Lo and Litva [3] found that multipath arrivals tend to occur at varying angles indoors, but were not able to arrive at any conclusions based on their limited data. Guerin [4] collected angular and temporal data separately, but did not correlate the two. Wang, et al [5], used a rectangular array to estimate both the elevation and azimuth angles of arrival for major multipaths, but did not measure the corresponding time of arrival. Litva, et al, [6] collected simultaneous time and angle of arrival data, similar to the format of the data used in this paper. They came to the preliminary conclusion that it is possible to make accurate measurements of this type and learn more about what is happening in the indoor multipath channel. However, their experiment was not extensive enough to make any conclusions about the channel. This paper presents an extension to the Saleh-Valenzuela model which accounts for the angle of arrival. This is based on data that includes information about both the time and angle of arrival, presented in [7]. The Saleh-Valenzuela J model is explained, and the new data is discussed. Model parameters based on the new data are derived and compared to the parameters found by Saleh and Valenzuela at a lower frequency.
Abstract- Multiple antenna systems are a useful way of overcoming the effects of multipath interference, and can allow more efficient use of spectrum. In order to test the effectiveness of various algorithms such as diversity combining, phased array processing, and adaptive array processing in an indoor environment, a channel model is needed which models both the time and angle of arrival in indoor environments. Some data has been collected indoors and some temporal models have been proposed, but no existing model accounts for both time and angle of arrival. This paper discusses existing models for the time of arrival, experimental data that were collected indoors, and a proposed extension of the Saleh-Valenzuela model [1], which accounts for the angle of arrival. Model parameters measured in two different buildings are compared with the parameters presented in the paper by Saleh and Valenzuela, and some statistical validation of the model is presented. I.
INTRODUCTION
There have been many different approaches for overcoming the problem of multipath interference, both in outdoor and indoor applications. Some of them include channel equalization, directional antennas, and multiple antenna systems, each being more particularly suited to different applications. The use of multiple antenna systems can be particularly useful for indoor applications such as local area networks, because they allow the possibility of communicating with multiple users simultaneously over a single frequency band, increasing throughput and making efficient use of frequency spectrum. The signals from different antennas can be combined in various ways, including diversity combining, phased array processing, and adaptive array algorithms. Adaptive array sytems are becoming increasingly feasible for high bandwidth applications with continuing improvements in digital signal processors. In addition, the availability of new, higher frequency bands has made wireless networks an increasinly attractive and feasible option. The effects of multipath interference have been studied extensively in various outdoor scenarios. However, the study of the indoor multipath channel is relatively new. In order to be able to predict the performance of indoor communications systems, models are needed that accurately model the behavior of radio transmissions in indoor environments. Several other researchers have already collected various types of data on indoor mulipath propagation. The foundation for much of today's work was by Turin, et al [2], which was a study of outdoor multipath propagation in an urban environment. The first model for indoor multipath propagation was proposed by Saleh and Valenzuela
II.
THE SALEH- VALENZUELA MODEL
The model proposed by Saleh and Valenzuela is based on a clustering phenomenon observed in their experimental data. In all of their observations, the arrivals came in one or two large groups within a 200 ns observation window. It was observed that the second clusters were attenuated in amplitude, and that rays, or arrivals within a single cluster, also decayed with time. Their model proposes that both of these decaying patterns are exponential with time, and are controlled by two time constants: I', the cluster arrival decay time constant, and " the ray arrival decay time constant. Fig. 1 illustrates this, showing the mean envelope of a three cluster channel.
Reprinted from IEEE Vehicular Technology Conference, pp. 1415-1419, May 1997.
44
Crabtree Building, constructed mostly of steel and gypsum board. Each data set can be viewed as an image plot, with angle as one axis, and time as the second axis. A typical data set is pictured in Fig. 2. The images were processed to remove blurring effects so that the precise time, angle and amplitude of each major multipath arrival is known. The data collection and processing is discussed in greater detail in [7]. Visual observation of the data showed that clustering like that observed by Saleh and Valenzuela was present in the data. The nature of the clustering tended to follow the model of Saleh and Valenzuela quite well. In general, the strength of clusters tended to decay with increasing delay times, and arrivals within each cluster showed a similar pattern of decay. One difference from the Saleh-Valenzuela data is the higher average number of clusters per data set.
The impulse response of the channel is given by:
L L f3 00
h(t)
00
k Lb(t
- Tl
-
rkL)~
(1)
l==O k==O
where the sum over l represents the clusters, and the sum over k represents the arrivals within each cluster. The amplitude of each arrival is given by {3kl, which is a Rayleigh distributed random variable, whose mean square value is described by the double-exponential decay illustrated in Fig. 1. Mathematically it is given by:
(2)
{32 (T l , Tkl)
,82 (0, 0) e -
T 1/
r e-
Ik I / , ,
(3)
where {32 (0, 0) is the average power of the first arrival of the first cluster. This average power is determined by the separation distance of transmitter and receiver. The time of arrival is described by two Poisson processes which model the arrival times of clusters and the arrival times of rays within clusters. The time of arrival of each cluster is an exponentially distributed random variable conditioned on the time of arrival of the previous cluster. The case is the same for each ray, or arrival within a cluster. Following the terminology used by Saleh and Valenzuela, rays shall refer to arrivals within clusters, so that the cluster arrival rate implies the parameter for the intercluster arrival times and the ray arrival rate refers to the parameter for the intracluster arrival times. The distributions of these arrival times are shown in equations 4 and 5:
p(T1\T1- 1 ) p( TkL IT(k-l)l)
Ae-;\(T/-T/- 1 )
(4)
Ae-A(Tld-T(k-l)/) ,
(5)
IV.
NluLTIPATH PROPAGATION
In this section we propose a statistical model for the indoor multipath channel that includes a modified version of the Saleh- Valenzuela model, and incorporates an angle-ofarrival model. In addition, methods of estimating parameters from the data are discussed. A.
Time of Arrival
The time and amplitude of arrival portion of the combined model is represented by h(t) in equation (1), where, as before, {3~l is the mean square value of the kth arrival of the lth cluster. This mean square value is described by the exponential decay given in equation (3) and illustrated in Fig. 1. As before, the ray arrival time within a cluster is given by the Poisson distribution of equation (5), and the first arrival of each cluster is given by T l , described by the Poisson distribution of (4). The inter-ray arrival times, Tkl, are dependent on the time of the first arrival in the cluster Tl · In the Saleh-Valenzuela model, the first cluster time T 1 was dependent on To which was assumed to be zero. With the estimated parameter in [1] of 1/ A ~ 300 ns, the first arrival time will typically be in the range of 200 to 300 ns, which is a reasonable figure. However, a problem with this was found when the A parameter in the new data was discovered to be very low, but the delay time to the first arrival was often still on the order of 200 ns. Under the Saleh-Valenzuela model, this would make any long delays which would occur at larger separation distances between transmitter and receiver highly improbable. To remedy this problem, it is proposed that To be the line of sight propagation time:
where A is the cluster arrival rate, and A is the ray arrival rate. In their data, Saleh and Valenzuela did not have any information on angle of arrival, and assumed that the angles of arrival were uniformly distributed over the interval
[0,271').
Other indoor multipath models have been proposed, such as the model proposed by Ganesh and Pahlavan [8], but they will not be discussed here. The data used in this paper fit the Saleh-Valenzuela model well, and as a result the model was chosen as the basis for the extended model presented here. III.
A PROPOSED TIME/ ANGLE MODEL FOR INDOOR
EXPERIMENTAL DATA
In order to analyze and model the indoor multipath channel, a data gathering apparatus was designed which was able to take simultaneous measurements of the time and angle of arrival. The frequency band was from 6.75 to 7.25 GHz. Using the system, a total of 65 data sets were collected in two buildings on the Brigham Young University Campus. In the Clyde building, a reinforced concrete and cinder block building, 55 data sets were collected. For comparison, ten additional data sets were collected in the
To
r , c
(6)
where c is the speed of light, and r is the separation distance. This allows for the time of the first arrival to be more directly dependent on the separation distance.
45
B.
Angle of Arrival
D.
It will be assumed that time and angle are statistically independent. If there were a correlation, it would be expected that a longer time delay would correspond to a larger angular variance from the mean of a cluster. This was not observed in the data, so at this point an assumption of independence is reasonable, but further study of the correlation structure may be warranted. The consequence of this independence is that the complete impulse response with respect to both time and angle, which we will call h( t, B), becomes a separable function:
h(t, B)
~
h(t)h(B).
The extended model for h(t, B) is useful for analysis or simulation of array processing algorithms that might be used in an indoor environment. In order, for example, to conduct a Monte Carlo simulation of an array antenna processor, it is necessary to generate a random channel using the statistical model. This section outlines the procedure for doing so. The first step is to choose the transmitter/receiver separation distance r, which can be chosen either randomly or arbitrarily. Knowing T, the next step is to determine {32 (0, 0), the mean power of the first arrival, which is given by
(7)
As a result, h(B) can be be addressed separately from h(t). We propose an independent angular impulse response of the system, similar to the time impulse response of the channel given in 1:
LL 00
h(B)
(10) where G(lm) is the channel gain at r == 1 meter, and Q is a channel loss parameter. , and B are respectively the ray decay parameter and ray arrival rate in the model for h(t). Equation (10) is derived and the characteristics of Q in the indoor environment are discussed in greater detail in [1]. After 13 2 (0, 0) is determined, the next step is to determine the cluster and ray arrival times. The corresponding distributions are given in equations (4) and (5), where To == r / c. After the times are determined, the mean amplitudes /3 kL are determined by equation 3. The actual amplitudes for each arrival, f3kl, are determined by sampling a Rayleigh distribution whose mean is ,Skl. The angles are determined by first randomly choosing the cluster angles, which are uniforrnly distributed from 0 to 21r. Relative ray angles are then determined by sampling a Laplacian distribution as given in equation (9).
00
fJkl c5 (O- 8l - Wkl),
(8)
l==O k=:.O
where, as before, f3kl is the ray amplitude for the kth arrival in the lth cluster, given in equations (2) and (3). 8 l is the mean angle of each cluster, which is distributed uniformly on the interval [0, 21r). We propose that the ray angle within a cluster, Wkl, be modeled as a zero mean Laplacian distribution with standard deviation a:
p(B)
(9)
The correlation of these distributions to the data is shown in the next section.
c.
Using the Model
Parameter Estimation
v.
This section outlines methods of deriving the distributions and estimating the parameter a given in the previous section. The distribution parameters of the cluster means, 8 l , is found by identifying each of the clusters in a given data set. The mean angle of arrival for each cluster is calculated. In order to remove the specific room geometry and orientation, the first arrival (in time) for each data set is taken as the reference. The relative cluster means are calculated by subtracting the mean of the reference cluster from all other cluster means. To estimate the distribution of cluster means over the ensemble of all data sets, a histogram can be generated of all relative cluster means, disregarding the first clusters (since their relative mean is always 0). The procedure to estimate a is similar. The cluster mean is subtracted from the absolute angle of each ray in the cluster to give a relative arrival angle with respect to the cluster mean. The relative arrivals are collected over the ensemble of all data sets, and a histogram can be generated. Using a least mean square algorithm, the histogram is fit to the closest Laplacian distribution, which gives the value for G'.
IvloDEL PARAtvlETERS FROM THE DATA
The intercluster time decay constant, I', was estimated by normalizing the cluster amplitudes (the amplitude of the first arrival) so that the first one had an amplitude of 1 and a time delay of O..A.lI of the cluster amplitudes were superimposed as shown in Fig. 3. The estimate for r was found by curve fitting the line (representing an exponential curve) to minimize the mean squared error. The values for rand , were estimated for both buildings in a similar manner. In this particular example, the fit is less than ideal, but it was better in the other cases, especially when there were more data points. In their data, Saleh and Valenzuela did not have exact amplitudes available, and as a result were not able to use curve fitting or generate plots as in Fig. 3. Their parameters were as a result very rough estimates, but they did observe the same general decay trend as in this data, which supports the exponential decay model. The Poisson parameters, A and A, representing the intercluster and intracluster arrival rates were estimated by subtracting each arrival time from its predicessor to produce a set of conditional arrival times p(TklIT(k-l)l). The
46
parameter
r !
l/A 1/),
a
Clyde Building 33.6 ns 28.6 ns 16.8 ns 5.1 ns 25.5°
Crabtree Building 78.0 ns 82.2 ns 17.3 ns 6.6 ns 21.5°
rive than the first arrival in the cluster, and are usually attenuated relative to this first arrival. The amplitudes of clusters and rays within clusters both follow the same pattern of exponential decay over time observed by Saleh and Valenzuela. The differences in model parameters are likely due to the difference in frequency (Saleh and Valenzuela used 1.5 GHz). The other discrepancy is in the markedly faster cluster arrival rate, which is most likely explained by the larger overall number of clusters resulting from a more sensitive data gathering apparatus. The model parameters for the Clyde and Crabtree Buildings were in general very similar. The most notable exception is the extremely slow amplitude decay of rays within a cluster in the Crabtree building. In general, the model seemed to be able to accurately describe the differing multipath characteristics in both buildings, regardless of their very different construction. This implies that the model could possibly provide a general representation for many different types of buildings, and model parameters could therefore be found for other types of buildings. The angle-of-arrival model presented here, though yet unconfirmed, is a strong alternative to only previous option for simulation: random assignment of angles or guessing at the anglular properties of the channel. The rnost important area for continued research is applying the model for its intended purpose-comparison of array processing algorithms. This can be done either by mathematical analysis or Monte Carlo simulation. A mathematical analysis is likely intractible due to the large number of variables in the model, but the model can be a very useful tool for the generation of random multipath channels for simulation.
SalehValenzuela 60 ns 20 ns 300 ns 5 ns
Table 1. A comparison of model parameters for the two buildings and from the Saleh-Valenzuela paper [1]
probability distribution of these with the best fitting pdf (for the Clyde Building) is shown in Fig. 4. Fig. 5 shows a CDF of the relative cluster angles for the Clyde Building, illustrating the relatively uniform distribution of clusters in angle. The same was true in the Crabtree Building. The distribution of the ray arrivals with respect to the cluster mean is shown in Fig. 6. The sharp peak at the mean is characteristic of a Laplacian distribution. The superimposed curve is a Laplacian distribution that was fit by integrating a Laplacian PDF over each bin, and matching the curves using a least mean square goodness of fit measure. The Laplacian distribution turns out to be a very close fit in both buildings. Table 1 shows a comparison of the model parameters estimated for the Clyde Building, the Crabtree Building, and those estimated by Saleh and Valenzuela from their data. The most obvious discrepancy is in the estimates for the value of A. This is due to the fact that there were significantly more clusters observed in both the Clyde and Crabtree buildings compared to an average of 1-2 clusters observed by Saleh and Valenzuela. This may be partly due to the higher RF frequency, but the more likely cause is the ability of our testbed to see clusters that were close together in time, but separated in angle. Another interesting phenomenon is that r is very low in the Clyde Building, and ! is larger than r in the Crabtree Building, meaning that the Clyde Building tends to attenuate more than the Crabtree Building. The values of a were close in both buildings, and there is no precedent for comparison with other data.
VI.
REFERENCES
[1J Adel A. M. Saleh and Reinaldo A. Valenzuela. A statistical
[2] [3] (4]
CONCLUSION
Many aspects of the model have plausible physical explanations. Because an absolute angular reference was maintained during the collection of the data, it was possible to compare the processed data with the geometry of each configuration. The strongest cluster was almost always associated with the direct line of sight, even when there were walls blocking the line of sight path. Apparent causes of weaker clusters were back wall reflections and doorway openings. It is likely that each cluster corresponds to a major path to the receiver, and the arrivals within each cluster are likely the result of smaller, closely associated objects that are part of a very similar group of paths to the receiver. These paths will take slightly longer to ar-
(5] [6]
[7]
[8]
47
model for indoor multipath propagation. IEEE Journal on Selected Areas of Communications, SAC-5:128-13, February 1987. George L. 'Turin et al. A statistical model of urban multipath propagation. IEEE Transactions on Vehicular Technology, VT21(1):1-9, February 1972. T. Lo and J. Litva. Angles of arrival of indoor multipath. Electronics Letters, 28(18):1687-1689, August 27 1992. Stephane Guerin. Indoor wideband and narrowband propagation measurements around 60.5 ghz. in an empty and furnished rOOID. In IEEE Vehicular Technology Conference, pages 160164, 1996. Jian-Guo Wang, Ananda S. Mohan, and Tim A Aubrey. Anglesof-arrival of multipath signals in indoor environments. In IEEE Vehicular Technology Conference, pages 155-159. IEEE, 1996. John Litva, Amir Ghaforian, and Vytas Kezys. High-resolution measurements of aoa and time-delay for characterizing indoor propagation environments. In IEEE A ntennas and Propagation Society International Symposium 1996 Digest, volume 2, pages 1490-1493. IEEE, 1996. Quentin Spencer, Michael Rice, Brian Jeffs, and Michael Jensen. Indoor wideband time/angle of arrival multipath propagation results. In IEEE Vehicular Technology Conference. IEEE, 1997. R. Ganesh and K. Pahlavali. Statistical modeling and computer simulation of indoor radio channel. lEE Proceedings-I, 138(3):153-161, June 1991.
10' ~--r--~--r--.,--~--r--.,..--~--r--.,..---,
10
time
F ig. 1. An illust ra t ion of ex p on entia l decay of me an cluster pow er and ray power within clusters
15
20
25
30
delay(ns)
35
40
45
so
F ig. 4. C O F of Relative Ar r ival T imes W ith in C luste rs in the Clyd e 5 .1n s) Bu ild ing (1/.\
=
00014 0.9 0.8 0.7 0.6
E0.5
x
/
0 .4
0.3 0.2
50
1SO
200
angle (degrees)
2SO
300
350
F ig. 5. COF of relative mean cluster a n gles in t he C lyde Bu ild ing wit h resp ect to the fir st clu ster in each set
F ig . 2. A typical raw data set
10'
100
/'
,r
0.12
.-----...-----.,----~---~---~---, x
0.1
10' O.OB 0
~
~ 0.06
..
'0
0.0'
0.02
x
x x
0 - 200
x 10-' L----'------'----'~--'---~~---_'c:_--:!.
a
20
40
60
relative delay (ns)
80
100
120
-1 50
- 100
100
150
F ig . 6. Histogram of relat ive ray arrivals with respect to the cluster mean for the Clyde Building. Superimposed is the best fit Laplacian d istribution (IT = 25 .5°) .
F ig . 3. Plot of normalized cluster amplitude vs, re lative delay for the Clyde Building, with the curve for r = 33 .6 ns superimposed.
48
Chapter 2 Adaptive Algorithms
O
F paramount importance for an adaptive antenna is the manipulation of the signals induced on its elements. Two overview papers on array processing set the scene at the beginning of this chapter and provide the reader with valuable background information on many signal processing issues related to adaptive antennas. They provide a comprehensive and detailed treatment of different beamforming methods, adaptive algorithms to adjust the weights of the antenna array elements according to some optimization criterion, and direction of arrival methods. Some of the adaptive methods that are included here are conventional beamforming, conjugate gradient, least
squares, recursive least squares, linear prediction, maximum likelihood, maximum entropy, minimum norm, constrained optimization, spectral estimation and eigenstructure methods, weighted subspace fitting, and well-known algorithms such as MUSIC (multiple signal classification), ESPRIT (estimation of signal parameters via rotational invariance techniques), SCORE (spectral self-coherence restoral), and MVDR (minimum variance distortionless response). Also, among the topics presented in this chapter are issues related to some of these algorithms, such as spatial smoothing and the estimation of the number of signals impinging on the antenna array.
49
Celebrating a Half Century of Signal Processing
Highlights of Statistical Signal and Array Processing
U
of SSAP . To provide readers with pointers for further study of the field, this article includes a very impressive bibliography-close to 500 references are cited. This is jusr one of the indications that the field of statistical signals has been an extremely active one in the signal-processing community. This article also introduces the recent reorganization of three technical committees of the Signal Processing Society. During the reorganization, the SSAP, Digital Signal Processing, and U nderwater Acoustics Signal Processing technical committees were restructured to form three new committees : Signal Processing Theory and Methods, Signal Processing for Communications, and Sensor Arrays and Multichannel Signal Processing. After the reorganization, research topics that used to belong to the SSAP TC are now distributed to the three new TCs. Therefore, although the name "SSAP'~ does not exist anymore, the research activities related to it have been given a new life and will continue to thrive in the Signal Processing Society . . Now, let me invite you to enjoy this article, which will give you a quick but comprehensive tour ofthe highlights of statistical signal and array processing.
nlike most other technical committees ofthe Signal Processing Society, which deal with signals of deterministic nature and process signals one at a time, the Statistical Signal and Array Processing (SSAP) Technical Committee deals with signals that are random and processes an array ofsignals simultaneously. This issue features the SSAP-TC's contribution to the Anniversary series, which covers this spedal field ofrandom signals and array processing. The field of SSAP represents both solid theory and practical applications. Starting with research in spectrum estimation and statistical modeling, study in this field is always full of elegant mathematical tools such as statistical analysis and matrix theory. The area of statistical signal processing expands into estimation and detection algorithms, time-frequency domain analysis, system identification, and channel modeling and equalization. The area of array signal processing also extends into multichannel filtering, source localization and separation, and so on. Work in SSAP areas has already made an impact in a large variety of applications, ranging from communication and radar/sonar processing to many medical imaging technologies, and even econometrics. This article represents an endeavor by the members of the SSAP -TC to review all these significant developments in the field
Tsuhan Chen) Guest Editor Carnegie Mellon University
Reprinted from IEEE Signal Processing Magazine, Vol. 15, No.5, pp. 21-64, September 1998.
51
any engineering applications require extraction ofa signal or paranleter of interest from degraded measurements. To accornplish this it is often useful to deploy fine-grained statistical models; diverse sensors that acquire extra spatial, temporal, or polarization information; or multidimensional signal representations, e.g., time-frequency or time scale. When applied in combination these approaches can be used to develop highly sensitive signal estimation, detection, or tracking algorithms that can exploit small but persistent differences between signals, interferences, and noise. Conversely, these approaches can be used to develop algorith111s to identity a channel or svstem producing a signal in additive noise and interference, even when the channel input is Un1Gl0\Vn but has known statistical properties. Broadly stated, the statistical signal and array processing (SSAP) area is concerned with reliable estimation, detection, and classification of signals that arc subject to random fluctuations. Opening a recent issue of the IEEE Transactions on Siqnal Processinq to a SSAP paper the reader will probably see one or more of the following: (1) description of a mathematical and statistical model for measured data, including models tor sensor, signal, «.111d noise; (2) careful statistical analysis of the fundamental limitations of the data including deriving benchmarks on performance. e.g., the Cramer-Rao , Ziv-Zakai, Barankin, Rate Distortion, Chernov, or other lower bounds on average estimator/detector error; (3) developruent of mathcrnaticallv optimal or suboptimal estimation/detection algorithms; (4) asymptotic analysis of error performance establishing that the proposed algorithm C0111CS close to reaching a benchmark derived in (2); and (5) simulations or experiments that C0111 pare algoritlun performance to the lower bound and to other competing algorithnls. Depending on the specific application, a SSAP algorithm nlay also have to be adaptive to changing signal and noise environments. This requires incorporating flexible statistical models, implementing low-complexirv real-time estimation and filtering aIgorirhrns, and on-line performance monitoring. Until recently the statistical signal and array processing area was cover~d by the SSAP Technical COlllnlitte~, which grew out of the Spectrum Estimation and Modeling Technical Committee (discontinued in 1991). At ICASSP-98 in Seattle, an administrative restructuring took place that eliminated the SSM, Digital Signal Processing (DSP), and Underwater Acoustics Signal Processing (UASP) Technical Committees, replacing them by three new C0I11111ittees: Signal Processing Theory and Methods (SPTM), Signal Processing for Cornmunications (SPCOM), and Sensor Arrays and Multichannel signal processing (SAM). The SSM areas described in this article have migrated to these new Technical C0I11rnittees and remain very active within the Signal Processing Society. In particular, the following workshops sponsored or co-sponsored by SSAP will continue to pro-
SSAP TC ~Jiernb~:r'i (as of 1\;1ay 199B) Alfred O. Hero III (SPTiVl), University of .Micliiaa», ~41111 Arbor (clutinnnn) Gcorgios R. Giannakis (SPCONl), University oj' Vi1Xfinia (picc-cIJai17J'/I.17J) Moeness Amin (SPTM), Villanova University Kevin Bucklev, Villanova Uuivcrsitv . Jcan- Francois Cardoso (SPTiVl), Eeoll' Natunutlc SlJPt~l'iCtJ1"C des Telecommunications Zhi Ding (SPCONl) ~ Auburn University Petar M. Djuric (SPTNl), State University OJ'NL1P York at Stonv Bl'()o/~ Hamid Krim (SPTM),NortlJ CarolinaStttte University Jeffrey Krolik (SAiVI), Duke University ., Fu Li, Portland State University Hugit Messer-Yaron (SP'fM), Tel-Aviv University Eric Moulines (SPTM)., Ecolc Natuntalc S1Jplrit:1~rc des Tclcconnnunications Arve Nchorai (SAM), Univ. oiIllinois at Chicano L(;uis Scharf (SPTi\tl), University 0f'(:olorndo, Boulder Ananthr arn Swami (5 PCONl), Artnv RCJcnn:1J Lf1b01'nt01~Y
A. Lee Swindlehurst (SPCONl), Briaham YOtHl1T Univcrsitv . ''David J. Tho111S0n (SPTM), Lucent Tcclmolo..n. ics [itcndra Tugnait (SPCOlVl), Auburn University Raghuvccr M. R.~10, Rochester Just. ojTcclmolo..C. f.Y Lang Tong (SPCO.t\tl)., Cornell University Mats Vibcrg (current Vice-Chair SPTM), Clmlnters University ()j'Tlx!J1l(}lo.!.~11 Mati \V~LX, Rnjhel, Israel (SANI) Guanghan Xu (SPCONl), Thc University oj'Tc.,\;(fs at Austin Michael Zoltowski (SPCOM), Purdue University (nell' 1,(~ affilintiollS
ill parc1lthesis';
based on rcstructurnut arc indicated
vide forums for researchers in the area: the Workshop on Higher Order Statistics (to be held in Caesaria, Israel, in 1999 (http://sig.ensr.ti-/-hos99)), the Workshop on Statistical Signal and Array Processing (to be held in the Poconos, Pennsylvania, in 2000), and the Workshop on Signal Processing Advances in Communications (to be held in Annapolis, Maryland, in 2000). Similar to other Technical Committees, SSAP ran workshops, recommended paper awards, and reviewed papers for ICASSP. To facilitate the paper review process and provide focus for award nominations, the scope of SSAP was divided into several subareas, called "'SP EDICS" categories. These categories were spectral analvsis; higher-order statistical analysis; cyclostationary signal analysis; statistical multichannel filtering; statistical modeling; paranleter estimation; detection; performance analysis; system identification; computational aJgorithms; and applications. These categories are covered in this article and continue to be represented in the aggregated EDICS of the SPTM, SPCOM, and SAM Technical Committees,
52
As the reader will see from this article, SSAP impacts a very wide range of applications. Among the applications mentioned in the sequel are: radar signal processing; sonar signal processing; geophysics and climate; radar and optical remote sensing; electrocardiography (ECG); electroencephalography (EEG); nlagnetoencephalography (MEl~); nuclear magnetic resonance (NMR) inlaging; radio-isotope inlaging (PET and SPECT); chemical sensing of the environment; physical oceanography; fractal internet traffic modeling; astronomy: biology; economctrics; speech; and TI1LlSic analysis/synthesis. Over the past several years the application of signal processing to communications has become a prevalent theme in SSAP. The pre-existence of many relevant core SSAP areas made communications a very ripe applications area. In particular, research in cyclostationaritv, higher-order statistics, and systenl identification was a springbuard to the development of novel methods for channel equalization in digital communications. Likewise, work in detection and estimation led naturally to iterative multiuser detection, source separation, and high-performance modulation classification algorithnls. As another example, deployment of phased antenna arrays and the associated signal processing has spearheaded 11111Ch recent activity in spatial diversity reception tC)1wireless communications. The sections by Giannakis, Tong, and others highlight some of these cornmunications applications of SSAP. Our article begins with a group of two sections on recent developments in detection/estimation algorithms written by Alfred Hero and Pctar Djuric, respectively. The section by Hero focuses on two areas of significant activity: constant-false-alarm-rate (CFAR) detection and iterative maximum-likelihood (ML) paranleter estimation using the expectation-maximization (EM) algorithnl. The section by Djuric describes the emerging area of Bayesian signal processing including estimation, detection, tracking and Monte Carlo Markov chain (MCMC) sampling, which is a technique that was largely impractical before the current generation of high-speed conlputers. The article continues with J section on time-delay estimarion written by Hagit Messer and Jason Goldberg and a section on multiwindow spectral estimation by David Thomson. From a historical perspective, time-dclav esrimarion and spectral estimation are two of the oldest areas of statistical signal processing, dating back at least to the late 19th century (see [42 J), yet they remain two of the most active areas today. Continuing along these lines are sections on the increasingly important problems ofdetection and estimation in the time-frequcncv domain, written by Moeness Arn i n , and the time-scale or rnultiresol ution domain, written by Hamid Krirn and Jcan-Christophe Pesquet. Next comes a section written by Georgios Giannakis on recent SSAP activity in channel estimation and equalization tor digit,-11 communications. This is followed by t\VO sections dealing with the critical problems of model-
The fundamental theory behind detection, classification, and estimation has its home in mathematical statistics and decision theory. ing, systenl identification, and the often overlooked area of data validation. Ananthram Swami starts off with a broad overview of non-Gaussian measurement models and higher-order statistical methods, followed by a section by [itendra Tugnait on advances in multichannel systenl identification and testing random processes for non-Gaussian or nonlinear behavior. These are followed by a section written by Arye N chorai on exciting opportunities in SSAP due to recent advances in sensor technology. Finally, the article turns to array signal processing with four sections written by Lee Swindlehurst, Jeff Krolik, Iean-Francois Cardoso, and Lang Tong, respectively. Swindlehurst provides a bird's-cvc view of sensor-array processing and its applications to source local ization, source separation, and channel estimation. Cardoso tallows up with a section focusing on developments in blind-source-separation algorithlTIs. Tong discusses the increasing importance of blind-source separation and diversity in multiuser communications systenlS design. The final section, written by Krolik, discusses the use of C0111putational propagation models for processing sonar and radar arra v data. It is essential to point out that) in a limited overview article such as this, one cannot possibly do justice to the large number of areas that comprise SSAP. Neither can we hope to cover but a fraction of the contributions of individuals who have had a role in the development of SSAP through the years. We offer our sincere apologies to iU1Y individuals who feel omitted from this overview. WWW links relevant to the area oj-'S~/!I): A The (old) SSAP horne page: http.z/www .eng. J.U btl r11. edu/- d ing/SSAP/ SSAP .h rml .. A database of "selected papers" that appeared in the
IEEE Transactions on Signall)1!"occssin4...1J 1988-1995:
http r//www .eng. au bu rn. cdu/- d ing/SSAP /1ntp. html The SPTM'l SPCOM and SAM Technical C0111111ittee horne pages can be accessed through the IEEE Signal Processing Society home page: http://www .ieee.org/sociery/sp/inclex.ht1111 A. A clearinghouse for information on lnany aspects of signal processing is the Signal Processing Information Base at: http://sPi b. rice.edu/sp i b.htrnl A. S0I11e other web pages of interest to those working in SSAP: -The IEEE Societies on Computers, Antennas and Propagation, Communications, Aerospace and Electronic Svstems, Information Theory., and the IEEE NeuA
53
ral Network Council, all have SSAP related activities and links can be found on the IEEE page:
hypothesis testing [227], invariant hypothesis testing [287J, and the generalized likelihood ratio (GLR) test [205J. For lack of space we fOClIS only on CFAR detection using the min-max, GLR, and invariant testing approaches. We regretfully must omit work in adaptive detection for assumed known noise backgrounds, nonpararnetric techniques, distributed detection, Huber robust detection, sequential detection, signal classification, and detection of number of signals. Min-max CFAR hypothesis testing seeks to maximize detection probability subject to a constraint on maximum false-alarm rate. The min-max approach was recently adopted in [20] and [21] in the context of simultaneous detection and classification of multiple signals. This produced optimal detectors that took the form of a weighted likelihood ratio (LR) test. It was also shown in [20] that this min-max CFAR test implicitly implements J variant of Rissanen's maximum data length (MDL) signal selection criterion, establishing that MDL is ruin-max optimal. It is sometimes possible to arrive at min-max optimal detectors through the method of similar tests [366]. Finally, the min-max CFAR optimal detector can be viewed from the point of view of Bayesian detection implernented with a least favorable prior on the unknown noise density. Thus, in principle, the Bayesian methods developed in [119], [30], and more recently in [61], call be manipulated to provide CFAR tests. In n1any cases direct min-max optimization is diffi..:ult, and simpler suboptimal CFAR alternatives are ofinterest. The conceptually simplest approach is the GLR "estimate and plug" procedure, which requires computing ML estimates for the unknown noise paranleters. In [204J the GLR principle produced an adaptive detector for detecting spatio-temporal signals or targets in Gaussian noise with unknown spatial covariance. A different GLR adaptive target detector was derived in [57] for the case of optical images, The Gl.R for a general multichannel measurement was derived in [205], which specializes to the cases derived in [204] and [57] by applying suitable coordinate transformations. A related and important result was presented in [333] where exact confidence regions for the Gl.Rvmaximizing signal vector were derived for unknown spatial covariance. Additional applications of the GLR strategy to multispectral infrared images were presented in [330J and [464J. In [48] the GLR test was applied to arbitrary subspace projections of the data under similar assumptions as [205]. Other notable CF AR applications of GLH.. have appeared in the following areas: signal detection in noise of slowly fluctuating power [100]; transient signal detection in Gaussian noise of unknown power [316]; signal detection in unknown Gaussian-Gaussian mixture noise [39J; colored autoregressive noise [202, 367]; spatia-temporal signal detection in Gaussian noise with unknown spatial covariance [120, 266, 341]; signal detection in unknown i m pu ls i ve noise [59]; rnultiwindow/Gl.R sinusoid detection [187, 296]; tests
http://\vvv\v.ieec.org/tab/clll"_sub_soc_sub_bps.htll1l
-The American Statistical Association: http://vvv./\,,.amstat.org/
-The Institute of Mathematical Statistics: http://vvvvVY'.inlstat.org/
-The International Association for Statistical Computing: http://\Vw\v.stat. un ipg. it/iasc,htm 1 -The Royal Statistical Society: http://ll1aths. ntu.ac.uk/ rS5/ index2. html -The Acoustical Society of America: http://a~a.aip.org/
-The International Union of Radio Science: http://V~l'vV\v.il1t<.:c.rug.ac.bc/Research/Projects/ 11rsi/wc leo III e. hrrnl
-The Institution of Electrical Engineers (Uk): http://v./'vV\V.ice.org.l1 k/Wc leo111e.html
Advances in Detection and Estimation Algorithms for Signal Processing Alfred Hero, University oj'Michtqan The fundamental theory behind detection, classification, and estimation has its horne in mathematical statistics and decision theory [109, 227]. In the context of statistical signal processing one Blust also contend with additional constraints: the exceedingly large size of signal-processing datasets; the absence of reliable and tractable signal models; the associated requirement of fast algorithnls; and the requirement of real-time unsupervised algorirhms. Two statistical signal-processing areas will be discussed in this section: algorithms for robust CFAR detection, and advances in iterative para111eter estimarion using the EM algorithm. CFAR Detection One of the most challenging problems in automated target detection and recognition is reliable detection of targets in high clutter backgrounds. When the clutter statistics are unknown or highly variable, the false-alarm rate of classical detection algorithms, e.g., the matched filter, cannot be controlled and target detection decisions become unreliable. The reason for this is lack of robustness of the test statistics to clutter variations. The objective of CF AR detection is to produce a test statistic whose probability distribution does not depend on the unknown noise paran1eters, e.g., noise power or clutter spectrum, while ensuring a high probability ofsignal detection. Such a detector is also sometimes referred to as a noise-adaptive detector. For such a test statistic the detection threshold can be set to guarantee a prespecified false-alarm rate. There are a wide range ofdifferent strategies available for designing CF AR detectors including: min-max hypothesis testing [109], similar and unbiased
54
uf signal paranlcters
f()t- cases where direct maximization is intractable. While the origins of the algorithn1 are decades older, it was only after the unified overview by Dempster, Laird, and Rubin (1) LR) [89] that the wide applicability of the EM algorith111 became recognized. Twcnrv vcars after DLIZ published their paper Meng and Van i)'vl, [265 -j published an update which cogently described" the considerable recent advances in the EM algorithm. A review OfS0111e signal-processing applications of EM recently appeared in this 111agazine l273]. Here we will focus on important developments that were not covered in [273]. The intuition behind E.L\1 is simple to state. Based on an observation, y, it is desired to maximize the log-likelihood I" (8) = In }'y (.1'; 8), over an unknown paramcter, 8. However, either due to missing data or to a complicated torrn ofrhe log-likelihood, one ~voLll.d 11111Ch rat h c r In a x i In i z c the s i III P1c rIo g -11 k e 11 h 0 0 d , 1.\ (8) = In /'x (x; 8) , of a more informative data san;~lc X, called the "complete data.' As the complete data, X, IS not available one strikes a C0L11pr0111ise by iteratively maximizinj; the best estimate of the simpler log-likelihood given )rand the previous estimate of 8. Here the "best esti111ate " is the 011C that minimizes mean-squared error: the conditional mean. Rcmarkablv, this simple recipe leads to an algorithnl that has I11al1V attractive properties such as stabl~ C( Hlvergence, nl011()t~)l1e increasing likelihood, and tlcxiblc implementation. One of the first signal-processing applications of EM after D LR appeared was to the problem of emission tom: )graphy [372] and shortly thereafter to transmission t01110graphy [221 J. M~lIlY follow-up papers appeared on this topic in the ll1edical-inlaging cornrnunitv (see, e.g. [11°1 for a partial list) before the EM algorithnl was applied to other signal-processing pr~)blcnlS su~h as para111eter estimation for multiple superimposed SIgnals [106, 1(7) and direction finding [271]. Wide adoption of the EM algorithnl was hindered by its disappointingly slow conversrcncc speed. Efforts to improve the convergence LJ of E1\1 include: Aitken's acceleration [247J; over-relaxation [2291, conjugate gradient [180, 196]; Newton methods [38; 262J; quasi-Newton methods [220]; and ordered subsets EM (OSEM) [178]. Unfortunatelv, these methods do not automatically guarantee the monotone increasing likelihood property of standard EM, leading to the additional burden of monitoring the iterations for instability [222 J. It has been cstablis"hed that the EM algorithnl COI1verg e s fo r b 0 U 11d e dun i 1110 d all 0 g 1ike 1i h 0 0 d Lv (8)= In f y (y;8) [461]. When the likeliho(~d function is nvice ditferentiable the asyn1ptOtlC speed of convergence of the EM algorithnl is proportional to the In~L\:i~11U~1 eigenvalue of [F.\. JF.~' [89]. Here F = --:-V-/)'.(8) 21 and F.\, = E H [-V x (8) Iy ,8] are the observ~d Fls~er, 111fornlatioll 111atrices eV3-luated at the ML eStl111ate 8. Furthern10re, in [165 J the l'no1'loto1Jic rate ojcOnJJC1J}CnCe of EM \vas shown to be eq ual to the 111atrix l2 l1orn1
for presence ot'cvclostationarv signals [821 ~ and dctccrion of sampled signals having sarnpliru; jitter r 371]. When the GLR is intractable, e.g., tor non-Gaussian si~nals, and the noise covariance is !(lHJ\Vn up to a scale El~tor, (~FAIZ tests have been proposed based on 111~Lxi miziru; alternative criteria such as: deflection or contra~t [102, 3101; circular correlation coefficient tor sinu~()ld detection [300] ~ and c(.hcrcncc [125 I and generaltzed coherence [68] for multichannel sign~11 detection. C~F ~R detectors have also been derived based on SUIll111ary stattstics such as: order statistical filter outputs [4521, hiuher-ordcr soectra [167, 209]; marched-filter multib r plc-correlation lag products [134J; _\tvei~htc~i subspace fitting residuals [444]; and adaptive tIlterIng followed ~)~' subspace projections [2281. finally, when the noise covariance matri x is Ul1kI10\Vn, CfAl:z. detection has been proposed using 111Jxi111Ul11 signal-to-noise ratio (SNH.. ) criteria and covariance estimates [101:1; group delay statistics [231]; integrated-bispectru111 non-Gaussianitv tests [428J (corrections in [429J); and higher-order CU111111~1l1ts [140, 345; 346]. One of the main justifications of the (; LJZ principle is its asymptotic optimalitv under broad conditions, e.g .., [200, 201 J. However, there are two factors that can make the (~LIZ test unworkable in applic~.ltions: I) the G LJZ mav not be ofclosed form when the clutter covariance: has special structure, e.g., block diagonal; 2) use of the G LR principle entails a loss in cfficicncv [206, 331 J which ~~ltl severely impact finite sample perf irmancc. An alter11at~1ve that can frequently lead to better finite sample pertormancc is the application of the princi pie of invariance [3551., also called exact robustness [192 l The method of invariancc involves expressing uncertainty in the unknown clutter covariance as resulting from set (;r algebraic actions on the image by an appropriate group of transformations. Once the uncertainty has been ~lapped to group actions, one can often identity statistics whose statistical distributions are functiouallv invariant to unknown noise paran1eters yet entail minimum loss of target discrunination capability. On the basis ofth~se statistics; optimal CF AIZ likelihood ratio tests can often be specified. These statistics are called "maximal inv.irianrs." and the resultant LIZtests arc called CFAIZ invariant tests. Manv simple examples exist for which invariancc principles give CFAR tests with higher power than the G~R test (for a simple but nontrivial example see [227, Ex. 6.18]). Despite the difficulty in finding maximal invariants and their statistical distributions the pavotf f()r the extra effort in signal-processing applications can be high [35, 36, 354, 357, 356J, \vhere often the inv~lrial~t LI~ test si bl T l1 ific:UltlV the G LJZ or ~lpproxl. outnert<JrtllS r 111ate (~LIZ test.
!y
The EM Algorithm for Parametric Estimation EM algorithnl has generat~d nluch recent interest i~1 the signal-processing C0111111unity due to its ability ~() rehably C0111pute iterative NIL ~lnd ptnalized-MI" estl111ates
1~he
55
y
gencc to the global maximum for anv initialization. On
In the statistical community the use of priors has been a controversial subject for many years.
~he other hand, the deterministic ll1etl~od of Chretien and
Hero [63] was developed for uondiffer entiable nonconvex likelihood functions and iteratively approximates the ML estimate via cutting plane methods, specifically proximal point iterations with Kullback- Liebler penalty. When the relaxation paranleter in the proximal point algorithm is equal to one, this method reduces to the standard EM algorithm. Bv decreasing the relaxation paran1cter towards ~ero, a 11101~e rapidly convergent ~llg() rithm is obtained, all the while preserving the monotonic likelihood property.
IIFJ~ I<~ [F x - F y ] F.~ I! II. Thus, the speed of convergence of the EM algorithm increases as the complete data, X, beC0111e less informative; i.c., as F.\' approaches F y and X gets closer to the actual measurements, y. However, there is
J
tradeoff between speed of convergence and imple-
A WWW link to the author oj~ the above section: http://\V\V\V .eecs.umich.cdu/-- hero/hero. htrnl
mentation complexitv: the NI step of the standard EM '.1.1gorith111 usually becomes 111()re difficult as X becomes less
informative. It was discovered by Fessler and Hero [ 110] that this tradeoffcan be eased bvrcformulation of the EM algorithm with "hidden data" .sets, which are less inforrnative than complete data sets and which can vary at each iteration. This led to the "space alternating expectation maximization' (SA(~E) algorithnl, its main feature being that it only updates small groups of the paran1eters, c.g., a single coordinate, at each iteration yet preserves monotonicity. In this respect, SAC-~E resembles the "expectation conditional maximization either" (ECME) [239] but SAl~E generally has faster convergence [265]. In Meng and Van Dvk's paper [265] a generalization of SAC-;E and ECME was introduced called "alternating expectation conditional maximization' (AECM), which is a SAGE algorithnl with a "design parameter' similar to SAGE-3 introduced in [1111. Another recent generalization, called paranleter expansion EM (PX-EM), allows one to augment the paralneter space, in addition to the data space, in order to obtain further convergence acceleration [240]. Interestingly, for the case of the superimposed signals problem PX-EM reduces to SAGE. In addition to the. examples shown in [110], [Ill], and [265] the SAGE algorithnl and its variants have been applied to angle of arrival estimation [115], multiuser detection [81, 289J, estimation of constrained covariance matrices [364], and speckle interferometry [363]. For cases where the likelihood function is nonconvex neither the EM algorithm nor its v..i riants are guaranteed to converge. Furthernlore, grouped coordina;e updating techniques like ECME, SA(~E, and AEC1\Il nlay not converge even when the likelihood is convex but is nondifferentiable. In these cases it is still possible to improve on the plain-vanilla EM algorithn1. TV/o recent advances are the method of Laviclle [51., 225 J and the method of Chretien and Hero [63, 64]. The former allows implementation of the E step via stochastic approximarion (or simulated annealing [226]) when a closed form for the E step is not available. This permits much less informative complete data sets to be used, for which the conditional expectation in the E step is intractable, thereby improving the asymptotic convergence speed. Furthermore, under appropriate conditions on the annealing schedule, this method guarantees (w.p.l ) conver-
Bayesian Methods for Signal Processing PctarM. Djuric, State University ojNC1VY01,4!l at St(}1'~V BTOO!l A typical signal-processing task is to extract desired informarion about a signal from observed data. The sought information might be, for example, related to unknown signal para111cters, number ofsignals in the data, distribution of signal power as a function of time and frequency, hidden states ofa systelTI producing a signal, or prediction of systen1 and signal behavior. The Bayesian approach to making the required inference relies 011 the use of probability models for the observed data and the application of probability theory, where a key role is played by Bayes' theorem [28,41, 123, 198,339,355,379]. The inference is made in terms of probability statements, and the methodology, overall, is coherent and on conceptually sound and indisputable grounds. Its framework has considerable practical advantages including substantial flexibility and generality that allow coping with very complex models, The main distinction between Bayesian signal processing and non-Bayesian methods is in the use of prior densities that quantify uncertainty about the unknowns. Use of priors have important implications both in explanation of results and the repertoire of methods, and in the statistical C0111111unity their use has been a controversial subject for Blan)' years. The controversy seems to have subsided lately, partially due to improved interpretations of the priors in ll1any applications and also to the maturation of the theory of 13ayes methods which has greatly clarified the impact of mismatched priors on the final results [28, 41].
Basics To put things in perspective, consider first a problem where estimation is required. Let the observed data be denoted by y and the set of unknown paranleters that have to be estimated by 8. The probability 1110del is described by the joint probability density function, .f'(y, 8), which can be expressed as
f(y,8) = j'(YI8)!(8)
56
where j'(yI8) is the conditional density of the data given the paranleters 8., and f' (8) is the prior density of the parameters. Given the data, y, and the model j'(y, 8), where 8 is unknown, all the information about 8 is summarized in the (normalized) posterior density .((8\ y), which by Bayes' theorem is given by
case of a linear model and additive Gaussian noise, the Bayesian solution is the well known Kalman filter [2451. 1fth e rn 0 del is non lin ear and /0 r the no i s e is non-Gaussian, the Bayesian formulation leads to a nonlinear tiltering problem whose solution again requires multidimensional integration. Some Difficulties The conceptual simplicity of the Bayesian methodologv notwithstauding , Bayesian mcthod s have been underused by the signal-processing community mainly because of their high implementation complexity. Indeed, there are only a 5n1a11 number of scenarios where the needed optimizations or integrations can be carried out analytically. Generally, analytical or numerical approximations are required that often give discouragingly complicated mathematical functions. This picture has gradually changed with the elnergence of increasingly powerful COll1pllters. Fast numerical techniques for implernentation of the necessary operations have revolutionized the practice of Bayesian estimation, detection, and tracking over the past several years.
(1) Although the entire trajectory, {j'(81 Y)} 8" ofthe posterior is sometimes of interest, very often in practice a point estimate ofS is preferred. For example, the value of ethat maximizes j'(81 y), termed the maximum a posteriori (MAP) estimate, is routinely used. The search for the MAP estimate, clearly represents J. multivariable optimization problem, Note that j'(yl 8), when viewed as a function of8 for given y, is called a likelihood function. In the non-Bayesian literature, .f(8) is not available and the ML estimate, i.e., the value of 8 that maximizes f'(yl 8), is of.ten used.
Estimation, Detection, and Tracking The best estimate of 8 is specified as that value, (3 , that
Monte Carlo Methods The multidimensional integrations and optimizations in-
minimizes a prespecified cost function. When the cost function is quadratic, the estimate () is the conditional mean, £[81 y], that is,
8=
volved in Bayesion methodology can be approximated accurately by Monte Carlo simulation if one is able to sample from the posterior distributions. In most cases of interest, however, such sampling is impossible. A 1110re practical method is to generate samples from simpler distributions followed by approximation of the integrals by sample averages. One of these methods is importance sampling [28, 123, 297]. The generating distributions are called importance sampling functions, and their choice is crucial because the variance of the estimated integrals is critically dependent on them. A related procedure is sampling-importance rcsarnpling, which generates samples from the posterior distribution by repeated sampling from simpler distributions [342]. In this method, samples are first generated from ~l suitable appro xi mat ion of 1'(81 y)., say ,-11(8) yielding samples 8 1 ,8 2 " " , S I.. Then to each sample a probability 111JSS proportional to the weight n'/ = 1'(8,1 y) / ....11(8,) is associated, where 1'(6! y) is the uri-normalized posterior density of 8. finally, the posterior density is simulated by drawing samples from {8, ,8.2 ,···,8I.} with probabilities proportional to (111 / ., lP 2 , ... , 117 I.)' Another approach is to use MCMC methods [28,123, 137, 297, 392]. These methods have extended the Bayesian methodology to 1l1Jl1Y previouslv intractable applications. The key idea is to generate samples by funning an ergodic Markov chain whose distribution after convergence is the desired posterior distribution. Similarlv to importance sampling, samples are drawn fr0111 a simple posterior-approximating distribution and arc subsequently corrected to im prove the approximation. The
f 8j'(8\ y)d8
and it represents the mimmum mean-squared error (MMSE) estimate. To implement the MMSE estimate, two multidimensional integrations are required; one for computing () given the posterior, and one for computing the normalization factor fey) = f(yIO)f(8)d8in Eg. (1). For an interesting application see [92 J, which treats the problem of Bayesian power spectral density estimation. Multidimensional integration is also necessary when S0111C of the signal parameters are not of interest. These uninteresting paranlcters, referred to as nuisance p~lLllne ters, are then integrated out of the posterior, which decreases the cornplexirv of the problem in some cases. In signal detection, the prirnarv objective is to determine whether or not a signal is present in the observed data. The signal lllJy be one of ll1any hypothesized signals, so the goal is to decide which one is ill the data. In the Bayesian literature this problem is known as model selection, and it is addressed by first defining a model, ~7v[ I.. ' for the I(-th signal, followed by associating it with a joint probability distribution, f'(y, 8;,< ~7v[ I.. )., where 8/.. denotes the paran1eters of the model MO/... Then one proceeds with the use of Bavcs' theorem and evaluation of the posterior j'( v\,[/._ Iy), which again requires mulridimcnsional integrations. When it is of interest to trncl: signal values that continuously change with time, the signal model is frequently described by a state-sp;lce representation. In the
f
"l
57
tion probabilities, it is often important to determine the filter coefficients, the input, and its 1110del paral11cters from ,1 set of distorted observations. It was shown that the cstimates of all the unknowns in this problem C~Ul be obtained straightforwardlv by~ Gibbs sampling [58]. In a different setc, r ~ ring; blind deconvolution of Bernoulli-Gaussian processes was implemented by all MCMC approach in [96]. Optimal tiltering is another area of major activity in signal processing. When the signal 1110del is nonlinear or the signal is non-Gaussian the Kalman or extended Kalman filters can give very poor performance. A po\verful alternative is to usc Bavesian filters based on sequential importance or C;ibbs samplings [52, 146,391]. A signal-processing application of the Metropolis algorithnl is paranlcter estimation of damped sinusoids [16]. When joint detection ofsinusoids and the estimation of their parumcters are of interest, the reversible jump MCMC has been succcssfullv applied [7., 91]. lVIC.LVIC methods have been successfully applied to the selection of model order of a time series [15, 22., 145, 4171. In S0111C of these papers nonst..i ndard assumptions were made, which make the direct estimation problem quite intractable. Analysis of mixed spectra within a hierarchical Bavesian framework wax proposed in [5.3] via an MCMC ~l1gorithnl. MelVi(: methods have also been very useful in enhancing speech ..m d music signals, which arc degraded by
samples are generat~d sequentially from distributions dependent on the samples 1110st reccntlv drawn, thereby forming J Markov chain. The first MelvIe method was proposed by Metropolis in the early fifties [2681 and was used in computational physics. The Metropolis algorithnl draws samples from a symmetric distribution and they are accepted or rejected according to a prescribed acceptance probability. This procedure is repeated a sutficicntlv large number of times. The Metropolis algorithnl was later generalized by Hastings to nonsvmmetric sampling distributions, which is known as the Metropolis-Hastings aIgorithnl [155 J. A third MCNl(~ method is the Gibbs sampler, which ernploys conditional sampling . i nd nlay be considered as a special case of the Metropolis- Hastings algorithnl. The parall1eter vector is divided in subvectors, and each of them is drawn conditional on the remain ing su bvcctors. It turns out that with this scheme the probability of acccpranee is equal to one and there are no rejections. The Gibbs sampler has been widclv and succcsstullv applied to problems in image processing where the 1111111ber of unknowns is very large r124 J. The M(~Nl(: sampling methods were further generalized to .illow for sampling fr0111 paranlcter spacLs corresponding to different models [148]. The new method, called the reversible jump M(=M(~ sampler, jumps from one parallletcr space to another based on transitu in probabilities of another Markov chain. Once the sampler has converged, the time it spent in a specific parall1erer space is proportional to the posterior probability of the associated model, Thus, the reversible-jump M(~M(: can implcment simultaneous Bavcsian detection and cstimatir m. There arc several important issues related to the usc of MC~1C methods, First of all'I these methods arc iterative, so the question of convergence is critical. Typically, the first N iterations are thrown (1\vay'l a period called burn-in, and determining N demands convergence diagnostics. Of practical importance, too, is the stopping time ofthe chain. One would like to run the chain long; enough to obtain desired accuracy. How 111any parallel chains to run is another important question. When there are 111any chains, their comparison nl~lY allow for easier detcrmination of thei r convergencc.
J
non-Gaussian noise characterized by impulses superimposed on a Gaussian background [144 J. Finally, in addition to its extensive applic.ition to static images, Gibbs sampling has been employed in enhancement ofdegraded video i111ages [210J. With the ever gro'Ning pO'A'er of modern C01l1pllters,
MCMC methods are becoming very useful tools for tackling even the most difficult signal-processing problems. In the years to come these methods will beC0111e more sophisticated, efficient and accurate, undoubtedly leading to ll1any new and effective signal processing algorithnls. A
WT¥vV links relevant to the above section: A \VWW [ink to the author of the section: http://vvvvW.CC.Slll1ysbxdu/-djuric/indcx.hnnl
... A WWW link to topics in the area of MCMC: http://\V\V\V .stars.bris,ac.uk/M eMC/
Time-Delay Estimation: Past, Present, and Future
MCMC Sampling for Signal Processing
.NIC.N1C methods have the potential to yield. iterative solutions to 111any important but difficult signal-processing problems. An increasing large number of papers on the subject have appeared in signal processing conference proceedings and journals. The following is a short list of recent
Haoit J\![CSSC1'" and [ason C;()ldbc1~1J, Tel Apil' [JniVC7/si~11 Timc-dclav estimation (Tl)E)'I or time-of-arrival (TOA) estimation, is a basic tool in statistical signal processing. Applications ofTDf follow ti'0111 the simple relationship of t1r = P . D.t, where D.1'" is the distance an object or a wavefield travels at some constant speed'l P, over sonle tinle interval, ~t. For exanlple'lin range Ineasurell1ents for
contributions; for a more detailed overview, see [8]. One standard problem in signal processing is blind deconvolution of noisy data that represent an output of a linear systenl excited by an unkno\vn input. For instance, if a systenl is nlodeled as ~Ul FIH.. tilter \vith unkno'vvn coetticients'l and the input is a hidden Markov nl( Ktel \vith discrete ~uld knovvn state space but unkno\vn initial state and transi-
radar or sonar, 17 is assu111ed kno\vn, and the target's range is deternlined by ll1easuring ~t, the tin1e required for the transll1itteu sign~:l1 to propagate to a target and be ret1ected back to point of trans111ission. Also., tcn' velocity
58
tween the cases of so-called "acti ve" and " passive" TD E [55, pp. 442-448J . ... In actil' c T D E , when: XI (r j and x 2 (t) correspond to the transmitted and recei ved sig n als, respectively, it is appropriate to assume that 7/ 1 (t ) = 0 and that sit) is a known, deterministic signal. It is well known that for the " no m in al active scenario, " where 112 (t) is ~1 realization of a white, Ga uss ian random process, the (asvm ptotica IIv opti mum ) ML TDE processor is the matched filter, which cross-correlates XI (t) and x 2 (r ). The estimate, si, is the time that corresponds to the maximum of the matched tilter output. ... In passive TD E, where X I (tl and X 2 (r ) are two versions of the recei ved signal, it is usually assumed that fJ. = 1, .r(t ) is ~1 realization OLl statio nary, Gaussian random process, ami 1/ 1 (r ) and 1/ 2 (t) are realizations of murua llv uncorrclarcd, zero mean, white, starionarv, Gaussian ran dom processes that are also uncorrelarcd with the signal. This well known "nominal passive scenario" was addressed and " so lved" so me 20 vcars ago. In particular, it wa s shown that the (asvmproticallv optimum ) ML processor for this scenario is the generalized cross-correlator (G cq [S5, pp . 138-144] . As shown in Fig. 1, the GeC en iss-correlates appropriatclv prcfiltcrcd versio ns of the sensor outputs, tllrming!'it as the time corresponding to the maximum GCe output. Moreover, the GeC has been sho w n to be optimum even in nouasvmptoric conditions [55, pp . 126-129] . Intuiti vely, an estimator for Min Eq. (1 ) should seek the best "match" between x , (t) and a delayed version of x, (r ). In both active and pas s-ive TD E, some form ofcross correlation Ius been proven to be the optimum measure for matching under Gaussian conditions . Another possible measure for matching could be the "error signal," c(t ) = X 2 (t ) - X I (t - L ). An appropriate estimate of time delav , t:.t, wo u ld be the T , which minimizes this error in some sense 1t em easilv be shown that f ir the Gaussian secnarios described above, the optimum TDE processor mini mi zes the mean-square error (MSE ), E[l c(tJI 2 ]. However. straig htfo rward m anipulation of the expression for the MSE shows that the minimum MSE and the co rr elato r based processors are eq u ivalent .
r(t)~ . . . , ...•... r(t ) :,
:
,, A
~t
,
t
... I . The generalized cross correia tor for pas sive TOE. For active
TOE(when s(t) is known and n ,(t) = 0), the matched filt er is obtained by setting H ,((ll) = H,(rll ) = 1.
measurements (e .g., biomedical [S5, pp 469-476 J, or nuclear engineering applications [55, pp. 363-366 ]). ~r is assumed known , and St ; th e time required for a s i g n~1 1 to tra vel the distance , S r, is measured . TDE is also important for more compli cated , nonlinear problems such ~lS so ur ce direction OLlITIval ( DO A) or bearing measurement . If C1ss L1 m ing free -space propagation conditions ) the signal due to a so u rce IS recei ved bv two sensors separated bv distance I, then th e differential delay between the sig na l recei ved bv the sensors is gi\'en bv M = I ·sin e/ 1', where e is the source DOA [S5, p~). 4()3-4091. Determination of so ur ce nO A j, often based 011 a measurement of differential time dclav, !'!.t , or, till' ,1 narrow-band source, a measurement of di fferentia] phase shift, !'ill! = (f) " M = 2 nl/ A S!l1 e, where the so ur ce frc quencv is written in terms of th e so urce w.\\'elength as (f) "
=2rrl'/A .
In practice, one seeks to measure the dcla v between two lloi.ly versions OL1 sig nal (w h ich itsclfmav even be unknown ). Uufortunatclv, there is no single measurement procedure appropri ate for all T11E sce~l~lri()',. This E1Ct, combined with th e practical importance of measuring time delay in so many different applications. is whv Tl) E has received so much arrcnri. 1I1
Basic TOE
Advanced TOE The intuitive basis on which both correlation and MSE-based processors match the two versions of the signal (E q . (2)) leads one to believe that thev mav also function in "non-nominal" scenarios. However, if the assumed conditions under which these procedures were derived are violated , thcv are no longer optimum. This implies that better estimation performance can be achie ved using other processors. Most of the TD E research carried out over the last .2 0 venrs has been devoted to the design and analvsis of processors for non-nominal scenarios that are known to commonly arise in practice . Current and future T11E research focuses on both the theoretical and practical
The most gener~ll T11E problem is now formulated . The noise -corrupted signals rec ei ved bv th e two sensors o ver some time interval can be modeled as : X I
X
2
(t) = si t) + 7/ 1 (t
)
( t) =CJ. . s(t -!'it)
+ 7/ 2 ( t) ,
( 2)
The problem to be so lved is that of using the measured data to determine !'it, an estimate of the rimc-dclav parameter, M . Depending on th e application, different modeling assumptions are made on the s l g n ~l l wavefo rm, sit ); the noise waveforms, 7/ 1 I t) ~1I1d 7/ 2 It); .ind the P~l ramcrcrs, t:.t and CJ.. It is co nve n ient to di,tinguish be-
59
Partially Correlated Gaussian Noise
Correlation-based TDE procedures are based on the assumption that the additive noise processes are uncorrelated. In cases where the signal, s(t), is non-Gaussian while the additive noise processes are Gaussian (and possibly correlated), high-order statistics (HOS) techniques have been proposed for TDE [55, pp.168-171], [166], [427]. Since the Gaussian components of the received data are attenuated in the high- (i .e., greater than second-) order cumulanrs and spectra, processing the data in these domains can result in improved TDE performance when the noise processes are highly correlated. Independent, Non-Gaussian Noise
While non-Gaussian signal and Gaussian noise processes are successfully handled by HOS techniques, a different approach is required • 2. TOE performance vs. signal to noise ratio (SNR) in white, mixed-Gaussian when the noise processes are non-Gaussian. In noise (i.e.. the noise probability density function is an average of two [362 J passive TD E has been studied where the zero-mean Gaussian density functions of different variances). The ratio beadditive, non-Gaussian noise processes are astween the variances, a, indicates the deviation from Gaussianity (the noise sumed to be statistically independent. Fig. 2 becomes "more Gaussian" as a approaches unity). Note that the leveling shows that under such an assumption the GCC off of estimator performance as SNR is decreased is in fact an artifact introcontinues to function but that procedures duced by the limited range over which the search for t!.t is carried out. better matched to the distribution of the noise issues associated with such scenarios . Some examples statistics (e.g., ML) can improve performance. are given below : • For a moving source and/or moving sensors, the Multiple-Window Spectrum Estimates delay to he estimated is time varying. Much research has been directed toward adaptive TDE, tracking, and David]. Thomson, Bell Labs the development of parametric techniques for simulOne of the basic problems in signal processing is to estitaneously estimating delay and Doppler shift, e.g ., mate the spectral density function, or power spectrum, [55, Part 4] . from J finite data sample. Given N observations, x(t) for A The implementation of the GCe requires prior knowlt = 0,1, ... , N - 1, equally spaced in time at Si = 1, how edge of the power spectra of the source signal and the does one estimate the spectrum? As the inventor of noise processes .' It is well known that the asymptotic demultitaper estimates [398], I may have a biased opinion layestimation error docs not increase if the spectra are unon the answer to this question, but, taking a direct quote known . The nonasymptotic error for the case where the from [394] : source spectrum is known has been studied [267] using "Spectral analysis has recently undergone a revolution the Barunkin bound. It has been shown that while the with the development at Bell Labs of sophisticated techshape of the spectrum determines the threshold SNR niques in which the data are multiplied in turn by a set of (under which the estimation error is larger than the tapers which are designed to maximize resolution and Cramer- R,10 bound), prior knowledge ofthe sha pc yields minimize bias [Thomson 1982]. In addition to minimiznegligible benefit in performance. ing the bias while maintaining a given resolution, the • Implementation of modern TDE processors requires multitaper approach allows an estimate of the statistical the use of digital signal processing. The adaptation of significance of certain features (such as spectral lines ) in classical TDE techniques to modern, software-based rethe power spectrum by comparing the character of the alizations raises both practical and theoretical problems. DFT's of different data windows . These techniques are In particular, interpolation of the discrete delay estimate now in routine use..." [55, pp . 343-350] and the effect of sampling on the To understand the origins of this process, remember achievable TOA error [18] have both been studied. that the first commonly used estimate of the spectrum was Schuster's pCl·iodogram, introduced in 1894. It is the Perhaps the most important deviation from the nomisquare of the discrete Fourier transform of the observanal scenarios is that of non-Gaussian statistical scenarios . tions, scaled by l/N and, as an estimate of the spectrum, is Some of the main results for non-Gaussian TOE are now both biased and inconsistent. In practice this means it gets reviewed.
60
ccntration in this band is the best possible. These sequences are the discrete prolate spheroidal sequences, or Sl cpia n seq u c II CCS , [3 7 5 1. N ()\v C () m put e the
an unstable vvrong answer, There are statements in the statistical spectrulll estimation literature that, as a function of Sc.1111ple size, the pcriodogram is "asvrnptoricallv unbiased.' Ignore these. Engineers Jearn that the only reason anyone goes to the trouble and expense of collecting 11101T data is because they are going to ask 1110re ditficu l t q Ll est ion s , s() o n e is a Jwu y s \V 0 r kin g \tv i t h small-sample problems, not with asvmptotics. In engineering data this bias can overwhelm the signal of interest; in [397] I showed data where the periodogranl wax ill error by 1110re than a factor of 10 to over most of the frequency range. The periodogrum is inconsistent because its variance, E{P(f)} 2 + , does not decrease with sample size .ind, in the cited example, was too large bv a factor of 20 more than 10 . Although these problems with the pcriodogram were known before World War II., 111any researchers persist in using pcriodograrns. (Be cautioned that estimates that arc based on the pcriodogram or ra w 11 FTs h avc s i 111i 1arb i asp rob 1e 111 s . S ~l 111p lc aut: icorrelarions are just the Fourier transform of the periodogram so Blackrnan-Tukev, autoregressive, maxinlUlll-entropy, and other spectrunl estimates that depend directly on sample aurocorrelations should not be used. Similarlv, estimates of the analytic signal derived fn.H11 Hilbert transforms using unwindowcd Dl-Ts have periodogrum bias.) A glance at the current literature 011 spectrUITI estimation theory and practice confirms that evolution is a slow process. Fortunately, most signal processors follow the rcci pe in Tukey\ 1966 paper [436 J for C( imputing all estimate of the spectrull1: choose a suitable data window, l)(t)., C( )111pute
Sf) (.f)
= NL- l x(t)[)(t)c -,2 [{Ii 12 I(=()
f~JC1'l{()~fficicnts:
», C() = L X(t)p~/:) (N, W)(-12~/t N -I
t-=()
(4)
W") IS t 1le I~/dJSleplan . sequence ~U1li parall1eters N and HI tor !( = 0, I.,... , K - 1. F rom these the crudest multiple window spectrlln1 estimate is \V 1 1lTl' P t(j,'I(N ' ")
.S(
-
n
=:
~ ~111/. (f) 12 , ~-1. [(
'.
(5)
which is simplv an average of I{ estimates of the form (Eq. (3)) made Llsing the same data but with different ta-
pers. Because the different tapers are orth: >gonal., the different terms in Eq. (S) are approximarclv uncorrelated. Each contributes t\VO degrees-of-freedo111, so Eq. (5) has a X2 distribution with about 4 NJIV df so the estimate is consistent. 1n practice, an adaptivclv weighted average of 2 the I YI.- (1') 1 \ is preferred to Eq, (5)., see [398-1., [400], and [403]. 'The multiple-window theory explained the origins of the data window, or taper. One is finding an approximate solution of the integral equation connecting the observations and the spectral representation of the process. The windows arc the eigenfunctions of the kernel. From this perspective, Tukev's estimate (Eq. (3), was approximatelv the first term of the series solution (Eq. (5)). As part of this theoretical development an effort was made to separate the deterministic (CoI111110nly periodic) C0l11pOnents of the process frOITI the nondeterministic background, which the older esrimates had IU111ped together. With multiple windows, detection of sinusoids is C0111nl0nly done with an F'-test, which is a ratio of the energy explained by J periodic C0111pOnent at frequcncvj, to the remainder of the energy in the frequency baud Cf - W , T + W); see [398], [401], [400.1, [187], and [408J. In the origillal multirapcr estimate, an approximate lincttr inversion of the integral equation was used, and the spectrull1 was obtained by local averages of its rnagnitude; quadratic-inverse theory [400J gives m inimum-variance unbiased expansions of the spectrunl and represents a step in the process ofeliminating the dependence on the choice of the bandwidth Jif7. This has been extended l402] to nonstationary probJellls.
(3)
and smooth, often by convolving Sf) (j'), with J second window, Good data windows give J much less biased cstimute of the spectrllll1 than the pcriodogr.un. Because SJ) (j') is the sum of two sqll~lres (the real and inlaginary parts of the 1) FT at frequency f') it has a chi-squared dis-
tribution with two degrees otfrecdom. Thus S /) C() is still
inconsistent and the smoothing part of the recipe is necessary to obtain a useful estimate. This estimate, however, poses a new problem: where, apart from John Tukev saying it was '-1 good idea, did D, the data window, come from?
Multlple-JPi1ttiOlP, or 7nultiplc-tapcr, spectrU111 esti111ates \vere introduced in [398 J in an atten1pt to correct 111a11)' of the shortc0111ings \'lith stan dard" spcctrU111 estin1atioll I."
When Do You Use Multitaper Estimates? Generally, ll1ultitaper 11lethods have beC0111e the estin1ate
procedures. Here one chooses an ~lnalvsis bandvvidth, J1I , for the esti111ate 0 < TV ~ 1-+ \vith NU/ :::: 4 or 5 a typical choice. The dilllcnsionalitv of J signal \vith band\vidth W and ~l tinle duration of N 'sanlple~ is !( = 2 NW. Because our goal is to estinlate the energy in a frequency band Cf - W., f"' + W) as ~lccllrately ~lS possible, \ve nlust choose the !( sequences of Juration N \vhose energy CO]1-
of choice tt)r serious spectrun1 estinlatioll problen1s, are becon1ing I.l.routine" in geophysics, [393 J") and, \vith an excellent text on the subject [307J and availability in MA TLAB, appear to be beco111ing so in other fields, [208, 238]. A quick survey of papers describing \vork llS-
61
study the relationship between atmospheric COl and global warming [193,218, 405, 406]~ the warming is rnostlv CO 2 and, 1110re disturbing, the seasonal cycle is also being disrupted by hU111an use of fossil fuels. To summarize: if you are estimating spectra, you should be using multitaper estimates. If the data is expensive, of limited duration, or if ditficult questions are being asked, multitaper estimates are mandatorv.
ing multitaper methods shows that 1110st of the early applications were scientific. Special windows [305], and combined time and space F-tests [235, 236] were developed for normal- mode seismologv, estimates of polarization [303 ], attenuation [186, 468] and other geophysical quantities [169,191,304,393, 394J. These, augnlented with coincidence tests, have been applied to processes with 1'1tan.y line COlllpOllcnts in [340 J and [ 408]. Theory and examples of coherence estimation and some multivariate applications are in [218]'1 [398], [407], and [442]. Several papers ([398J, [235], [237], [47-], [369], [337], [448], [153]., and [259]) find multitaper methods outperform "classical' alternatives. Because sample autocorrclations are just the Fourier transform of the periodogram (and hence undesirable), multitaper correlation estimates, the Fourier transform of Eq. (5), have been studied in [440] and [261]. For "traditional" stationary, Gaussian processes spectrum estimates have chi-square distributions. In practice, however, confidence intervals based on these were often wildly optimistic, and resarnpling estimates based on the jackknife [407J and bootstrap [472] are becoming cornmon, For a comparison of resampling methods, see [116]. For explicitly, non-Gaussian data, rnultiraper bispectrum estimates have been developed, [279, 399], and work well. (A few of the difficulties encountered with nonstationarv and non-Gaussian data are discussed elsewhere in this articlc.)
Time-Frequency Distributions in
Statistical Signal and Array Processing
Moeness G. Amin, Villanova University The 50th anniversary of the IEEE Signal Processing Society also marks 50 years since Ville [446] applied Wigncr distribution (WD) to signal analysis. The WI), which was the first distribution introduced in the context of quanturn mechanics [451], has paved the \vay to several key contributions to advances in the area of time-frequency distributions (Tl-Ds) as well as representations of signals with time-varying characteristics. These contributions have aimed at overcoming the drawbacks of the WI) and sought new, more effective tools for nonstationary signal analysis, synthesis, and processing. In the limited space provided, \VC will highlight only S0111e of the advances made in the time-frequcncv distributions over the past half a century with more emphasis on immediate than distant past contributions and on the articles that are relevant to themes embraced by the SSAP technical community. Sixteen years after Wigner had introduced his distribution, Cohen [69] provided a consistent set of definitions for a desirable class of TFDs, often referred as Cohen's class. This class has been of great value in guiding efforts in this area of research. Cohen's class of time-frequency (t ,(0) distributions for the signal x(t) nlay be presented in different forms, including
Variations on the Multiple-Window Theme
Using a different error norm for solving the integral equation, Riedel and Sidorcnko [334, 335] developed a multitaper "sine' estimate, While the 60 dB range of these windows lack the crushing sidclobe performance of the SIepian tapers, they are adequate for many applications and easier to conlpute. Other choices for tJ.pers are discussed in [280] and [17], and efficient methods for computing the Slepian sequences are given in [400] and [ISO] and elsewhere. The theory has been extended to arbitrarily-sampled spatial data [46, 243] but, for irregularly sampled time series, interpolation ina)' be a viable alternative [409, 410]. Turning to nonstationary processes, multitapcr spectrograms have been in use since shortly after the invention ofmultiraper estimates, see [401], [224], [191], [336], [312], and [164]. Multitapcr wavclets [80,85,234] have also been used. For weakly nonstationarv processes, quadratic-inverse theory [402, 403, 406] works well (the first few coefficients are nearly the time-derivatives of the spectrum) while, in violently nonsrationary examples, estimates of the Loevc, orrwo-frequencv, spectrU111 [164, 263, 359, 398] often give 1110re insight. Taking a singular value decomposition of a log multitapcr spectrogram is often useful, [40 I]. Narrowband tracking filters, [223] projection filters [404, 405], and inverse-theory reconstructions [302] are in use. These have been used in a series of papers applying signal-processing methods to
p(t,oo;
=
J:J': (t -
u . '!)x(u
+ r /2)x(u -
t /2)f-/(f)! dud»:
(6)
1) ifferent distributions are obtained by selecting differe 11t k ern e Is, 4>( t , 1). Bot h \IV D (a ls o k no \V n as Wigner- Ville (WV) distribution) and the spectrogranl are prominent members of Cohen's class. Extensive investigation of the desirable properties of a distribution and associated kernel requirements was done by Claascn and Mecklcnbrauker [67]. Their three-part paper published in 1980 drew much attention to the limitations and offerings of Wigner distribution and marked the first comprehensive treatment of the subject using familiar continuous and discrete signal-analysis methods. Other important contributions that have given a timely overall "big picture" view of the state of this dynamically changing and rapidly grovving area in signal processing are the review articles by Cohen [70J, Boashash [32], and
62
fluctuations brings about a clear manifestation of the signal signature in the time-frequcncv domain. Step-by-step design for kernels leading to reduce interference distributions (RI1)s) was given by Jeong and Williams [183]. Indeed, the above t\VO influential papers ([62J, [183]) on the reduction of cross-terms through low-pass tiltering in the ambiguitv domain have made the technical C0l1l111Unitv 1110re attentive to the flexibility and generalization underlying Cohen 's class ofTl-Ds and has set the stage for a surge of activities in this area in the last decade. Other papers that have given valuable insights and important perspectives to TF1)s include the 111
Hlawatsch and Boudreaux-Bartels [170]. In some respects, these articles have elaborated on a single-channel deterministic aspect ofTFDs and did not fully address the problem fr0111 a statistical signal-processing perspective. The focus on deterministic signals stemmed ti'0111 the tact that Tl-Ds have clear and well understood properties when dealing with noiseless and nonstochastic environmerits. Further, TF1)s have been successfully applied to areas where signals are localizable in the time-frcqucncv domain and have fixed distinct signatures that permit their classification and separation. Many of these applications are discussed in the book bv Cohen [71] and also in the book by Qian and Chen [325J. The paper by Boudreaux- Bartels and Parks [37] was the first to recognize that by devising a method to synthesize the signal from the tirne-ficqucncv domain, the WI) 111ay be cast as a tool for signal enhancemerit and noise suppression. In the case of signal in additive white noise, the WI) of the noise is scattered over the entire timc-frequcncv domain whereas that of the signal is confined to a much smaller region. If onlv the signal in that region is synthesized, the desired signal can be retrieved with reduced noise contamination and improved SNl:Z. Several papers have since appeared in the li ter a t u rc as alternatives to the least-squares approximation technique cmplovcd by the synthesis method. For multicornponcnt signals, the cross-terms (also referred to as interference terms), which arc introduced from the bilinear nature of the TF1)s (Eq. (6)), intrude into the tirne-frcqucncv regions containing true signal p()\ver concentrations, known as "auto-term regions." In such a case, and also for low SNR environment, the sign~d auto-terms Inay not be identifiable using WD, which renders signal classifications and synthesis difficult and sometimes impossible. Choi and Willianls [62J and Zhao, Atlas, and Marks r465J have proposed t-f kernels, which make such identification much more feasible than attainable using the WD. The distributions corresponding to these two kernels have come to be known as the Choi- Willianls (CW) and the ZAM TFl)s. In both distributions, the kernel is characterized by one paranleter whose value n1ay be adjusted to achieve a tradeoff between resolution and cross-term suppression. A fully signal-dependent kernel was proposed by Baraniuk and Jones [12 j, where the kernel self-adapts its shape based 011 the underlying signal characteristics. In this respect., unlike both the CW and the ZAM TFDs, the signal-dependent 1-
63
nal, x(n), JS a collection of uncorrcl.itcd sinusoids with random time-varying amplitudes, namely: x(tt)
r.
=
Multiresolution Analysis
Hamid [Cri111, North Carolina State University, and [can-Christophe Pesquct, Ul:JS/LSS
A(TI,wjc,o"'dZ(w)
Solutions to ll1any engineering problems traditionally invoke (at least partly) spectral domain techniques. The simplicity often provided by the Fourier domain in analyzing a process is in large part due to an implied linearity and tirne-invariance (whether by assumption for tractability or otherwise), which yields complex exponentials as the eigenttlnctions of the process. Equivalently, in a stochastic setting, stationary and linear processes have led to high-performance techniques for estimation and detection. The demand for increased performance in statistical signal applications and the enlergencc of a whole class of nonstationarv problems have resulted in a new active area of research, namely time-frequencv methodology (described in the section ofthis article by Amin) and 1110re recently time-scale (multircsolution) techniques.
where A(n, OJ) is the rime-dependent amplitude and 2(0)) is an orthogonal increments process. For a given signal that admits this representation, the ES is defined as the magnitude squared of A(ll, 0)). The work in this area has successfully led to the gel1er,llizatiol1, cstimution, and the linkage of ES to Tl-Ds, For processes with restricted timc-frcqucncv correlation, referred to as undcrspread nonstationarv random processes, it has been shown by Matz, Hlawatsch, and Kozck in [258] that the 1110st popular definitions of time-varying spectra, such as the generalized vV\' spectrU111 and generalized ES, yield effectively equivalent results. The concept of underspread processes proves useful in analyzing Doppler shifts and fading communication channels LlSing time-frequency structures. Tl-Ds have also been examined for detection of nonstationarv sigllLlls. Almost one decade ag(), Flandrin [1131 provided a coherent frumcwork for WV time-frequencv receivers. It was shown that classical receiver structures designed for optin111111 detection of Gaussian signals in Gaussian noise admit an equivalent formulation in the time-frequency domain. The work by Saveed and Jones [350] has gone past the mere equivalence of classical optimum detectors to exploit the time-frequency structures in composite hypothesis tests where an optimum quadratic detector is implemented at each time-frequency point. Time-frequency distributions have recently found applications to radar and sensor-array processing. Barabarossa and Farina [13] have combined conventional space-time processing with TF1)s and demonstrated the advantage of joint processing for clutter suppression and target detection. Bclouchrani and Amin [23 J have introduced the spatial timc-frcqucncv distribution and used it to solve blind source separation and direction tinding problems. They derived the fundamental equation
D.u (t, j~) = AD.\.1 it , j')A J-I,
Complementing Fourier Analysis Multiresolution Analysis
It is well known that many physical phenomena ll1ay be distinguished by characteristics present at different scales [254]. The statistics associated with these characteristics and/or their evolution across scales l1lay provide unique and powerful signatures. The fractal structure of nl3.ny natural phenomena, e.g., the coast line of a continent and the patterns on a tree leaf 111ay be viewed as the result of statistically self-similar patterns [254, 460J. The ubiquity of such phenomena in physical processes has called t()r a systematic and efficient methodology to capture the multiscalc trend and preserve the statistics at the various scales for further processing. The wavelet theory [86 J provided a powerful framework to meet this challenge and gained further prominence upon the ingenious connection Blade by Mallar [253], with the then well known filter-bank theory [437, 443]. The orthonormal wavelet analysis afforded, in ll1an)' cases, analytical tractability and, equally important, an efficient tracking of the statistical properties at different scales. Scale Refinement
(7)
An additional scale refinement 111ay be obtained by iterating the basic wavelet analysis on the coarse scales as well as the tine scales of the signals [72 J. Referred to as the wavelet packet dictionary, this representation consists of an overcornplcte set of functions, out of which an orthonormal basis is selected via an efficient dynamic prozramminu procedure and an additive criterion [72J. b b r Other extensions of the wavelet/wavelet packet deC01l1positions are obtained by imposing some shift-invariancc properties [308]. In the interest of space, we classify the mulriresolurion statistical developments into t\VO major thrusts, the first of which is centered around the analysis with an impact
which relates the TF1)s of the sensors to those of the sources. In Eq. (7) A is the spatial signature matrix. The elernents of D .(\ (t , j') and D ss (t, .f) are not the commonly used matrix correlation functions, but rather the self.. and cross-Tf'Ds of the sensors and sources, respectively. With their role in advancing knowledge, thee )ry, and applications in the statistical signal and array processing area, Tl-Ds have been established as an integral part of this area, and \,yill remain so for ll1an)' years to come.
A WWW liul: to the author ojtbc above section: http://\V\V\;V.ccc.vill.cdu/uscr/mocness
64
on compression and nonlinear estimation, and the second focusing on the mulri resoluti on modelin g aim ed more at large-scale estimation and classification problems.
Multiscale Statistical Signal Analysis and Modeling
On the analvsis front th e good localization prope rt ies of wavelets ha ve played a kev role in the de velo p men t of variou s applications such as co m press ion [253,328 ] and signal reconstruction [94,211 ,253 ,27 5,347 ] (also referred to as denoising ). The tree-like struct ure o f th e wavelet a n al v s is fr am cw o r k Iu s al s o led to effici e nt multircsolurion stoc hast ic model ing techniques wit h ~1 remarkable impact on large scale physi cs-based esti ma tion and classification problems [19, 249 J.
Input
... 3. A
hard, soft, as well as robust thresholding.
Fractal Analysis
f ractal unalvsis has been a t()(US o f inte rest in s ign~1 1 processing for alm ost tw o de cades and contin ues to play an important role in appl ications fields such as co m press io n, ana lysis o f tu rbulence, and co m mu nicatio ns . T he characterizing scalc-invariancc o ffrac tal sig nals, as noted earlier, makes wavelet analysis the tool of cho ice . The orthogonal wavelet rcprcs cnratio n of fractal pro cesses cn rirclv refle ct th e prop erti es (statist ical or o t hers) resid ing at different scales. Such unal vsis led to signitica nr adv ances in fully and accurately idenr it}ring fract al and multifractal signa ls [ 179 /, and in other re lated sy nthes is problems offractional Bro wni an motion [ 114 , 4 60,3 95 , 257]. Using the pa rsimony-achie ving po rcnrial o f wave lets, o the r well adapted .m alvses we re pro pose d [84] for identificarion/svnrhcsis of tu rb ulent velocity sig nals. In part icular, th ese were show n to pro vide a co nsiderab le sim plificatio n and usefulness for turbulence sig nals. Other ap plicatio ns wh ere fracta l signals h ave shown pro m ise include biomedical, hioc hc m isrrv [ 1[. and co mmunications sig nals [460]. Other rnulti scal c an alyses o fr elated processes, such as nonsrationarv processLs w ith stur io narv inc reme nts [4 9, 212], ha ve res ulte d in stationari zi ng pr operti es , thus allo wing th e appl icat ion of classical sta t istica l techn iques and , equally important, a de ep er u nders tand ing of o t he r nonstati onarv pa rametric processLs [212 1. ( f ractio na l Browni an motion is a special case of a no nsra tio narv process with sturiona rv incrcmcnrs. ) A pa rti cul a rlv in teresting exten sion to two-dim en sional sig na ls also resulte d in anal yzin g and synthesi zing fields suc h as the ocean flo or [3 14] .
Signal Reconstruction In an attempt to filte r the o bs e rvatio n noise fr om a signal, and usi ng the ab ilit v o f wave lets to co nc e ntra te s ig n al e n e rg~' along a few directi ons, res earche rs ha ve tried to se p ara t<: the direction s co nt aini ng sig na l en e rg y and the orthogonal direct ions co nta in ing mostlv noise e ne rgy. These noi se d ir ection s ar c t he n d is-
curded and the form e r used in the re construction . The de velopm ent of thi s thrust is marked b y th re e phases tha t rook pla ce in se q uence. Signal in Gaussian Noise : Usi ng to adva ntage the Cl1 er g y co m pact io n property o f wa velets, Mall,u a nd H wang [2 53] fir st sho wed that effective noi se suppressio n ma y be achieved by tr ansf orm ing the no isy siglUl int o th e wavelet domain, and p reser ving only the local ma xima of th e tran sform fo r su bseq ue n t reconst ruction . While per forming amazin gly we ll, a so u nd statist ical formalism to vario us deterministic thresholding techniques W ~lS first proposed by Donoho and Johnston [94 ] wh o co nsidered th e obser ved sign al x( t)
= s(t ) + n it )
w it h t = 1, ,, ' ,](, n( t) - N(0,0 ) and s(t) unknown . They sho we d th at a certain o ptim ality was achie ved by rhresholdinz all wavelet co effic ients o f :\:(t) below T = 20 2 log<- J( . Specifically, given that a wa velet bas is is t . '2
an unconditional basis for a g reat m any smoothness spa ces [25 3], they sho wed th at the reconstruction error was wi th in a scalar multiple of the minim um wo rst case erro r ove r th ese sig nal spaces. Further de velopments ensued as other inte rpretations of sig nal enhancement or deno ising were ado pted . In [275 ], [347] , and [211 ] th e norion o f cod ing was ind ep endently used to lead to ~llgo rirhms w ith more o r less the same tvpe of nonlinear th resholding. The info rmation-theoretic criterion m inimu m description length (M D L ) developed in the late 1970s [338, 365 ] pro ved to be very usefu l in not o nly prov idi ng th e threshold, T , upon its minimi zati o n in the wavelet domain, but also in c1arit)'in g th e relati onsh ips between th e vario us wavelet properties. In Fig . 3, a sum mary of th e nonlinear thresh olding techn ique (othe rwise referred to as a hard-th resholding ) together with its various modificati ons are presented, w hich fo r the purpose of th is ove rview are o n lv worth noting. Other extensions in-
65
Bayesian Approach
.',,'-.':
The above thresholding approaches have been demonstratcd to lead to good results in relatively moderate noise scenarios and have been successfully applied in a variety of settings . They are, however, based upon threshold values, which present two drawbacks: ... They are directly dependent upon the noise variance without regard to the signal characteristics ... They grow without bound with the data record length To address these limitations and particularly when prior information about the underlying signal is available (quite reasonable in practice), a purely Bayesian approach was adopted in [309] . The prior knowledge about the signal in essence regularized the estimation problem. This clearly led to MAP estimates of the signal coefficients . In contrast to the previous approaches, this approach takes a more elaborate form, allowing one to account for probabilistic prior information one may have about the signal of interest. The Bayesianthresholding filter that results is independent ofthe data length, J(, and isonly dependent on the signal and noise variance. Interestingly, it has been shown that many thresholding rules may be included within this framework [445] . For instance, if the noise components are i.i.d. Gaussian and the signal components are i.i.d., zero-mean and have a Laplacian distribution, a soft thresholding policy allows us to recover the signal. To better account for the expected sparsity of the components of the signal of interest (parsimonious wavelet representation), a prior equal to a Bernoulli-Gaussian distribution (which is a degenerate Gaussian mixture) in presence of i.i.d. Gaussian noise, leads to an estimate that is a rradeoffbctween a Wiener and a thresholding estimator [309].
1.5
,
I
,
I
0.5
I
I
I
I
I
r-
f
,I "
" -1
A least favorable noise distribution: Gaussian in the middle and Laplacian on the tails.
... 4.
elude techniques that account for a simple correlation structure among the coefficients, which, if it agrees with the signal structure, should lead to better performance [79]. This, however, also results in a higher computational cost. A statistical approach to optimize a process representation in a wavelet packet set that also led to denoising techniques has been proposed in [2111, [213 J, [309J, and [95].
Multiresolution Modeling
Multiresolution modeling first appeared in the context of data compression [253] . Its recent increased prominence is largely due to the computational efficiency offilter-bank implementations. This led to a multitude of applications, and one of particular interest herein is the clever recasting of time-recursive filtering into scale recursive filtering [19] . This led to modeling algorithms with high efficiency as a result of the tree-like structure of the analysis. The generality of this modeling technique comes from the fact that the nodes may be interpreted differently depending on the application [249] and the appeal of easily implernentable algorithms . Other extensions included the introduction of time dynamics [174] with a variety of applications . One interesting applications is to ground water hvdrologv where measurements are in fact multires(;lution ~(')\!er space, resulting in very efficient data-fusion algorithms and subsequent estimation procedures [83] . Another application is to ocean height estimation with sparse satellite measurement data where multiresolution methods could be implemented with unprecedented efficiency and accuracy, creating a ground-breaking milestone in computational oceanography [112]. Other applications include synthetic aperture
Beyond Normality
While the Gaussian noise assumption may be valid in a number of applications, it certainly does not hold in cer tain environments; for instance, those encountered in an industrial setting. The Gaussian assumption is thus generally limiting, particularly when we have no knowledge about the prevailing noise . An approach inspired by Huber's early work [358] is due to Schick and Krim [358], who, by obtaining the minimum maximal description length (D L) of a data sequence in the wavelet domain, derived a robust nonlinear filter to cope with non-Gaussian scenarios . The minimax DL filter resulted from a mixture noise as shown in Fig. 4 and led to a thresholding rule shown in Fig. 3.
66
switch to a dccision-tccdbacl: mode where previously equalized and quantized (according to the alphabet) sYlnbols are used together with the received data to update channel estimates [24, 321, 323]. ~rr~lining sequences COnSl1111e bandwidth and consumption increases if frequent re-training is required to avoid erroneous convergence of decision-feedback equalizers (Dl-Es ), which occurs when the propagation channel is timc-varvinz: see, e.g., [326-1 and r90J. To obviate training and thus utilize bandwidth efficiently, self-recovering (a.k.a. blind) algorith111s have received attention over the last dozen years for identifying the channel or estimating the equalizer directly using output data only-a feature also i111portant when information tr ansmisxiou cannot be interrupted for training, as, t()r example, in broadcasting and multicasting scenarios [26., 117, 143 J. l~he success of blind methods in a communications context depends on maximum exploitation of input features such ax whiteness, non-Gaussianirv, finite alphabet, constant modulus, cvclostationaritv-s-propcrtics that equalizers are
radar (SAlt) iIl1age classification, compression [207J., as well as the analysis of self..similar processes [112 J. A WWW link to the author oftln: abovesection : http://\V\,vw.ccc.ncsu.cdll/pCoplc/Elculty/bios/ahk.htlllI
Channel Estimation and Equalization Gcorqios Giannahis, University (~f f/i1llrinin Communications and, in particular, channel estimation and equalization arc areas that otter a terti lc ground for statistical signal-processing tools and ~llg()rithnls. lnforIllation sources are mapped to (generally complex) synlbois that take values from a finite alphabet and are thus non-Gaussian signals. 'They undergo distortions that introduce inrcrsyrnbol or interchannel interference (lSI or ICI) as they propagate through channels before being received by single or multiple sensors in noise. Receiver noise is narrowband and hence is modeled well as additive Gaussian, although impulsive models appear also with ambient and atmospheric noise sources in underwater acoustic and radio communications. lSI and I(~I arise due to bandlirnitcd transmit- and receive-filters, amplifiers, delay- and multipath-propagation, relative transmitter-receiver motion, coupling effects, and multiple access interference (MAl) [323J. Depending on the transmission rate, the propagation conditions, the number of transmitters and receivers, the complex discrete-time equivalent baseband channels can be: (1) deterministic or random constants over one or 1110re information svrnbols (modeling flat flding effects); (2) single-input single-output (SIS()) linear time-invariant (LTI) Fl R filters (accounting for frequency-selectivity); (3) multiplicative sequences (modeling ti mc-sclcctivitv ) ; (4) linear time-varvinz ( LTV) filters with random or deterministic coefficients (capturing fast fading effects); (5) nonlinear FIR filters of the Volterra type (modeling saturation nonlinearities of power amplifiers): (6) multi-input multi-output (.wIlMO) filters (for multiuser scenarios); or, possible combinations of (1 )-(6). Equalizers, on the other hand, undo channel effects to recover the tLll1S111itted sequence and, depending on cornplcxitv versus performunce tradcoffs, they can be: (1) linear Of nonlinear; (2) FIR or IIR., and (3) batch for block-by-block equalization, or adaptive for efficient online processing and tracking of slowly varying channels. Channel estimation, equalization, and svmbol recovery algorithlTIs are founded on detection-estimation and system identification principles, and their advances parallcl and cross-fertilize ideas in diverse signal-processing applications including seismic deconvolution, sonar de-reverberation, image restoration, signal reconstruction, rime-series modeling, and various inverse problems involving dispersive media [162]. Estimation of channels using the received (output) samples can be viewed as an input-output system identification problem if a known training sequence (input) is transmitted during the acquisition 111ode. In the operational stage, receivers usually 67
equalizing channels with unit-circle zeros and their asymptotic performance has been shown recently to approach that of 1'11nxil1/1l11J liltclihood sequcnce estimation (NILSE) [66., 323 J. Given a channel estimate, the latter is implemented using Vitcrbi's algorithnl [241 and is the optimum means of recovering the finite-alphabet input, although its practical use is limited due to its complexity, which, especially with multiuser communications, increases exponentially in the channel order and the number of users [4411. Simple nonfrequcncy-selectivc FII\. channels introduce constant amplitude and phase distortions that can be compensated with automatic gain control (AGe) and differential encoding, respectively (sec, e.g., [323]). But recently, even polvnornial phase distortions arising due to relative transmitter/receiver motion can be mitigated with generalized differential encodingtl142l Carrier and timing synchronization arc, in principle.' frequency and timc-delav estimation problems, respectively, and can be solved using ML [323] or cyclic methods with fractional sampling r. 1411· Correct timing acquisition affects performance considerably, cspcciallv for code-division 111ultiple access (C=l)LVIA) systenls entailing asynchronous users, and a variety of methods (including subspace approaches) have been proposed recently (see e.g., [3831 and [25]). Blind equalizers of FIR.. frequency-selective channels do not need to acquire timing because they absorb it into the channel itself. In addition, methods that rely on the constant-modulus (restoral) algorithnl (CMA) do not require frequency offset estimation [143, 416]. C:iVIA is basically a HOS-based technique equivalent to the Shalvi-Weinsrein algorirhm (SvVA) [90,370]. By constraining the linear equalizer's output, CMA reduces the variance of HOS-based techniques and estimates the equalizer directly, as opposed to 1110st parametric and nonparametric HOS based approaches that estimate the channel first (via linear equation or nonlinear matching methods [233, 430]) and next equalize using either: (1) the computationally complex Vitcrbi; or, (2) the so-called zero-forcing equalizer (ZFE), which is nothing but a truncated version of the inverse channel [248] ~ or (3) the NIMSE (a.k.a. Wiener) equalizer that assumes knowledge of the SNIZ to obtain a regularized inverse [317, 323]. Direct adaptive linear eq LILlI izers of the (~MA/SWA type arc particularly attractive computationallv, but convergence and speed 111ay be problematic, especially with channel roots on (or close to) the unit circle-a concern that is alleviated with fractionally sampled versions of the originally developed symbol-spaced Cl'vlA/SW A [90" 232 J. MMSE or ZFEs can be used to initialize the CMi\. or other nonlinear schemes whose convergence depends cruciallv on initialization. CMA can also be invoked in a l)FE mode to improve performance, especially with channel nulls. Although interesting preliminarv results have appeared,
response information (conveyed by 50S) with complete phase response information, which allows equalization of nonminimum phase channels [131., 157, 370, 430J. However, HOS exhibit high-variance, and channel variations ll1ay violate the stationarity assumption as the receiver collects long records required for reliable HOS estimation. With sufficient excess bandwidth at the transmitter, most FIl\. channels can be estimated and equalized blindly using second-order cyclic statistics (SaCS) that become available when one oversarnples (or fractionally samples) the continuous-time received signal at a rate higher than the svmbol rate [122, 129, 130, 413, 414]. The resulting time series is cvclostationarv and the redundancy introduced renders the LTI SISO 1110del equivalent to either a linear periodically time-varying (LPTV) 5150 model or to an LTI single-input multi-output (SIMO) modcl , which can be characterized by multivariate stationary 50S. SIMO models are also appicablc, even when symbol-rate samples are collected by multiple receive-antennas [276 J, and the excess-bandwidth condition adopted to introduce diversity now translates to sufficient sensor separation in order to guarantee channel disparity (co-primeness of the SIMO transfer functions). An important consequence of the I.J)TV-SISO and LTl -SIMO structures under such timeor space-diversity conditions is that LTI FIll channels can b<.: eq ualized exactly by FIR equalizers of the same or greater order; see, e.g., [376]. 1~ecall that L"fI-SISO channels with zeros on the unit circle cannot be inverted, and even with 1VIMSE (Wiener) equalization performance drops due to noise amplification at the frequencies of the channel nulls. The LTI-SIMO equalization property is analogous to the perfect reconstruction encountcrcd with multirare analysis-synthesis FIl\. filterbanks [437], and it has practical implications in C0111111Unications even when zeros are close to the unit circle: (1) truncated Fl R equalizers of FIR channels need not be excessively long to approximate ideal IIR behavior; (2) with appropriate initialization, adaptive equalization algorithlTIs can be globally convergent (at least in high-SNIt environments) [232] ~ and (3) so long as the input sequence is persistently exciting (a minimal condition for identifiability) it can be colored or even deterministic, which is important for coded sequences that arc nonwhite; see e.g., [276] and [462]. Recent work focuses on inducing cyclostationarity or di versiry at the transmitter by means of periodic modularing sequences or redundant filterbank precoders [60, 128, 353, 368, 424]. Equalization exploiting transmit-diversity is very promising because, unlike fractionally sampled equalization (FSE), it imposes no channel disparity conditions, is applicable to nonwhite and deterministic inputs, and shows robustness to channel order overestimation and additive stationary colored noise [368, 424]. At the expense of added complexity and possibility of divergence, DF_Es otter a practical alternative to
68
the convergence of FIIZ C1\!lA-FSEs and their l)FE versions in the presence of noise is not fully understood. Fading channels appear with mobile cellular telephony, tenlperaturc., and salinity variations ill underwater environments, and ionospheric fluctuations in microwave links, where variations of short coherence time cause runa\vay effects in adaptive tracking ~llgorithlns. Thev are modeled as LTv' FI1Z filters with the average extent (delay-spread) of the multipath defining channel 111en10ry and degree ottrcqucncv-sclcctivirv, and with the so called Doppler-spread accounting for the average channel variation and measuring time selectivity [323]. The latter can also arise due to oscillator drifts and relative motion that manifest themselves as multiplicative noise when frequency selectivity is ncgligible:. In general, LT\! channel taps are modeled as uncorrelarcd stationary randorn processes that are assumed to be low- pas-s, Gaussian, with zero mean (Rayleigh E1ding) or nonzero mean (Rician fading) depending on whether line-of-sight propagation is absent or present [323]. Corrcl.itir H1S of the unknown taps capture average propagation characteristics and are used to track the channel's rime evolution usi ng Kalman Filtering estimators. The challenging task of estimating random channel paranleter-s using training data or decision-feedback has been addressed in [4251. Blind approaches for rnndom (OtjJiCic7lt L1(.iing channels arc yet to be developed. However, blind methods adopting deterministic ./initclv pttrttmetcrizcd LTJ;7 models have been proposed recently using .1 basis expansion [133., 421 J. They turn LTV-5150 models to 1.-'-[1-MIM() structures with inputs formed by modulating the transmitted sequence with the bases. Fourier bases are well motivated for modeling rapidly LH.iing mobile C0111111Unication channels when multipath propagation caused by a few dorn inant reflectors gives rise to (Doppler induced) lincarlv varying path delays. Doppler frequencies can be estimated blindly using cyclic statistics, and channel orders can be determined 6"On1 rank properties of a received data matrix [4221. When channel (or Doppler) diversity is complemented by temporal or spatial diversity (available with ovcrsarnpling or multiple antennas) blind estimators of L1"'\/ channels along with direct equalizers become available even with minimal (persistence-of-excitation) assumptions .ibou t the input and the bases [133 J. Multivariate LTl ZFEs lend themselves to adaptive algorithnls that provide fine tuning for possible 1110del mismatch of the bases that capture only the nominal part of the rapidly EH.iing channel (see [133 J for a tutorial treatment and [422 J for blind HOS LTV channel estimators .uid DFEs). l\IIIl\IIO channel equalization is a major challenge in 111 ulti ple-acccss wire less CO 111111 un ications bcca use rnulripath introduces multiple-access interference (1V1A1)., \vhich linlits systenl capacity and bit-error-rate (13E1\_) perfOrll1i:U1ce. LO\V-COll1plexity Cl)M_A syste111S able to cope \vith (perhaps un kno\vn and tinle-varying) nlultipath i:1nd equipped with self-recovering capabilities
Unfortunately" there is no single measurement procedure
appropriate for
an TDE scenarios.
arc most desirable because they arc versatile in variable data rates and fading (e.g., mobile) environments. They also relieve the need for power-control and band"V i d t h - c ()n s II 111 i u g t r a i n i n g seq u c n c c s. L i 11ear suboptimum equalizers with training that either suppress MAr c C)111 pIe tel y (3. k . a . Z e r 0 - fo rei n g (Z F) 0 r dccorrclutiru; receivers) [250 J'\ or their 1\IMSE [177] and minimum-output energy [423J counterparts, offer a compromise between the high-cOll1plexity ML solution r441 J (that assumes knc)\.vledge of aU svstcm parameters) and the matched-filter (Ml-) multiuser demodulators that arc not only known to suffer from ncar-far effects but also exhibit an error tloor in their Bf~lZ due to MAL Addit i()11 ~l I ~1 Ppro J c h es i 11 C lu d c In ul tis tag e ad apt i ve de III 0 d II Ia t()rs, I) FE s [ 9 8 J, and spa t i aI co m bin ers (ltAI(E receivers that in tact arc nothing but inverses of multivariate channels that are assumed to have been estimated) [323]. Frequency-selective multipath induces interchip interference. Simultaneous incorporation and mitigation of asvnchrouism and multipath effects were reported recently in [420 j and [423 J using a multiratc equivalent discrete-time 1110del (sec also [458] and [4591). Blind approaches are well motivated when high-rate C0111111Unication protocols entail small data packets (c.g., in distributed networks and wireless pes prototypes) or when the propagation medium is rapidly varying (e.g., in large cells with considerable delays and high data rate tirnc-varving wireless environments). Such self-recovering Cl)Nli\ receivers were proposed recently in [420], [473]., [3831, [241], [25J and [419]. They capitalize on code diversirv offered by the user coder s) and the received data but have relatively high cornplcxitv especially because they adopt subspace decomposition (via the singular-value decomposi tion (SVI))) of large matrices for sign~ltLlre waveform estimation. Inverse filtering criteria and recursive least-squares (!{.LS) and least nle~l1-square (LMS) algorithnls that include multiparh were reported recently in [419) and [426] by viewing self-recovering Cl)M.A. demodulation as a blind bcamforming problem. Interesting directions for mitigating l\tlAI, asvnchrouism, and multipath by judicious code design at the transrn i trcr incl udc the blind Lagrange- Vanderrnonde Cl)MA transceivers of [352J and the clllerging multicarrier Cl)NIA s)'stenls, both of vvhich turn frequency-selective 111ultipath into tlat f:u.iing [105,471] (see ~llso [349J for \vavelet-hased codes that produce graceful degradation, especially \vith oversaturated C:l)NlA systClllS).
69
justified by appealing to the Central Limit Theorem. The pdf is tractable, and algorithlTIS derived under the Gaussian assumption are usually simple (Iinear/closed-form). In contrast, non-Gaussian signal processing typically involves nonlinear processing. In this section, we will look at recent trends in the modeling of non-Gaussian processes: finite-variance and infinite-variance processes., fractal point processes, and multiplicative noise models.
The plethora of propagation conditions and requiremerits for transmitter-receiver constraints in terms of complexity, transmit-energy, bandwidth, SNR., and perforrnancc specifications (MMSE or BER), otter numerous possibilities for statistical s igrral-processing b algorirhrns. Digital communication SystC111S generally en. tal·1 man-maci e cOlllponents anu..I arc a \,(,para disc" ise tor SIgnal-processing research and development because they provide considerable flexibility to the SP designer. At the same time, SP algorithnls must be tuned to the often L..
Finite Variance Models Non-Gaussian data are encountered in various fields, such as agriculture (the Fisher Iris data) and economics (unemplovment data) [6]; astn mom y (sunspot data) and biology (Canadian lynx data) [322], music (average
strict specifications of communication svsterns and standards. A number of interesting direction"s open up for future research: (1) maximum exploitation of available information and communication constraints (semi-blind approaches along the lines of rS6 J and [147] offer pronlising directions for linear equalization); (2) if there is a choice for inducing diversitv in the input the channel 01" the received output, it appears that input' (i.e., transmit-) diversity in the form of short training sequences modulation, codes, or filterbanks is to be p~'eferred and optimal transceivers should be designed along the lines of [463] (see also [351]); (3) with increasing interest toward low-powcr C011111111nications and nonconsrant modulus transmissions (e.g.., OFl)M or downlink Cl)MA in bzeneral) pre- or postmitigation of power-amplifier nonlinear distortions is necessary using training or self-recovering receivers (see [132] an~i refer~nces therein for steps in th~ direction) ~ (4) convergence studies of adaptive CMA and D FE algorithms in realistic noise environments [90]; (5) performance analysis of channel estimators, especially when model perturbations due to synchronization effects and Doppler frequency drifts are present; (6) BEl~ evaluation of ZF equalizers and experimental comparisons with the MSE equalizers in 5150, SIMO, and MIMO structures; (7) diversity techniques for blind identification of random coefficient models and performance COll1parisons with the basis expansion models using real data; (8) deve lo p me nt and perforrn a ncc analysis of low-complexity blind multiuser equalizers; (9) joint design of equalizers with channel encoders and intcrleavers; (10) exploitation of network protocol structures from higher layers (e.g., ATM) for designing equalizers at the physical layer (see [11] along these lines); (11) balanced combination of the various possible diversity-inducing factors (e.g., codes, channels, fractional sampling, antennas) for blind channel estimation and equalization ofgeneral MIMO channels under minimal but realistic identifiability assumptions (see [373] tor preliminary steps in this direction).
kurtosis of music has been steadily increasing") [149J, exploration SeiS11101ogy., radar, sonar, speech, and image and communication signals. Experimental measurements show that a 111 bierit noise is often significantly non-Gaussian, particularly in urban and radio channels [2701 and underwater acoustic channels [45., 269]. In communication channels, multiple user interference is highly structured and non-Gaussian. Of course, nonlincarities usually lead to non -Gaussian outputs. In general, the multivariate pdfs of non-Gaussian processes are intractable, and with few exceptions there are no general models. In the non-Gaussian context, linear techniques and second-order statistics are not merely suboptimal but are, in S0111e cases, incapable of providing acceptable performance (c.g.., multichannel processes and source separation). Since for nlany problems the Gaussian environment is the least favorable, exploitation of non-Gaussian features can lead to significantly improved performance, although this usually involves nonlinear signal processing [199 J. Optimal estimation/detection ll1ay be feasible if the multivariate pdfs are analytically known (and tractable). If we have access only to training data (Of if the signal is weak), the noise pdf can be es~inlated using vari(~us approaches (kernel density approaches, stabilized histogram estimators, type-based estimators, etc). Alternatively, one ll1ay use a parametric model, such as the Gaussian mixture model, whose para111eters can be efficiently estimated via the EM algorithll1 [260.,273]. Depending upon the application, the (multivariate) pdf estimators ll1ay not be satisfactory unless sufficient data arc available, and the resulting signal estimators n1ay be highly nonlinear. ~ Since non-Gaussian processes are not completely characterized by their first and second-order moments, higher-order statistical descr iptors, such as the higher-order moments and curnulants, and their Fourier transforms, the 1110111ent and cumulant spectra arc required. Consequently, in the last two decades, a lot of attention has centered around HOS [264, 291, 292, 315, 320., 387]. HOS provide a parsimonious (but generally incomplete) characterization ofthe non-Gaussian process and are multidimensional statistics; for example, the fourth -order moment of a stationary random process is a
L
J
J
A WWW link to the author oj'tlJe ttbove section: http://\vatt.seas.virginia.edll/- gg4\vj
Non-Gaussian Processes Anantbram Swami, ARL The Gaussian distribution enjoys a central place in statistical signal processing; the Gaussian assumption is often
70
function of three indices: nt -+ \ (i, j, Il): = E{x(n )x(1t + i) + j)x(1'l + Il)}. HOS have been used to provide tractable solutions to various "nonproblerns' in signals and syst c 111 s : non - G J u.ss ian i t Y, 110 11In i n i 111U m ph as e , n o n c a u s a l it v , nonlinearity, no n r c vc r s ib i l it v , nonadditivirv, and nonstationarity. Sampliru; a continuous-timc minimum-phase linear process usually renders the discrete-time process nonminirnurn phase (NiVIP) and NMP signals are encountered in frequency selective communication channels. Nonlinearities are encountered, tor example, in high-power amplifiers in cornmunicatiou satellites operating near the saturation point, interactions in ocean \NaVeS, magnetic recording channels, and scattering phenomena in radar and sonar. The history ofHOS can be traced back to Fisher and the seminal work ofstatisticians in North America and Eastern Europe: Brillinger, Kolmogorov, Leonov, Rosenblatt, Shirvacv, Sinai, and Tukev, The interest of the signal processing and svstcms communities perked up in the early 1980s, due partly to a US-ONR funded initiative in non-Gaussian processes [449]. Subsequently, there have been f ve biannual international workshops and several special issues of the Transactions on S(ffuallJrocessinlf devoted to the subject; a comprehensive bibliography nlay be found in [387J. The success of HOS-based methods depends clearly on the aITIOLult of non-Gaussianirv and nonlinearity of the underlying processes and models; hence, tests of Gaussianiry and linearity are important. I-I ()S- based methods typically entail an increase in dirncnsionalitv, computational load, and statistical variance of the sample estimators. The potential need tor 1< Ulger data records also cautions one to test for stationarity. The cumulants of a starionarv-random process (or ota random vector) can be represented either as tensors or as m-D matrices. Several results in the scalar case can be generalized to the vector case by replacing scalar multiplications with Kronecker products [3g6]. But, notions r e l ate d tor a 11k , e i g e 11vee tor dec 0 111 po sit ion, diagonalization etc are largely unsolved, but S0111e interesting results 111i.1Y be found in [75, 76] where relationships with the theory of homogeneous multivariable polynomials are established. Even when slices or projections are used, the resulting 21) matrices arc generally not svmmctric, so that the general nonsvmmetric eigenvector problem is involved. Other relatively virgin areas ofHOS research include: extensions of HOS to nonstationarv processes, truly adaptive algorithnls" eftlcient algorithms for nonlinear systelTI analysis, robust estimation algorithnls, applications in point processes" synchronization and multiuser problems in communications, and performance analyses of algoritll111s.
Cauchy r. v. has infinite variance and is a special case of an alpha-stable r.v. It is easy to create a Cauchy r. v. as the ra60 of two (possi blv correlated) Gaussian random variables, and Feller [1 08J shows how the Cauchy r. v. arises in an example with rotating mirrors. Stable LV.'S result from generalized central limit theorems [469], and are
xtn
characterized by four paranletcrs: scale, location, the characteristic exponent (a), and a skewness index (P) [293, 348, 469 J. The exponent satisfies 0 < a < 2, where a = 2 corresponds to the Gaussian and ex. = 1 corresponds to the Cauchy. The skewness index satisfies -1 $ P~ 1, with ~ = Oindicating synlnletry. The non-Gaussian stable processLs are characterized by their infinite variance; indee d , E! xiI' = 00 if r ~ a. Hen c c , 0 n c m us t use lower-order (1" < a) rather than higher-order 1110111ents to study these processes [293 J. The non-Gaussian alpha-stable process lllay be considered impulsive, and at least in the svrnmctric case, there arc connections with the Middleton B model [270 J that remain to be fully explored. A survey of parall1eter estimation techniques ll1ay be found in [293]. Although the lack of (.1 closed-form pdf, except in special cases, has made analysis difficult, numericallv stable ML estimators arc discussed in [294J. Despite the "infinite variance" of these processes, they have found applications in areas such as astronomy (gravitational fields) [469], econometrics (income distributions) [255J" modeling of radar data [294, 418], and Ethernet traffic data r447 J; several applications in the physical sciences are discussed in [181].
Good data windows give a much
less biased estimate of the
spectrum than the periodogram. In the context of linear svmmerric stable processes, idcntifiabilitv of mixed-phase Al~A models was established in [252]; in [389J, it \V~lS shown that normalized HOS could be used to estimate these paranleters, extend-
ing the earlier work of Davis-Resnick, and Mikosch et al. Alpha-stable processes 111ay be used to model very impulsive noise, and they can be suppressed (to SOBle extent) using the usual tools of ranks, weighted medians, and order statistics. Locally optimum detectors lllay also be used [293 J; another alternative is to use data-adaptive nonlincaritics [388 J. Impulsive noise suppression is particularly important for compression and dvnarnic range reduction. Model validation is important, and several ideas are discussed in [294 J and [295]. Differentiating between nonlinearity and nonsrationaritv- mav- be 1110re .
difficult than in the finite variance case [87 J.
Infinite Variance Models
Heavy-tailed non-Gaussian processes, particularly the Gaussian mixture 1110del and the Cauchy LV., have long been used to develop and test signal-processing techniques that are robust to impulsive noise [194 J. The
Fractal-Point Processes Recent papers by Willinger et al. [447J show that Ethernet traffic data are self-similar and alpha-stable, so that the
71
standard Poisson 1110del and conventional analysis (44J are no longer adequate. The self-similarity naturally leads to wavelet-based analysis, sec, e.g., [2]. Semi-parametric techniques, based on log-periodogrd111 regression, arc proposed tor estimating the fractal dimension in [277J, and fractal-point process models have been proposed in [14,219, 344], but several interesting analysis and synthesis problems remain open.
System Identification and Tests for Non-Gaussianity and Linearity [itendra K. Tuunait, Auburn University System Identification
Svstcm identification is the tield of mathematical modeli l~g of systems and signals from cxpcri mental data (377]. In signal-processing applications, system-identification methods arc used for linear prediction, adaptive filtering, noise and interference cancellation, parametric spectral estimation, inverse and forward modeling, and numerous other objectives. In systenls and control applications, models obtained by svstern-identification approaches are used for controller design, system simulation, and prediction. The system-identification methods are applicable to both cases, when input-output data of the systenl under investigation arc available J.S well as when one only has the system output measurements (time-series analysis). The area otsvstcm identification has been an active research area fur past 30 to 40 years. Most of the t()CUS has been on 5150 linear models and on scalar stationary time series, mainly because of its wide applicability and partly because of its analvtical tractabilitv. The available methods have been w~lI analyzed in ~xcellent texts such as [377], [244], and [245J .Thc text by Widrow and Stearns contains a wide range of applications [450]. A typical approach is to choose a 1110del structure with fixed (order) order, e.g., state-space models with known state dimcnsion, autoregressive moving average (AluV1A) models with known AR. and MA 1110del orders, l\tlA models, ctc., and then turn the system-identification problem into one of paranlerer estimation. The choice of the model structure is dictated by the intended application. For instance, [450J favors using MA models for adaptive signal processing in applications where the stability of the fitted 1110del is parall1oullt. A large number of methods exist for paralneter esti matir in including least-squares, prediction-error minimization, Ml.. , instrumental variable methods, output error minimization and others [244, 245, 377]. A complete system-identification methodology should, however, include an iterative process of model structure determination, paranlcter estimation, and 1110del validation f244, 377]. The problem of MIMO SystC111 identification has proved to be more complex, Unlike the scalar (5150) case, for MIMO ARMA models with known orders the representation of systelTI output measurements in ter111S of Al~ and MA matrix coefficients is not necessarily unique. This lack of uniqueness c a n lead to ill-conditioning in paranleter estimation. A possible solution is to use a canonical parameterization requiring knowledge ofcertain structure indices that are difficult to determine in practice [152]. An interesting solution to MIMO model identification (including ARMA paralTIetcr estimation) via a subspace-based realization approach using state-space formulation has recently been prop( ised [438 J. It is applicable to both input-output ('"l.deternlinis-
Time-frequency distributions have recently found applications to radar and sensor-array processing. II
MultiplicQtive NDise Just as uonlinearities give rise to non-Gaussianitv, they also lead to nonadditive noise. For example, if the received signal, X(ll) = S(ll) + Jl'(/~), passes through a ZerO-111ell1ory nonlinearity (ZMNL) (the receiver amplitier), and if the signal, J(lt), is weak relative to the noise, lv(lz), the o bs e r v e d s ign,-ll C ..m be w r i tt e n as y(ll) = J(/l) [8 + ...{f(ll)] + l'(ll), where 8 is a paranleter of the ZMNL. The noises P(ll) and g(ll) are now, in general, correlated, non-Gaussian, and have nonzero means. Multiplicative noise is encountered in speckle imagery [40], fading channels [141,324], underwater acoustics [99], and lidar and radar [29]. An interesting approach is taken in [318], where the signal is a harmonic (i.c., line components}, the noises are modeled as being nonrandom ; and error bounds on the frequency estimates are developed. In the case of a harmonic signal, and stationary noises, conventional spectral analysis of the data ('l.cyclic mean") or of the squared data ("'cyclic variance") have been proposed and analyzed in (467]; fourth-order cumulants were used in [99]. Cramer- Rao bounds were established in [ 118], [466], and [385]. Some paranleter estimation problems are discussed in [384 J. Note that all these papers aSS111ne that the additive and multi plicarive noises are independent. The detection of the weak signal, S(/l), fr01TI the observed data, )1(/l} = 8s(/l) [1 + ~Cf(/~)] + l'(/l), has been considered both for the random and nonrandom cases in [378J, [31], [9],and [126], but much more work remains to be done (e.g., temporally correlated noise, and "nonweak" signals).
A WWVV link to more information 011 non-Gaussian processes and on hi.qlJct order statistics: http://wvt/\V.C0111111.uni-brct11cn.dc/HOSHOME
72
tcrcst to investigate the nature of the givLll signal: whether it is a G~l~lssiall process and, ifit is non-Gaussian, whether it is a linear process.
tic") models with noisy output measurements as well as to multivariate time series ('"\tochastic" models). Svsterns and techniques not captured by the above formulanons (stationary linear time series, linear SYStC111S with noisy output 1~lcasure111cnts but noise-free input measurements, time-domain approaches) have also received considerable attention in recent years. Some representative examples include: ~ Errors-in-variables models: These are models where both input and output measurements are noisy. Hi bzhcr-ordcr statistics have been used in [135], .[431], and [434]; second-order statistics and SUbspace mstrull1ent-al variable methods in [38l J; and cyclic and/or higher-order spectral analysis in [135 J and 415]. ... Nonlinear svstcms: Volterra svstcms have attracted con s i d era b I~ a t ten t i 0 11 [ 2 8'1 ]. M () reg e 11 era 1 Hammerstcin svstcrns have been considered in [3271. Time-series models have been treated in detail in [412]. A Frequency-domain approaches have been investigated
Gaussianity Tests
Several tests have been devised on the basis of the tact that the hisrhcr-ordcr cumulant spectra f43 J of Gaussian proD . cesscs vanish. One of the earliest tests based upon testing of the signal bispcctrurn is given in l329J. Hinich r 168 J has simplified the test of [329J by using the known expression for the asvmptoric covariance of the hispccrrurn estimators. Notice that a vanishing bispectrum does not necessarily irnplv that the underlying signal is Gaussian; it mav result from the fact that the signal is non-Gaussian vvith zero bispcctrum. Therefore, a next logical step would be to test tor vanishing rrispcctrurn of the record. This has been done in [272] using the approach of [ 168 J~ ext ens i 0 11 S () f r 3 2 9 Jar e t () 0 C0 rn PIi cat cd . Computat ionallv simpler tests using C.C.in~e~rated polvspcctrurn n of the data have been proposed In [. 4 29 1. T h e i 11 t c g rat e d p () IYs pc c t r U111 (b Is p c c t r U111 or trispcctrum) is computed as cross-p()\ver spcctrunl and it is zero for Gaussian processes. Alternatively, one nlay test hilTv her -()r dere II 111Ul ant fun c t i()n s ()f the d a t a ill time-domain. This has been done in [1361. Other tests that do not rely OIl higher-order cumulant spectr~l of the data 111~lY be found in (412 J.
in [432], [433],and [ 361]. Approaches of [432] and [433) do not require explicit noise 1110deling.
A. for time-series models higher-order statisricx-bascd approaches have attracted considerable attention due to their ability to (blindly) idcntifv nonminimurn phase and/or nOl{causal models [292., 435].
Gaussianity and Linearity Tests
Linear parametric models of stationary random processes, whether signal or noise, have been found to be usef\..11 in a wide variety of signal-processing tasks such as signal detection, estimation, filtering. and classification, and in a wide variety of applications such as digital COl11rnunications, automatic control, radar and sonar, and other engineering disciplines and sciences. Parsimonious b 'r par ametr ic models such as Alt.., MA, AR_MA. or state-space, as opposed to impulse-response modeling, have been popular together with the assumption of Gaussianitv of the data. Linear Gaussian models have lOl1 bU been ~iolninant both fCJr siznals as well as for noise processes. Assumption of Gaussianirv allows irnplcmcnration of statistically efficient paC.l111eter estimators such as ML estimators. A stationary Gaussian process is C0I11plctelv characterized by its second-order statistics (autocorrelation function or equivalently, its po\ver spectral densitv-s-Po D) and it can alwavs be represented by a linear process, Since the P 51) depends only 011 the magnitude of the underlvine transfer function, it docs not .yield .. b information about the phase of the transfer function. Determination of the true phase characteristic is crucial in several applications such as seismic deconvolution and blind equalization of digital communications channels. Use of higher-order statistics allows one to uniquely idcnt i fv non 111 i n i 111U III - Phas epa r a n1 e t ric 111 0 del s . Hi~:rher-ordcr cU111ulants of Gaussian processes vanish; b hence if the d~lta ~lre stationarv G~lL1ssian, a 111ini-
Linearity Tests
For a stationarv time series one can define a 11< irrn alized bispcctrum, c~lled bicohcrcncc or skewness fun~ti()n [292 L which turns out to be a (nonzero) constant tor all
bifrequencics if the signal is linear non-Gaussian with nonvanishiug bispccrrurn. This property has been used bv Subba R~~() and Gabr [329] to design a statistical test f~r lincarirv. Hinich [168] has "simplified' the test of [329]. Notice that this test is useless if t1~e siglUl is non-Gaussian with zero bispccrrum. Therefore, a next logical step would be to test ~l normalized trispcctrurn (rricohercncc function). This has been done in [272 J using the approach of [168 J ~ ext~nsions of [32~ J ar~ t~)~) complicated. The approaches of [329J ~lnd [1.68 J will tad if the data are noisv. A modification to [329J 1S presented in [428] when additive Gaussian noise is present. finally, other tests that do not rely on higher-order curnulant
0
mum-~hase
(or ma.ximum-phase)
on(~ can esti111~lte. Given
s peCtl-~l of the record 111ay be found in [412].
Advanced-Sensor Signal Processing Ncbomi, The University oflllinois at Chicano O~!er the last several vears, advanced sensors have been int rod 11 ce dan dec; 111 bin e d w i t h s tat i s t i ( a 1 SC11sor-array-proccssing ll1ethods. These sens~)rs exploit lllorc physical infornlation and ~lre orders (~t 11lagnlt~ldc
A1/'VC
l~odcl is the "~est" that
these [lcts, it has been of
1110re sensitive than traditional sensors. TheIr usc has 1111proved the pert()rnlanCe of current systelllS, increased
S0111e 1n-
73
the a ccur ~1 c y 0 f the clas s ()f U11 b i as c d para m e t e r estimators). Quality measures are defined f( ir estimating direction and orientation in 3l) space, including nleal1-sql1'.lre Jngular error and covariance of vec-
Just as nonlinearities give rise to non-Gaussianity, they also lead to nonadditive noise.
tor-angular error. Lower hounds on these measures give
concrete results on expected perf irmancc. A fast algorith1l1 for direction finding using an electro-
the scope of signal-processing methods, and created entirely new applications. Four examples are presented in the following.
magnetic vector sensor has been proposed in [284] and [287]. Inspired by the Poynting theorem, it t()n11S the cross-product of the electric field vector with the complex conjugate of the magnetic vector and averages over time. The asvmptotic performance under general conditions is shown to be close to optimum. A minimum-noise-variance bc.unformer for interference cancellation emplovinj; a single electromagnetic vector sensor h .1S been proposed in [283 J. It assumes that the direction and polarization of the source arc known. This enables suppression of uno irrclatcd interference, even if it C0111CS fr0111 the S..u ne direction as the source, based on polarization as well ..is location differences. Analysis ofthe signal to interference-plus-noise ratio showed the beamformcr to be very etfective, particularlv when the signal and interference are diftcrcntlv polarized. An arrJy ofspariallv distributed vector sensors (;111 additionally exploit time delays an10ng the sensors. In gcneral, arrays of vector sensors can achieve better performance than scalar-sensor arrays, while occupying less space. Alternatively, they can be spaced further apart to increase aperture and hence performance wi thour introducing ambiguities [390" 453]. S0111C high-resolution direction-finding algorith111s have been developed for electromagnetic vector-sensor arrays r 171., 173, 230]. Preliminary results on the application ()f vector sensors to communication problems can be found in 470 j and [65].
Electromagnetic Vedor Sensors
Each element in all electromagnetic vector sensor, introduced in [284] and [287] for estimating the direction and polarization of electromagnetic sources, measures all six electromagnetic field cOll1ponents at ~l single point. In contrast, conventional antennas measure a single con1ponent of the electric field. Vector sensors are commerciallv available and actively researched. ENIC Baden Ltd. in Baden, Switzerland, manufactures them for J. 75 Hz-30 M.Hz frequency range, and Flam and Russell, Inc., in Horsham, Pennsylvania, for 2 MHz-30 MHz. Lincoln Labs at MIT has performed prcliminarv localization tests with the vector sensors of Flam and H..ussell, Inc. [156]. Other research on sensor development is reported in
l189] and [190],
Electromagnetic vector sensors are sensitive to both the direction and polarization information in the incorning waves, The polarization provides a crucial criterion for distinguishing and isolating signals that 111ay otherwise overlap in conventional sc..i lar-sensor arrays. When a single vector sensor is used for direction finding, it has the following advantages and capabilities: ~ Direction estimation in 31) is possible with sensors occupying very little space ... Estimation ofthe directions and polarization ellipses of up to three sources [172, 175] is possible ... Resolution of very closely spaced (even co-incident) sources based on polarization differences is possible A One is able to process wideband signals in the Sa111e \vay as narrowband signals ... One can handle sources with either single or dual-message signals & Vector scnsr irs have isotropic response A There is no need for location calibration and time svnchronization ,1S there is among different sensor clements of &:1 conventional spatial array SOBle of these advantages result from the fact that no time delays are used, In contrast, conventional scalar-sensor methods require a 21) array for direction finding in J 31) spacc, need accurate location calibration and time synchronization, and require much higher COlllPUtat io n a! cost to process w ide band r a the r than narrowband signals. The optimum accuracy of source para111eter estimation for vector-sensor arrays is analyzed in [284] and [287] in terms ofCramer-Rao bounds (absolute limits
r
Acoustic Vector Sensors
Acoustic vector sensors measure the acoustic pressure and all three conlponents of the ac( rustic particle velocity vector at a given point; standard methods measure only the pressure. The use of acoustic vector sensors for array processing has been proposed in [2HS J and [2H6 J. These references introduced 111CaSUrC1l1ent models, derived fast direction-estimation algorithms, ..i nd presented general Cramer-Rae bounds on direction paranleters. These developmcnts have coincided with a surge of interest in particle-velocity sensors r 27] and im provcn1ents in fabrication techniques 197J to make vector-sensor arrays a practical reality [290]. Since ~1 vector sensor extracts directional information directly ti'0111 the structure of the velocity field, it can, for example, locate up to t\VO sources in 31) space [175]. By making use of this extra information, arrays of vector sensors improve source localization accuracy while using smaller array apcrtures. Bcamforming and Capon direction-estimation procedures with acoustic vector-sensor ~l1T~l\'S have been dev e I()P e din [I 60 ]. I t \vas s h ()w 11 t h '-1 t the extr a
011
74
velocity-field information re1110VeS all ambiguities such as grating lobes. This allows the use of simple structures for which [1St direction estimation algorithnls exist, e.g.., a uniform linear arrav, to determine both the azimuth and elevation of a source. It also 111e~lnS that spatially undcrsamplcd arrays of vector sensors can be used to increase aperture and hence performance. A fast esti rnation algorithn1 that makes uses of this property was developed in [455 J and another algorithn1 for arbitrary array shapes appears in l454 J. In [158] the effect of sensor placement on the directi< H1 estimation performance of all array of acoustic vector sensors has been considered. Using the Cramer- It~10 bound 011 the paran1eters of a single source, conditions were derived that minimize the lower bound on the asvmptotic l11ean-sl]uare angular error, and that it is isotropic. The increase in estimation accuracy obtained hy vector sensors is greatest for linear or planar arrays (as opposed to 31)),\ small number of sensors, and low SNIts. By exploiting velocity and pressure information, any vector-sensor ~llTay,\ a popular linear array, can be used to Ul1ambiguously determine both the azirnutb and elevation of a single source. Vector sensors have been succcssfullv applied in other areas such as hull-mounted applications" where they overcome serious problems in detecting low-frequency emitting targets [159]. (At low frcqucncv the vessel's hull is acoustically flexible" leading to a vcry 10\V pressure signa.! but a strong velocity signal.)
[319 J was to reduce the expected location error, which was accomplished by moving the sensor in directions opposite to the gradients of the Cramer- Rao bound. Monitoring of disposal sites Oil the ocean floor using chemical sensor arrays was considered in [184 J. Such sites have been suggested as suitable for the relocation ofdredge materials fr()~l~ harbors and shipping channels, where th~ir buildup has a detrimental impact upon <.:conol11Y and military security. Algorithnls t()I" detecting possible release of pollutants ncar these sites were developed, and their pert< irmancc was analyzed. The results were used to optimally design arrays with respect to the numbers of sensors and time samples ~lS well as sensor locations.
Superconducting Quantum
Interference Devices (SQUIDS) SQUIl)S arc the 1110st sensitive detectors of magnetic flux currently available. Thev find broad application" from measurements of nl~lgnetic fields induced by brain activitv to nondestructive evaluation of materials and the location of underground objects .uul structures. Their 1110st irnporranr cornmcr cia l USt is in 111agnetoencephalography (~1 E(~ ). lvl E(~ is concerned wi th n1apping electrical activity in the brain by measuring the induced external 111agnetic field [151 J. ME(~ sensor arrd)'s measure cxtracr.uii.il mugnctic fields of only a few hundred femro'Tcxla-e-a billion times smaller than the Earth's steady 111agnetic field. Together with electroencephalography (EEG)" which measures electric potentials on the scalp, ME(~ has emerged ax a powerful noninvasive too} for the localization and tracking olclcctrical sources in the brain. 'The solution to this problem is otgreat importance in the diagnosis and evaluation of various brain disorders such as cpilcpsv, and for furthering understanding of brain function. In [274] the MUSI(~ algorithnl was applied for localizing brain sources modeled as current dipoles. Maximum-likelihood techniques have been developed in [93] to account for unknown spatiallv correlated noise" predorninanrlv due to sporadic background activity in neurons. The optimization of NIEG sensor arrays to minimize the lllean-square error of dipole location estimates has been proposed in [176]. SQUIl)s have opened other new applications of Sigll~ll processing, such as detecting the wake of a ship using an airborne systcn1 [282]. III conclusion, it is expected that the use of novel sensors will continue to be ~1 source of new applications and further developments in sign~11 processing.
Chemical Sensors Chemical sensors arc useful for detecting explosives, drugs" and leakage of hazardous chemicals, and for 1110I1itoring the environment. They arc manufactured by C0I11p au i cs such JS Cvr ario Sciences, Inc. ~ Science Applications International Corporation (SAI(~); JnJ [avcor in San l)jcgo, California. Array-processing techniques using chemical sensors have been proposed in
[ 184]., [2 88 ]'\ :111 d [ 3 19 J. CO111p arc d \tVit h a 11i m a 1 chemoreception, these techniques have the advantage
that they share information and can be optimized. Methods ten" detecting and localizing vapor-emitting sources were developed in [288]. Based on the diffusion equation, distributions of vapor concentration in rime and space were derived for various environments. The results were used to develop statistical models of the array measurements. Maximum-likelihood estimates and general-likclihood ratio tests were derived to estimate the u n _ known source parameters and detect the existence of a s 0 L1 r ce. The per fo r m ~l n ce \\1 a san a Iyzed u s i 11 g Cramer-Ran bounds and probabilities of detection and L
A WWW link to tile nutlior oithe above section: http://\vv\''\V.cccs.uic.cdu/-nchoraij
false alarm.
Sensor-Array Signal Processing
Employment ofn10ving sensors \vas proposed in [319J.
A. Lee SJPindlchurJt,
A single nloving sensor CJn achieve the task ofn1ultiple stationary sensors by taking ll1easurenlents at different locations and tin1es. Its path can be planned in real tinle t<) optinlize a pert<JrnlanCe criterion. The criterion used in
Br~T!J(l1'1t YOltllf}
University
The processing and n1anipularion ofdara received by a spatiaIlv. distributed arrav. ofsensors has been an active area of research in the signal-processing COnl111Uniry r()r \vell over
75
30 years. The long-lasting attention devoted to this area can be traced to the large number of applications where data is collected in both space and time. Figure 5 depicts a generic scenario in which energy (possibly acoustic, electromagnetic, seismic, erc .) from two ",.,; sources is received by a senSource 1 sor array . There are a number of possible objectives of such ... 5. A Generic array signal-processing scenario. a system, with the most important being: Fig. 5 as a separate term in the above sum; i.c., we would ... SourceLocalizatilm-determine the azimuth and elevalet s., (t) = S 2 (t - T). The outplltS of an array of m eletion angles to the sources, and possibly the range to the ments can be stacked in a vector, as follows : sources as well (if they are located in the ncar-field of the array) ; information on source velocity can be obtained by Xl If measuring frequency shifts, or angle and range rates of x(t) : = (;a (8".)S,, (t) + o(t) change.
••
(t)]
[
... Source Separation-determine the signal waveforms transmitted by each source; the fact that the energy from each source arrives from different directions allows these waveforms to be separated even if they overlap in time and frequency . ... Channel Estimation-determine the space -time propagation effects between the sources and the array; estimate where reflections occur or how much the transmitted signal is spread in time and angle . Which of the above three objectives is most important depends on the application. In active radar and sonar, the received waveforms are approximately scaled and delayed versions of a known signal, so it is the location (and motion) of the sources that is most important. In a communications system, it is the information-bearing waveform and not the location ofthe sources that is critical. For seismic applications, the source signals arise from explosive charges. The received energy is used to characterize the propagation channel, whicll"in this case provides information about the structure of the ground . To be more precise, and to aid the discussion that follows, we introduce some simple mathematical notation . Referring to Fig. 5, in the simplest case the sources and array lie in the same plane, and the sources are far enough from the array so that the arriving signals have planar wavefronts. For this case, if the signals are assumed to be "narrowband" and there arc a total of d sig nals, then the output of array element p is given by
k=1
(10) T
where a(8 k ) = [a , (8k )- •• all/ (8k )] denotes the vector array response, and we have added a term, o(t), to account for unrnodelcd measurement noise and interference . Using this notation, we can give concrete examples ofthe three objectives listed above. For example, in source localization, we would use sam ples of the array output x(t, ),. ·· , x (t N ) to estimate the DOAs 8, ,.· · , 8 d of the sources. Source separation involves extracting samples of one (or more) of the signals, s/: (t l ), " ',S k(t N ) , from the array data. In channel estimation, we may have Sk(t) = u ks(t - T ,,), in which case we are interested in the amplitudes, U "., and delays, T!., of the various arrivals (perhaps as well as the DOAs). Early research in sensor-array signal processing, conducted mainly in the 1960s and 70s, was based on the observation that, if the array is composed of identical uniformly spaced elements (i.e., a uniform linear array, or ULA for short), then a direct analogy exists with temporal sampling. The array elements perform a uniform (one-dimensional) spatial sampling of the wavefield, and the spacing between dements determines what spatial frequencies can be uniquely represented. Signals whose wavefronts are nearly parallel to the ULA (8 se 0°) have low spatial frequencies; as lSi ~ 90° increases, the spatial frequency of the signal increases and reaches a maximum at 8 =±90°. A spatial version of the Nyquist criterion states that the array response vector a(8) of a ULA is unique provided that the elements of the array are separated bv no more than one-half the wavelength of the signal. Using this analogy with temporal sampling, it is possible to design spatial filters that pass signals with certain spatial frequencies (i.e., that arrive from certain directions) and attenuate others . However, unlike temporal filtering, it is usually not known a priori what spatial fre-
If
."Cp (t) = Ia,,(8!.) s!.(t)
«; (t)
(9)
where 8 k represents the DOA of the wavefront from source k, and a" (8,:) is the (complex) response of eleruent p to a signal arriving from that direction. In the general case, we would treat the reflection of source 2's signal in
76
quencies arc occupied by signals of interest. Thus, the C111phasis was on data adaptive methods that estimated the directions to the desired user( s) prior to computing the appropriate spatial filter coefficients. Such algorithnls arc usually referred to as adaptive bcamformcrs, since the desired spatial frequency response is a narrow beam "steered' towards the source of interest. The problem of estimating the source directions can also be addressed using this analogy with temporal sampIing. A point source located in the far field of a UIJA at 110A e produces the following output at sensor !(:
The further integration of
computational wave-equation solutions and signal-processing techniques win pose many challenges and rewards in the future..
the sources are often noncooperative and little 1l1ay be known about the signals they generate. In such situations, discri ruination based on only the spatial properties of the reccivcd signals is necessary, which in turn requires that the response of the array be accur . i tclv calibrated with respecr to 8. The sensitivity of subspace based methods to array calibration errors limited their usefulness to S0111C degree, particularly in underwater environments where the propagation medium is severely nonuniform. As militar)' funding has waned, and as the field of personal wireI e ss co m m u n i c ~1 t i ()11S has e m erge d, in t ere stin applications of array signal processing to comrnunications systen1S has blossomed in the past few years. The use of multiple antennas at the base station Of.1 wireless network offers a processing gain that C~111 increase base station range and improve coverage. By exploiting the spatial selectivity of an antenna array, co-channel interference 111ay be reduced, which in turn can be tr .i ded tor increased systenl capacity. 111 addition, communication channels can be multiplexed in the spatial dimension just as in the frequency and time dimensions, This is often referred to as spatial-division multiple access (Sl)MA). A distinguishing aspect of using antenna arrays in C011111111l1ications applications is that, due to the cooperative nature ofsuch systems, significant information about the source signals is available and can be exploited for spatial processing. For example, it nl~lY be known that training sequences are present in the data, or that the signal is digitally modulated with a known symbol constellation and pulse-shaping filter, or that the signal has a constant amplitude envelope, etc. Each of these properties can be used by a systenl e1l1ploying multiple antennas to achieve source separation without the need for explicit array calibration data. Algorith111s that use this approach are reIcrrcd to as "blind" source separation methods (see the sections by Cardoso and Tong). Such techniques can also be extended to perform blind equalization of propagation channels with significant delay spread. A breakthrough in this area carne in the earlv 1990s, when it was ShO\VI1 that if a pulse-amplitude modulated signal is received by an array of antennas, then the channel can be identified using only second-order cvclosration.uv statistics. Although blind methods can eliminate the need for calibration information, signiticant performance improvel11ent CJn be achieved if reasonably accurate calibration is available. Techniques that exploit both the spatial
( 11) where 8 is the distance between adjacen t sensors and A is the wavelength of the signal. Viewed as a function of It, the vector of samples from the array is seen to be a cornplex exponential in noise. With multiple sources, the problem of DOA estimation is seen to be equivalent to the classical spectral analysis problem of determining the frequencies ofa collection ofsinusoids in noise. This connection has led to nUl11erOUS "cross-over" techniques, the most popular of which are those based on simple Fourier analysis with windows (Bartlett, Hamming, Chebyshev, ctc.) used to control resolution and sidelobe levels. U 11like their counterparts in temporal frcquencv estimation, the rcsol ution of these methods cannot be increased bv collecting 1110re data fr0111 the array; the ability to resolve sources spaced closely in 8 is limited by the aperture of the ;.lrray, which is tvpicallvfixed, In addition, the fixed ~lper ture can produce large sidelobes in the spatial frequency spcctrUL11 that lead to inconsistent l)OA estimates when more than one source is present. To overcome some of these deficiencies, techniques based on maximum entropy, autoregressive modeling, and linear prediction were proposed, with mixed success. A dramatic shift in emphasis in sensor-array signal processing occurred during the 1980s with the introduction ofthe so-called.HtbJpacc-basedtechniques. These methods are based on the observation that, if the number of sensors is strictly greater than the l1U111ber of sources, the signal con1ponent of the array data lies in a low-rank subspace. Under certain conditions, this subspace uniquely identifies the D()As ofthe signals and can be determincd quite accurately using, for example, a numerically stable singular value decomposition. A larg~ number of parametric estimators have been developed based on the subspace idea. These techniques enjoy a number of advantages over earlier methods, including statistical consistency and very high resolution. NU111er0l1S extensions to the simple 1110del outlined above have been considered, including generaliz~ltions to widcband or diversely polarized signals, techniques for handling cortelated or perfectly coherent signals., or arrays whose response, a(8), is not precisely known or calibrated. The main driving force behind research in ~llTay signal processing in the 1980s was provided by militarv applications, primarilv in radar and sonar. In these applications,
77
- 50 L -
-501L.----- - -- - ' , 0 0.1 0.2 0.3 0.4 0.5
---J ..
Output of one of eight EKG electrodes (left); reconstruction of the mother's EKG contribution (middle), ond of the fetus' EKG contribution (right) using all eight electrodes.
~ 6.
and temporal properties of the received signals arc thus of high interest at the present time. Joint space-time processing in radar and sonar applications is also receiving added attention, as the speed and throughput of multichannel DSP processors continues to increase. Further advances in computing power will bring other difficult array signal-processing problems to the forefront, such as soul:ce localization an~i separation for wideband signals, parameter estimation for sources with distributed spatial spectra, and matched-field processing for sonar applications. There is a large body of published literature in the area of sensor-array signal processing available to the interested reader. The references listed below are good starting points because of their tutorial nature and their extensive bibliographies: ~ General books: [161], [311], [185] ~ Connections with spectral analysis: [197], [382J ~ Adaptive beamforming [77], [439J ~ Applications to radar systems [104J, [163] ~ Subspace methods [299], [34], [214] A Applications in communications [298], [34], [306] A WlVW link to the author of the above section : http://www .cc.bvu.cdu/ -swindle
Blind Separation of Sources [can -Francais Cardoso, Ecole Natumale Sllpil'ieu1'c des T tfLCcommlmicntions (ENST)
Objectives Source Separation
Source separation consists of recovering a set of "source signals" from the observation ofseveral mixtures of these signals . This problem typically arises when the available signals are obtained at the output of an an'I1JI of sensors that temporally and spatially samples signals emitted at different locations in space . In general, each sensor receives a mixture ofall the source signals : if there are fewer sources than sensors, the received mixture ofsignals is (in general) linearly invertible: this is the case of)patial diversity discussed in the following section by L. Tong. Figure 6 shows an example ofseparation ofelectrocardiography (EKG) signals . The left panel shows the out-
panel) to be separated.
pllt of one EKG electrode located on the abdomen ofa pregnant woman : the fetus heart beat cannot be easily distinguished. The data set [88] contains the Olltputs of seven other sensors placed on the mothers chest and abdomen . A source-separation technique allows the cont rib uti 0 ns fr 0 m the mother (middle) and from the fetus (right
Blind Source Separation
Exploiting an array of sensors to t()(US on a particular source signal while rejecting other "interferers" is .1 standard task in array processing (see the sections by Swindlehurst and Krolik in this article). The blind source separation (1355) problem consists in recovering all the sources without using prior information about the channels; i.e., about the transfer function between the sources and the sensors. BS5 is an "output-only" technique in the sense that neither source signals nor training sequences arc available: all ofthe available information is contained in the observed data themselves. Two seminal papers on this topic are those by Jurtcn ct al. [188] and Comon [74]. The major strength of the blind approach to source separation stems precisely from the fact that a precise model of the underlying physical phenomena, e.g., wave generation, propagation, and transduction , is not required. Thus, for example, BSS can be applied to uncalibrared arravs in situations where calibration is difficult or impossible or when physical modeling is overly complicated or unreliable. The basic idea ofB5S is that one makes up for the lack of information about the channels by assuming that the source signals are (statistically) independent. Statistical independence is a relatively strong assumption but it is plausible in many contexts because it arises from a lack of phy sical relationship between the various sources. The simplest source separation model assumes an n-sensor array receiving signals, x, (t), . .. , x" (r), from as many sources, .II (t), . .. , .I,,(t ), and an instantaneous and noise-free mixture :
{/
..
II
The mixture coefficients, a .., can be collected in an n x 11 " the 11 source signals and "mixing matrix," A. Collecting the n a~Tay outputs into 11 X l~ column vecrors. the BSS model reads more concisely as x(t) = As .
78
both the unknown systelTI., A, and to the distribution of the independent sources, s; the third objective function arises when one imposes the addition constraint that the recovered signals should be uncorrelated. This can be understood as follows: SUl1l111ing independent random variables "tends" to produce a more Gaussian result (think of the central limit theorem) so that driving y a\vay from Gaussianity n1ay be thought of as away of recovering the original source signals. The ML principle gives rise to measures of independence, non-Gaussianity and entropy (as listed above), which are based on information-theoretic quantities. Because they 111ay be difficult to manipulate, one often re-
A 7. Mixing and separating. Source signals: 5; array output: x, es-
timated sources: y.
If the mixing matrix, A~ were known, source signals could cas ilv be recovered by direct inversion: s(t) = A -I x( t). Conversely, if the source signals were avai lable , the mixing matrix could be easily estimated by a simple input-output identification procedure. The challenge of BSS is that of "double blindness:": neither s(t) nor A is available in the model x = As(t). Algorithnls for the blind separation of sources try to determine a j-eparating matrix, B., to un-rnix the observation vector into y = Bx (see Fig. 7). Ideally, the separating matrix should approximate the inverse of the mixing matrix. The next section outlines some statistical ideas for
Estimating signals under various
diversity receptions is currently
an active research area.
accomplishing BSS.
sorts in practice to more tractable approximations, e.g.., high -order correlations (triple, quadruple correlations), high-order curnulants, or pair-wise correlations between nonlinear functions of.'" I .,... , Y n .
Principles
Before listing a few of the ideas behindBSS algorithnls., it
is instructive to explain why the simplest idea-Ending a 111 a t r i x t hat In a k est h e 0 Ll t put s uncorrelated-does not work. The reason is that decorrclation is a svmmetric propert..Jv : Corrtv =0 • " I' I also implies that Corr( V . , V .) = O. Therefore, there are . J • only as Inany decorrelation conditions as pairs of sources, narnelv nin - 1) / 2.,\vhich is about half of the constraints needed to determine the n 2 entries of a separating matrix. Thus, pairwise correlations (second-order information) are not sufficient to solve the BSS problem: it is necessary to express statistical independence in a stronger sense. That decorrelation is not sufficient has an important consequence. Recall that for Gaussian var iablcs , decorrelation implies independence; it follows that Gaussian sources cannot be blindly separated because their independence boils down to pairwise dccorrelation. Therefore, SOiDe non-Gaussianirv is needed to achieve BSS. One Inay see BSS as the art of exploiting the non-Gaussianity of the signals and measurements. S0111e ideas for deriving source separation algorithllls are to adjust B in such ~l way that: .. The probability distribution of y is as close as possible to S0111C prespecified distribution of independent COlllPOnents, or A The outputs, )' 1 ., •.• ., Y 11 ' are as independent as possible, or .. The outputs are dccorrelated and as non-Gaussian as possible or as low-entropic as possible. All these objective functions can be derived from the application of the ML principle [50J under various assurnptions. The first objective function results from fitting x to the linear 1110del x ::: As where A is unknown and s has a fixed (hypothetical) distribution of non-Gaussian independent COl1lpOnents ~ the second objective function results from fitting to the model x = As with respect to
s epa rat i n g
v.:
Perspectives
J
~
Beyond the simple cases described here, blind source separation has been applied to much 1110re general models such as noisy observations, complex signals, nOl1square mixtures, and convolutive mixtures [50]. The latter extension often brings the BSS problem close to the problern of channel equalization and of systenl identification (see the sections by Giannakis and Tugnait in this article). Another interesting extension is to consider the case where the BSS model does not hold. In this case BSS olay be implemented as a data exploration technique for which one is interested in finding the linear transformation of a random vector, x, into y = Bx such that the C0111pOnents of yare as independent as possible. BSS is then seen as a device for independent cOll1ponent analysis (leA), which can complement principal cOlllpOnCl1t analysis (PCA). WWW links relevant to the above section: ... The author's web page: http://sig.ensr.fr/-cardoso/stutrhtnll • WWW links to independent cOlllponents analysis
1
(leA):
-lCA research group at the Helsinki University of Technology: hrtp.r/www.cis.hur.fi/projects/ica/ -Laboratory for Open Information Systems at the Riken Institute: http://~rwvv.bip.rikcn.go.jp/open/Welco[ne.htInl
-Conlputational Neurobiology Lab at the Salk Institute: http://\v\vw.cnl.salk.edu/-te\von/ica sub cnl.html A Miscellaneuous WWW links of relevance: http://sound. mcdia.mit.edu/--- paris/ica.html http://'N\\'vl.bnlc.riken.go.jp/sensor/AUan/ICA/
79
the cell-phone tower along major highways. (Imagine how much more you could hear at the cocktail party if you had an array of ears!) Recently, the so-called smart antenna technology has attracted considerable interest from both academia and industry (see a recent survey by Paulraj and Papadias [306]) . ... Spectral Diversity. Spectral diversity can be obtained in many ways. To counter frequency-selective fading caused by echoes, the transmission band can be divided into a number of smaller frequenc y bands through which modulated signals of different power are transmitted. This kind of multicarrier transmission is the basis for the OFDM (orthogonal frequenc y division multiplexing) system for digital audio broadcasting (D AB) . Frequency-hopping (FH) spread spectrum [374] is another way of achieving spectral diversity. Invented in the 1940s, this technique avoids hostile interference by changing the transmission band in a way known to the receiver but unpredictable to the jammer. ... Temporal Diversity. Diversity can also be achieved in the time-domain by transmitting multiple copies ofthe signal at different times or , in a more intelligent way, by transmitting the signal in some special waveform known to the receiver. A direct-sequence spread-spectrum signal gains diversity by modulating thesource with a special code sequence. When the received signal is sampled at a rate higher than the bit rate, we effectively obtain the transmitted symbol at a different time , which is analogous to spatial diversity where the transmitted signal is obtained at different locations. Different users can be separated if they use different codes. The exploitation of temporal correlation of the signal waveform provides a crucial property used in many signal-processing algorithms. See again [306] for discussions about space-time processing.
Source Separation and Diversity for Communications Lang Tong} Cornell University Source Separation and Diversity
Separating multiple sources is a fund amental signal pro cessing problem that arises in man y applications. An easily understood scenario is the so-called "cocktail party" problem where the objective is to separate one voice from others in the room. To a large degree , humans perfo rm this task remark ably well. We are able to distinguish different voices, and may even follow the conversation. The cocktail-party problem is germane to many similar applications in biomedical signal processing, geophysical signal processing and , most notably, in communication system designs . In wireless communications, for example, when the signal is transmitted over a nonideal channel, sophisticated signal processing is often required at the receiver to counter noise and interference from various sources. One of the major channel impa irments is multipath fading. The problem here is analogous to calling someone a hundred yards away in the Grand Canyon. Your friend will hear your voice and its echoes. He can separate your voice and its echoes unless, of course , you speak too fast. It will be much harder for him if someone else tries to talk to him at the same time. But this is exactly the problem in today's digital cellular system where the tr ansmitted signal is interfered not only by its echoes (multipath interference) but also by other users in the neighborhood (cochannel interference) . We face the source separation problem similar to that in a cocktail party. What makes it possible for us to separate and track different voices in a cocktail parry ! What features do we use] Can this process be made automatic] These questions touch upon some of the fundamental issues in source separation. Perhaps it is easier to see what makes it more difficult to separate sources. Can you still separate different voices with only one ear] Perhaps, but it is more difficult. What if you close your eyes? The loss of visual signals will definitely make it much harder. As it turns out, the key to source separation is diversity. To separate different sources, it is important to have different receptions of the signal. This can be done in different ways by exploiting the characteristics of the signal and its propagation medium. ... SpatialDiversity. Using sensor arrays is an effective way to gain spatial diversity. You can see the antenna array on
.'-
. Sl(t)
-
. . .EB+ n1(t) ·
Channel
Xl(t) ~
,---'-- -'--'-,
H
<,.,'
~(t)
Statistical Signal Processing for Source Separation
Estimating signals under various diversity receptions is currently an active research area. A general model for source separation is shown in Fig. 8 whe re sources {s i (t) } are propagated through a channel H, contaminated by noise {Sj(t )}, and received with diversity as {xj (t )}. The goal of source separat ion is to estimate one or all of the source signals from {Xi (t) }. Classical approaches to source separation are based on either the knowledge ofthe channel or the ability ofhaving access to the channel input so that the channel (or its inverse) CaI1 be estimated by sending "training" signals. Depending on the application, different criteria (such as minimizing the detection error probability or minimizing the mean-square error ) can be used to design the signal estimator. In recent years, there has been considerable intere st in the so-called blind-source- separation problem. Here, neither the channel is known a priori, nor is it possible to have access to the channel input so that training CaI1 be made (recall again the cocktail-party problem) . The merit of blind signal separation is twofold. First, there are cases
.:'
Source Estimator
' s~(t)
... 8.
Source separation withreceiver diversity.
80
when channel estimation by training is very difficult. Second, the transmission of Water: Column training inevitably reduces Sound-Speed • (rs,Zs) the transmission rate of inSource formation. Such reduction can be significant when training has to be pertarmed repeatedly. The key to blind signal sep,. aration is to exploit qualitative 3 Sediment; Dens ity = 1:75 g1cm ., information about the strucAttenuation =0.13 dBIA. ture of the channel and characteristics of the input 1580 mls sources. For example, source 1600 mls ..• Sub-bott om 3 signals in communications of..Density = 1,75 g/cm ten can only have a finite .... Attenuation = 0.15dB/A number of alphabets, which enable the separation of multiple sources. The statistical Z independency among sources is another condition that leads & 9. A typical scenario for passive sonar matched-field processing. to a number of effective undo the effects of coherent multipath one could actually source separation algorithms [50], among them is the exploit them to achieve dramatically improved perforwidely applied CMA [143, 416]. In a special issue of IEEE mance with the assistance of a numerical propagation Proceedings [242] to appear later this year, tutorials of model is the essence what is now known as matched-field blind-source-separation techniques and the ir appl ications processing (MFP) . The availability of inexpensive, are presented. For related topics on this growing field of computing to rapidly calculate numerical sohigh-power research, readers are also referred to a special issue (edited lutions of the wave equation is what has really driven the by G. Giannakis and G. Xu) on signal processing for adof MFP methods over the last decade. development vanced communication [127] and the recent book by Matched-field processing was first developed as a simPoor and Wornell [313]. ple generalization of narrowband plane-wave bearnforming wherein conventional array weights based on plane-wave "steering vectors" were replaced by rrepSSAP with Computational Acoustic and lica vectors " derived from the full-field solution of the Electromagnetic Propagation Models wave equation in a ducted channel. Historically, these Jeffrey [(roM, Dulle University techniques have been applied to the problem ofunderwater passive source localization [10]. A common set-up for Statistical signal and array processing ofsignals carried by passive sonar MFP is illustrated in Fig . 9, where acoustic propagating waves has traditionaUy been developed assignals in a shallow-water waveguide are received at a versuming simple plane-wave acoustic or electromagnetic propagation models. This is despite the fact that in many tical array of hydrophones from a distant source in the problems associated with sonar, radar, wireless commupresence of interference from surface shipping plus diffuse ambient noise. The objective is to detect and localize nications, and geophysics, complex coherent multipath propagation between the source and receiver is a domithe source in range and depth. The medium is described nant feature. The historical focus on signal processing usby a sound-speed profile within the water column toing plane-wave models has been a result of: 1) their gether with the bathymetry and geoacoustic properties of analytic simplicity, 2) elegant analogies between familiar the bottom. Because distant signals have numerous intertime -domain filtering/spectral analysis and plane -wave actions with the ocean boundaries , single-path beamtorming/field-direcrionalirv mapping, and 3) the plane-wave propagation is clearly not an appropriate fact that accurate numerical models for complex model here . However, given sufficiently accurate environmental information, the coherent sum of multipaths multiparh propagation were too computationally intensive tor signal-processing applications. Although difficulbetween source and receivers for different hypothesized ties with plane-wave approximations in coherent source locations can be predicted by numerical solution multipath environments are often dealt with by a variety of the wave equation and its boundary conditions. The of mitigation techniques, the performance ofsuch methmost basic MFP approach , known as Bartlett ods is inevitably upper bounded by the case where matched-field beamforming, is then to simply correlate multipath is absent. The notion that instead of trying to each ofthese replicas with the field measured at the array. .;
:'
81
ronmental conditions. In order to suppress ambiguous sidelobes, several variations of minimum variance (MV) adaptive bearnforming have been proposed [78, 215, 360]. The basic MV matched-Held bearnformer selects weights for each hypothesized source location that minimize output power subject to the constraint of unity gain for signals emanating from the desired range-depth point under the assumed environmental model. MV matched-field beamformers generally do provide lower sidelobe levels than the Bartlett processor, but often this comes at the price ofeven greater sensitivity to mismatch between the assumed and actual environmental conditions . To achieve matched-field localization performance that is robust to environmental mismatch, a number of approaches have been proposed, not only in the form of beamforming methods, but also by jointly estimating the source location and environmental parameters [73, 332] . One robust beamforrning approach that has been demonstrated to provide lower sidelobes and higher probability of correct source localization in the presence of environmental uncertainty is the minimum variance beamformer with environmental perturbation constraints (MV-EPC) [215, 216] . Essentially, the MV -EPC method minimizes output power subject to a set of linear constraints designed to maintain array gain for signals emanating from a hypothesized range-depth point but over an ensemble of'perrurbed ch
... 10. A Bartlett matched-field ambiguity surface far SACLANT Mediterranean data.
... 1'. An MV-EPCmatched-field ambiguity surface for SACLANT Mediterranean Data.
The estimated source location is then the hypothesized range and depth which maximizes the power at the output of the beamforrner. The so-called ambiguity surface ofthe Bartlett beamformer is its output power versus hypothesized range and depth. A typical Bartlett ambiguity surface obtained using actual Mediterranean data from a 48-sensor vertical array is shown in Fig. 10. Note that there is a local maximum of this ambiguity surface near the true source location at a range of5900 m and depth of 70 m. This data set was collected by the NATO SACLANT Centre [139] and is currently available to the public on the IEEE SP database web-site at Rice University (http://spib.ricc:.edu). Two major difficulties facing matched-field processors are: 1) high sidelobe levels, as seen in Fig. 10, which result in ambiguous source location estimates, and 2) the sensitivity ofthese methods to errors in the assumed envi-
82
unresolved multipaths from ground reflections local to the aircraft [301]. These predictions are essentially correlated with complex delay-Doppler data in a ML altitude estimation method that uses multiple radar dwells on the aircraft target as illustrated in Fig. 12. The sub-plots in this figure represent consecutive delay-Doppler surfaces from an OTH radar . Note that the dominant vertical band in each sub-plot is due to ground clutter and the peak encircled in each plot is a small twin-engine aircraft approximately 2,500 km away from the radar . Matched-field altitude estimation (MFAE) ex• 12. Log-amplitude delay(aka. slantrange) versus Dappler frequency surfaces formultipleradardwells. ploits the fact that the complex fading characterable integration times. Those interested in pursuing these istic of the target peak is highly dependent on aircraft altiproblems can find much of the necessary software and tude. In MFAE, a time-evolving log-likelihood function of data at N]IT's Ocean Acoustics Library web-site aircraft altitude is updated with each radar revisit ofthe target. An example of this function is shown in Fig. 13 for this (http://oalib.njit.edu). real-data example. Observe that the matched-field estimate Beyond underwater acoustic applications, ofaltitude isremarkably close to its true height of5,OOO ft. matched-field techniques are also currently being exIn swnmary, statistical signal and array processing with plored for problems involving multipath electromagnetic computational propagation models permit the exploitapropagation. Although this work is still in its early stages, tion of complex multipath conditions to achieve signifielectromagnetic matched-field processing (EM-MFP) cantly enhanced performance over traditional methods. has already been proposed in several applications including: 1) aircraft height-finding using a low-angle microwave radar that can exploit multipath due to the target's direct-path and specular reflection off the ground [182]; 2) inversion of tropospheric refractivity parameters that characterize ducted radio-wave propagation conditions over the sea surface using point-to-point microwave transmissions [138]; and 3) target localization in high-frequency skywave over-the-horizon (OTH) radar [217,301]. One application where EM-MFP provides an existing radar with an entirely new capability is that ofaircraft altitude estimation for OTH radar . Over-the-horizon radars use the refractive properties of the ionosphere for wide-area surveillance of targets at megameter ranges. And although target localization in latitude and longitude is typically achieved by tracing the paths of rays refracted through the ionosphere, determination oftarget altitude has never been reliably achieved. In recent work, however, a form ofEM-MFP has been developed that uses an ionospheric propagation model to predict the signal in complex delay- Doppler space due to
•
83
1J . Time-evolving fog-likelihoodof aircraft altitude for a small twin-engine plane at an altitude of 5,000 feet and range of 2,500 kilometers.
Such approaches involve a tight coupling between the physics of wave propagation and. signal processing. They also rely 011 the availability of sufficiently accurate estimates of the environmental paratneters. Numerous results obtained with real data in very different settings, however, suggest that "sufficiently accurate" should by no means be interpreted as "perfect knowledge' ofthe environment. Indeed, in SOBle situations, robust signal processing methods have been developed that facilitate matched-field processing with almost "COffilTIOl1 knowledge" of the environment. Clearly, the further integration of computational wave-equation solutions and signal-processing techniques will pose Inany challenges and rewards in the future. A WWW link to the author of the above section: http://wwvv.ee.duke.edu/people/ik.htI111
15. G. Barnet, R. Kohn, and S. Shcarhcr, "Bayesian estimation of an
autoregressive model using markov chain monte carlo,"
j071T1llf!
of Eamomet-
"in, vol. 74, pp. 237-254, 1996. 16. P. Barone and R. Ragona, "Bavesian estimation of parameters of a damped sinusoidal model by a markov chain monte carlo method," IEEE TransattU11IS011 S(lTllal Proccssinq, vol. 45, pp. 1806-1814, 1997. 17. D. L. Bartholomew and J. A. Tague, "Quadratic power spectrum estimation with orthogonal frequency division multiple windows," IEEE TI'f1.1ISf1.Ctions 011 SilJlul! Pl'OCCSJilt/T, \'01. 43, pp. 1279-1282, 1995. 18. A. Bartov and H. Messer, "Lower bound on the achievable DSP pcrform.lIKC for localizing step-like continuous signals in noise," JEEl:: Tmusac-
tiousem Sigllal P7"OccssiJl.!.1, vol, SP-46, 1988. 19.1\1. Basscvillc, 1\11. Benveniste, A. Chou, K. Golden, R. Nikoukhah, and A. S. Willskv, "Modeling ami estimation of rnulrircsolution stochastic proCC\Sl:S," IEEE Trmls. 011 IT, vol. IT-38, pp. 529-532, Mar. 1992. 20. B. B.1ygun and A. O. Hero, "Optimal simultaneous detection and csnrna-
rion under a false .11.11"111 constraint," IEEE T'·n1IS. pp. 688-703, 1995.
011
11Iji}1"1II. Theory, vol. 4-1,
no, 3,
References
21. B. B.1ygUll and A. O. Hero, "An iterative solution to rhe min-max simultancous derccnon and esnrnation problem," in Proc. afthe IEEE 111m1ul1(Jp on Statistunl S~71ltll anti An'a)' ProceSSl1tlT, pp. 8-11, Corfu, Greece, June 1996.
1. A. Arncodo, Y. D. Carafa, R. Audit, E. Bacry, J. MllZY, and C. Thcrrnes, "What can we learn with wavelets about dna sequences,' Pbvsica A, vol.
22. E. Beadle and P. M. Djuric, "Parameter estimation for non-Gaussian
24Y,pp.439-44S,19Y8.
autoregressive processes," in ICASSP, pp. 3557-3560, 1997.
1. P. Abrv and P. Flandnn, "Point proccssc'i, LRD .1I1d wavelets," ill Wavelets
23. A. Bclnuchrani .1I1J 1\1. Armn, "Blind source separation based on time-frequency signal rcprcscut.mons." IEEE Transactions 011 S~Tllnl Pro-
ill Biolo,..f1.Y and Medicine, A. Aldroubi .111<.1 M. Unser, editors, Cll.C Press, 19lJ6. 3. B. G. Agee, S. V. Schell,
.111d
ceS!jill.!l, P: Submitted.
W. A. Gardner, "Spectral self-coherence
24. S. Benedetto, E. Biglicri, and V. Castellani, Di.tritn1 Transmission 71JCOl}',
rcsroral: a new approach to blind adaptive signal extraction using antenna .irruvs," Pl'OcccdilllTS oftbe IEEE, vol. 78, p~"'\. 753-767, 1990.
Prentice-Hall Inc., New Jersey, 1987. 25. S. E. Bensley .1I1d B. Aazhang, "Subspace based channel estimation for
-I-. 1\1. Amin, "Time-frequency spectrum analvsis and estimation for
cdrna communication systems," IEEE Trans. 011 Cotuutunicntions, pp.
nonstarionary random processes,' in Ti11lt-F1-CqufUC." Siannl Analysis: Methods and Applicatums, H. Buashash, editor, pp. 208-232, \!Vilcy Halsted Press, Australia, 1992.
1OOY-l 020, August 1996. 26. A. Benveniste, M. Goursar, and G. Ruger, "Blind equalizers," 1£1-:£ Trans.
5. M. Amin, "Minimum v..iriancc rime-frequency distribution kernels for signal IJ1 additive noise," JEEE Transnctums 011 S~71l(J1 Ptocc.uilllT, vol. 44, pp. 2352-2356, 1996. 6.
on Cmuntunicntunts, pp. X7I-XX2, August 19M2.
27. M. J. Berliner and J. f. L. (Ed\.),Awmtic Partulc VdOClt')' Sensors: DfJ'.!J1I, Pcrfimuanccmitt .Applimtio1l.\, All' Press, Woodbury. NY, 1996.
n. Andrews .1I1J A.
Herzberg, Data. A collection ofpmblemJfI'01I111Ul11.'Y fields .fin'the student and research worker, Springer- Verlag, 1985.
28.
7. C. Andrieu, A. Doucet, and P. Duvaut, "'Joint Bavcsian detection and cstimarion of sinusoid» embedded H. C. Andricll, A. Doucct,
III
noise,"
III
proccs~ing,"
Signal PmCt:ssill..". vol. 43, 30. T. G. Birdsall and
Technical Rcport CUED/F-fNFENGrrR. 324, Uni-
9. J. B.le and I. Song, "R'1I1k-b.lscd detection of weak random sign.lI~ in .1 mul [J plic.ltivc noise model," S(lJllnl Pmccssilll1, vol. 63, pp. 121-131, 1997. ~U1d
P. N. l\llikhalcvsky, ~~An overview of IEEE jou17lf1.1 ofOcenllicEll.l. 1i-
III
AlInl.vJisn1ld An·n." 1990.
l'1"Oe. ICASSP'98, 1998.
1995.
011
Pl'OCCS.mJll,
S. Haykin, cditor, pp. -tlB-517, Prcllticc-H.ll1.
33. B. BO.lsh~l~h and P. O'She ..l, ~'Pnl~'nomial \Vigner- Ville di~triburion!\ and thcir relationship to time-v.lrying higher ordcr spc:ctrJ.,"
tion: Oprinul kernel dcsign," IEEE Tl-mlJactiolls Oil Stf11ltll ProCCSJiu...l1, vol. 4-1, pp. 1589-1602,1993.
011 SLmml
ProCL'SSiltlT,
\'01.
IEEE Trf1.lISflcti01H
42, 1995.
34. N. Bose and C. Ran, edirors, Hn1ldb(J()/~ 0fStntlJtu:S, VOlIlUlL' 10, St1T1lf1.1 Pro-
'~SpJLe-timc-fi'cqLlency processing of ~ynthctic
a.uill..." nlld itJ Applicatwlls, EI~cvier Science Publishers,
.lpeftllre rad.11" signal"," IEEE TrmlsllctimlJ OIl AtTOSpncc Electr. ~"st., vol. 30,
Am~terdal11, 1993 .
35. S. Bosc and A. O. Stcmll.1rdt, "Ac..i.lptive J.rra~· dl'tectiul1ufullcerr.lin rank olle \\'J.\'ctunns," IEEE Trnwactio1lS 011 S~llltll Prot:fSsilI..", vol. 44, no. 11, pp. 2801-2809, Nov. 19l)6.
pp. 341-358, 1Y94. 14. S. Barbaross.l, A. Scaglione, A. R.liocchi, ,lnd G. Colletti, ~~Modcll11g net-
work trattlL data by doubly stoCh,l:itic point proce~ses with selt:simibr intcn~ity proccss
NDV
32. B. Bo.1shash, '~Tlme-ti"CqllLl1cy \ignal .1I1.1Iysis," in J~dp(1llccJ ill Spectru1l/
12. R. Haraniuk .111d D. Jones, UA signal dcpendent time-frcquency represcnta-
13. S. B.lrbarossa .1Ild A. F.lrin01,
11, pp. 2733--M,
pp. 197-210,1994.
1I1 oce.1l1 .lcollstic~:'
J. Q. Ibo and L. Tong, ~~AppliL.l[ions of blind cqualization in wirelcss ~nm networks,"
110.
J. O. Gohicll, "SuHicicnt ~t.1tistlc~ and rcproduclng den-
31. R. Blum, "A~ympt(Jti(.ll1y rnbu~r detection fnr k.nown signals in cont~lIni nJ.red multtplicJ.ti\'c l1C1isl'," IEEE TrallJnctiollJ 011 Sif11lal Proccssing, vol. 38,
llcc1·iu.!T, vuJ. IS, no. 4, pp. 401-424,1993. 11.
with random amplitudes:
sities in simlllt.lI1eOll~ "cquenti.11 detection and cstin1.1tion:' IEEE Trm/J. IlljiJ1711. Them", vol. 19, pp. 760-768, 1973.
vcrsity of C.lmbndgc, UK, 1998.
miltchcd-ticJd methods
~ignal~
least-squares estimators .llld rhcir ~t;lti~tiLClI .1Il.1Iy~i~," IEEE TrnllJnctilJ71s OJI
Vv. J. Fitzger.lld, and S. J. Godsill, "'An introdlll.:tion
10. A. Haggeroer, \A'. Kuperman,
Bernardo and A. F. M. Smith, Bavcsinn Theory, John Wiley, New
2tJ. O. Besson and P. S[OiGl, "Sinusoul.il
ICASSP, pp. 2245-2248, 1998.
to the theory and .1pplicati()n~ of simulation bascd cOl11pllt..uional mcthods
in sIgna)
J. M.
York, 1994.
36. S. Bose .l.nd A. O. Sreinlurdt, "A maxim.ll im'.lri.1J1t ti'an1c\Vork for .ldapri\'c:
.1Ild tl·'lCt.11 rem:w,ll point procc~s," in P1"()c. Tbi1·ty-Fh-st and ComjJuters, pp, 1112-16, Montcrey,
AJi/own?" COl~f()l1 S(fJllnls, .~VJtt:lIlJ
dctection with structured and unstructurcd c(J\'~lri.lIKc mJtriLcS," IEEE
CA, Nov 1997.
Tl'fl1ISflcti011J 011 Si...mml ProussilI...lT. vul. 43, 110. 9, pp. 2164-2175,
84
Sepr. 1995.
37. G. F. Boudreaux and T. Parks, "Tirnc-varving filtering and signal estirn ..l-
59.
Acoustics. Spud), tuui
S~T1/tll
J. Cheung and
L. Kurz, "A gencr~\lized Mvinterval partition detcetoir with
applications to signal detection In impulsive noise," IEEE Transnctums 01/
tion using Wigner distribution synthesis techniques," IEEE Trnusnctions 011
Proccssinn, vol. 34, pp. 442-451, 1986.
Acoustics, SPt:CclJ. nud S£rpzn! Procrssiu...", vol. 41, no. 1, pp. 213-221,1993.
38. C. Bouman and K. Sauer, "Fast numerical methods for emission ..i nd transmission tomographic reconstruction," in Proc. COllI on Illjinm. SCZfllCCS I11ld .Svstcius, Johns Hopkins, 1993.
60. A. Chevreuil and P. Loubarou, "Blind second-order identification of fir
39. M. Bouvet and S. C. Schwartz, "Comparison of ad.iptivc and robust rccciv-
61. C.-M. Cho .uid P. Djuric, "Bavcsiun detection and estimation of cisoids in
channels: Forced cvclo-statiunaritv and vrructurcd subspace method.' IEEE
colored noise," IEEE Trausrurions
crs for sign.11 detection in ambient underwater noise," IEEE Trnns. Acoustics,
C. Tiao, Bayesiall lnjcrcncc . John Wilcv, New York,
63. S. Chretien .uid A. Hero, "Acceleration of the EN! algorithm via proximal point iterations." in Prot".
4-2. D. R. Brillinger, Time Series: Dnta Analvsis and Theory: Springer- Verlag,
dle unplemcnt.itions." Technical Report CSPL-3l4, C0111l11. and Sig. Proc. L.1b. (CSPLj, Dept. EECS, University oL\tlichig;lll, Ann Arbor, .1.\1.11".
a~pens
1<)9~.
of the study of ordirurv time series and
65. P.-H. Chua, C.-lv1. S. See, and A. Nchorai, "Vector-sensor
pOll1r processes," Developments in Statistics, vol. 1, pp. 33-133, 1978.
for csrirn.iting
4-5. P. L. Brockert, 1\11. Hinich, .111d G. R. Wilson, "Nonlinc.ir and non-Gaussinn ocean noise," f. Auw.r6crz! Society 13g6-1394, 1<)87.
CO//IIJl1.f11
lihood ratio dcrccnou.' 11:'£1:- Transactions Oil
S~f]/lI1!
C.llllb.llll'l
011
Procrssniq, vol. 44, no.
IT, vol. 41,
110.
011
icntunis, vol. 43, no. 10, pp. 25H2-2604, Ocr, 1Y95.
Discrete time signal", - part III: Rcl.irions
6~.
With
other time-frequency signal
D. Cochran, H. Gish, and D. Sinl1u, "A gcometric approach to multiplc-chanuel ~igrl.ll detection:' IEEE TrmlJn(tw/lJ 43, no. 9,