Direction finding using data-supported optimization

A novel data-supported optimization technique for maximum likelihood (ML) direction-of-arrival estimation is proposed. The essence of our approach is to optimize the likelihood function at certaindata-supported points obtained by a resampled root-MUSIC procedure. These points are shown to comprise a small but representative subset of all possible searching points and contain enough information for solving the ML problem.This work was supported in part by grants from the National Sciences and Engineering Research Council of Canada (NSERC), Ministry of Energy, Science and Technology (MEST) of Ontario, Communications and Information Technology Ontario (CITO), and by the Senior Individual Grant Program of the Swedish Foundation for Strategic Research.     

Polynomial ambiguity resistant precoders: Theory and applications in ISI/multipath cancellation

In this paper, precoding techniques are studied for combating the intersymbol interference (ISI)/multipath effects in communication systems. We introduce a new type-precoder which we term thepolynomial ambiguity resistant (PAR) precoder for its ability to resist signal distortion induced by finite impulse response (FIR) channels. In particular, the precoder allows a receiver to identify an input signal without knowing the channel characteristics at the expense of a minimum amount of bandwidth increase. A family of such precoders, which is linear (no modulo operations), channel independent, and modulation pattern preserving (except for some occasional 0 symbols), is presented. Also presented is a closed-form algorithm that can simultaneously identify the input signals and zero-forcing equalizers.Work supported in part by the Air Force Office of Scientific Research (AFOSR) under Grant No. F49620-97-1-0253 and F49620-98-1-0352, the National Science Foundation CAREER Program under Grant MIP-9703377, and the University of Delaware Research Foundation.Work supported in part by the Air Force Office of Scientific Research (AFOSR) under Grant No. F49620-97-1-0318, the Office of Naval Research (ONR) under Grant No. N00014-97-1-0475, and the National Science Foundation CAREER Program under Grant MIP-9703074.     

VoIP over Wi-Fi Networks: Performance Analysis and Acceleration Algorithms

The expected VoIP call capacity in a one hop IEEE 802.11b network with G.711 voice codec is about 85 simultaneous calls, but the actual observed capacity is only 5 calls even at the highest data rate and under zero loss conditions. In this paper we analyze the reasons behind this inferior performance of VoIP traffic. We also present algorithms at the medium access control layer to improve the observed call capacity. Using ns-2 based simulations, we evaluate the algorithms and show that performance improvements of more than 300% can be achieved. Finally, using a testbed implementation of one of the proposed algorithms, we show its feasibilty in real world VoIP implementations. An earlier version of this paper was published in the IEEE Conference on Broadband Communications, Networks, and Systems (BroadNets) 2007 [1]. This work was supported in part by the National Science Foundation under grants CNS-0519733 and CNS-0721296, and the Georgia Tech Broadband Institute. Yeonsik Jeong was also supported under the Korea Research Foundation Grant KRF-2005-214-D00362 funded by the Korean Government (MOEHRD). This work was performed when Y. Jeong was a research scientist in the GNAN research group at Georgia Institute of Technology.     

A recursive parameter estimator yielding exponential convergence under sufficient excitation

For linear time-invariant discrete-time systems, an exponentially convergent recursive parameter identification scheme is derived requiring only that the regression vector be sufficiently exciting, that is the sum of the outer products of the regression vector is eventually positive definite. The algorithm produces a parameter estimate that converges to the batch-form (nonrecursive) least-squares estimate without requiring a persistent excitation. The rate of convergence can be selected as a design parameter. If the regression vector is persistently exciting, it is shown that a forgetting factor can be added to the formulation in such a way that the magnitude of the forgetting factor and the rate of exponential convergence can be set separately.This work was supported in part by Eglin Air Force Base under Contract No. F08635-86-K-0265 and by the SDIO/IST managed by the Office of Naval Research under Contract No. N00014-86-K-0543.     

Full-Rate Complex Orthogonal Space-Time Block Code for Multiple Antennas

In this paper, full-rate and complex orthogonal space-time block code (STBC) schemes for multiple antennas are proposed, and turbo code is employed as channel coding to improve the proposed STBC schemes performance further. Compared with full-diversity multiple antennas STBC schemes, the proposed schemes can implement full data rate, partial diversity and a smaller complexity. On the condition of the same system throughput and concatenation of turbo code, the proposed schemes have lower bit error rate (BER) than those low-rate and full-diversity code schemes.This work is supported by China Postdoctoral Science Foundation under grant No. 2005038242 and Chinese Jiangsu Planned Projects for Postdoctoral Research Funds. Xiangbin Yu received the M.S degrees in Communication and Information Systems from Hohai University, Nanjing, China, in 2001; and his Ph.D. in Communication and Information Systems in 2004 from National Mobile Communications Research Laboratory at Southeast University, China. Now he is working as a Postdoctoral Researcher in Information and Communication Engineering Postdoctoral Research Station at Nanjing University of Aeronautics and Astronautics, Nanjing, China. His research interests include multi-carrier digital communication, space-time coding, adaptive modulation and digital signal processing in communications. DaZhuan Xu received the M.S degrees and Ph.D. in Communication and Information Systems from Nanjing University of Aeronautics and Astronautics in 1986 and 2001, respectively. He is now a full professor in College of Information Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing, China. Prof. Xu is a Senior Member of China Institute of Electronics (CIE). His research interests include digital communications, soft radio, coding theory, medical signal processing. Guangguo Bi was graduated from Nanjing Institute of Technology, Nanjing, China, in 1960. He is now a professor in the Department of Radio Engineering of Southeast University, Nanjing, China. Prof. Bi is a fellow and a member of the board of Director of the China Institute of Communications, and a senior member of IEEE. His research interests include digital communications, personal communications network, spread spectrum communications, and intelligent information processing. He has published more than 200 papers in above areas.     

On the concentrated stochastic likelihood function in array signal processing

The stochastic likelihood function [(STO)LF] associated with the narrowband signal processing problem can be concentrated with respect to the signal covariance matrix elements and the noise power. Although this is a known fact, no clear-cut derivation of the concentrated (STO)LF appears to be available in the literature. In this short paper we provide a simple, complete proof of the concentrated (STO)LF formula.The work of A. Nehorai was supported by the Air Force Office of Scientific Research under Grant no. F49620-93-1-0096, the Office of Naval Research under Grant no. N00014-91-J-1298, and the National Science Foundation under grant no. MIP-9122753. The work of P. Stoica was supported by the Swedish Research Council for Engineering Sciences under contract no. 93-669.     

Low entropy image pyramids for efficient lossless coding

An efficient image source coding technique gives good compression performance at low computational complexity. This research introduces an efficient coding technique, based on pyramid coding, that involves transforming an image into an equivalent lower entropy form prior to lossless coding. The proposed method is also a multiresolution technique that facilitates progressive image transmission.     

Authenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm

An authenticated encryption scheme is a symmetric encryption scheme whose goal is to provide both privacy and integrity. We consider two possible notions of authenticity for such schemes, namely integrity of plaintexts and integrity of ciphertexts, and relate them, when coupled with IND-CPA (indistinguishability under chosen-plaintext attack), to the standard notions of privacy IND-CCA and NM-CPA (indistinguishability under chosen-ciphertext attack and nonmalleability under chosen-plaintext attack) by presenting implications and separations between all notions considered. We then analyze the security of authenticated encryption schemes designed by “generic composition,” meaning making black-box use of a given symmetric encryption scheme and a given MAC. Three composition methods are considered, namely Encrypt-and-MAC, MAC-then-encrypt, and Encrypt-then-MAC. For each of these and for each notion of security, we indicate whether or not the resulting scheme meets the notion in question assuming that the given symmetric encryption scheme is secure against chosen-plaintext attack and the given MAC is unforgeable under chosen-message attack. We provide proofs for the cases where the answer is “yes” and counter-examples for the cases where the answer is “no.” M. Bellare’s work was supported in part by a 1996 Packard Foundation Fellowship in Science and Engineering, NSF CAREER Award CCR-9624439, NSF grants CNS-0524765 and CNS-0627779, and a gift from Intel Corporation. C. Namprempre’s work was supported in part by grants of the first author and the Thailand Research Fund.     

Coupled and constrained sylvester equations in system design

Several design problems, including reduced observer and compensator design, output feedback, and finite transmission zero assignment, are examined using the vehicle of the coupled Sylvester equations. The coupling is generally provided through a third equation involving the solutions of the two linear Sylvester equations, thus serving as a constraint on the allowed solutions. The Sylvester approach allows the unification of algebraic and geometric approaches, and provides numerical design algorithms through the tool of the Hessenberg form. This research was supported by the National Science Foundation under Grant No. NCR-9210408 and by the University of Hawaii Research Council under Contract No. 93868F728B425.     

Multiresolution broadcast for digital HDTV using jointsource/channel coding

The use of multiresolution (MR) joint source-channel coding in the context of digital terrestrial broadcasting of high-definition television (HDTV) is shown to be an efficient alternative to single-resolution techniques, which suffer from a sharp threshold effect in the fringes of the broadcast area. It is shown how matched multiresolution source and channel coding can provide a stepwise graceful degradation and improve the behavior, in terms of coverage and robustness of the transmission scheme, over systems not specifically designed for broadcast situations. The alternative available for multiresolution transmission through embedded modulation and error correction codes are examined. It is also shown how multiresolution trellis-coded modulation (TCM) can be used to increase coverage range. Coding results and simulations of noisy transmission are presented, and tradeoffs are discussed     

Optimal Hankel-norm approximation of continuous-time linear systems

A problem on optimal approximation of continuous-time linear systems is studied. The performance measure (error) is chosen to be the spectral norm of the difference between the Hankel operators associated with the original system and the approximant. It is shown that the Hankel operators associated with continuous-time systems and the Hankel matrices associated with discrete-time systems are related by an interesting correspondence property via bilinear transforms. This fact is then used to derive the continuous-time results (theory and algorithms) from the established discrete-time ones. Some simple examples are presented.This research was supported by the Army Research Office under Grant No. DAAG 29-79-C-0054, and by the National Science Foundation Grant No. ENG-7908673, and by the Office of Naval Research under Contract No. N000-14-81-K-0191.Formerly with the Department of Electrical Engineering-Systems, University of Southern California, Los Angeles, California 90007, USA     

Transmission spectra of coated phase shifted long-period fiber gratings

The transmission spectrum of the coated phase-shifted long-pcriod fiber gratings （LPFCrs） with single and multiple phase shifts is analyzed by the coupled-mode theory and the transfer matrix method, and the influences of the film parameters on the spectral characteristics are also studied. It is shown that these parameters will affect the LPFG filtering characteristics. The loss peak of Wansmission spectrum decreases with the increase of film thickness, and the peak position shifts with the film refractive index. Compared with the non-coated phase-shifted LPFG, the coated one has the similar desirable filtering characteristics, and it has a flexible ability to adjust the transmission properties.     

Rapid Hybrid Acquisition of Ultra-Wideband Signals

Impulsive ultra-wideband (UWB) radio provides many promising features for wireless communications in a dense multipath environment. However, these features are largely the result of the enormous effective processing gain, which can make acquisition difficult at the receiver. In this paper, a recently developed theory of minimum complexity sequential detection is applied to the hybrid acquisition problem. As in previous hybrid schemes, a number of potential timing phases are checked as a group; however, a phase is disregarded as soon as it appears unlikely rather than waiting for a “winner” to be chosen from the group. Another phase then replaces the disregarded one. Analysis and simulation results indicate that the proposed scheme can improve average acquisition times for highly spread systems operating over either additive white Gaussian noise (AWGN) or multipath fading channels. This paper is based in part upon work supported by the Army Research Office under Contract DAAD10-01-1-0477 and employed equipment obtained under National Science Foundation Grant EIA-0080119.     

Efficient cryptographic schemes provably as secure as subset sum

We show very efficient constructions for a pseudorandom generator and for a universal one-way hash function based on the intractability of the subset-sum problem for certain dimensions. (Pseudorandom generators can be used for private-key encryption and universal one-way hash functions for signature schemes.) The increase in efficiency in our construction is due to the fact that many bits can be generated/hashed with one application of the assumed one-way function.All of our constructions can be implemented in NC using an optimal number of processors.Part of this work was done while both authors were at the University of California at Berkeley and part when the second author was at the IBM Almaden Research Center. Research supported by NSF Grant CCR 88-13632. A preliminary version of this paper appeared in Proc. 30th Symposium on Foundations of Computer Science, 1989.Incumbent of the Morris and Rose Goldman Career Development Chair. Research supported by an Alon Fellowship and a grant from the Israel Science Foundation administered by the Israeli Academy of Sciences.     

Explicit formulae for completions of linear time varying singular systems of differential equations

Completions of linear time varying singular systems of the formE(t)x(t)+F(t)x(t)=f(t) are explicitly computed using recent results on rational matrix functions. The algorithm and the theory behind it are carefully described. Computational issues are discussed.Research supported in part by the U.S. Army Research Office under DAAL03-89-D-0003, and the National Science Foundation under ECS-9012909.     

Progress on a general numerical method for nonlinear higher index DAEs II

A method has been proposed for numerically solving lower dimensional, nonlinear, higher index differential algebraic equations for which more classical methods such as backward differentiation or implicit Runge-Kutta may not be appropriate. This method is based on solving nonlinear DAE derivative arrays. This paper discusses progress on the implementation of this method, resolves some of the issues involved, and lists some remaining problems. Computational experience on two prescribed path control problems is presented showing that the approach should prove practical for many applications.Research supported in part by the U.S. Army Research Office under DAALO3-89-D-0003, and the National Science Foundation under ECS-9012909 and DMS-9003401.     

On identifiability and information-regularity in parametrized normal distributions

We describe methods to establish identifiability and information-regularity of parameters in normal distributions. Parameters are considered identifiable when they are determined uniquely by the probability distribution and they are information-regular when their Fisher information matrix is full rank. In normal distributions, information-regularity implies local identifiability, but the converse is not always true. Using the theory of holomorphic mappings, we show when the converse is true, allowing information-regularity to be established without having to explicitly compute the information matrix. Some examples are given.This work was supported by the Air Force Office of Scientific Research under Grant no. F49620-93-1-0096, the National Science Foundation under Grant no. MIP-9122753, and the Office of Naval Research under Grant no. N00014-91-J-1298.     

Feedback shift registers, 2-adic span, and combiners with memory

Feedback shift registers with carry operation (FCSRs) are described, implemented, and analyzed with respect to memory requirements, initial loading, period, and distributional properties of their output sequences. Many parallels with the theory of linear feedback shift registers (LFSRs) are presented, including a synthesis algorithm (analogous to the Berlekamp-Massey algorithm for LFSRs) which, for any pseudorandom sequence, constructs the smallest FCSR which will generate the sequence. These techniques are used to attack the summation cipher. This analysis gives a unified approach to the study of pseudorandom sequences, arithmetic codes, combiners with memory, and the Marsaglia-Zaman random number generator. Possible variations on the FCSR architecture are indicated at the end. Andrew Klapper was sponsored by the Natural Sciences and Engineering Research Council under Operating Grant OGP0121648, the National Security Agency under Grant Number MDA904-91-H-0012, and the National Science Foundation under Grant Number NCR9400762. The United States Government is authorized to reproduce and distribute reprints notwithstanding any copyright notation hereon. Mark Goresky was partially supported by the Ellentuck Fund and National Science Foundation Grant Number DMS 9304580.     

An elementary proof of the Routh-Hurwitz stability criterion

This paper presents an elementary proof of the well-known Routh-Hurwitz stability criterion. The novelty of the proof is that it requires only elementary geometric considerations in the complex plane. This feature makes it useful for use in undergraduate control system courses.Research supported by Hughes Aircraft Company, El Segundo, California 90245, USA, and the National Science Foundation under Grant ECS 21818.     

A closed-form identification of multichannel moving average processes by ESPRIT

In this paper, a closed-form identification of possibly nonminimum phase multichannel moving average (MA) processes is derived by exploiting the eigenstructures of the observation cumulant matrices using the ESPRIT algorithm. The proposed approach allows the combination of statistics of different orders for better performance and offers reduced computation complexity when compared with existing iterative approaches. Simulations are also presented to demonstrate the performance of the proposed algorithm.This work was supported in part by the National Science Foundation under Contract NCR-932183, and by the Office of Naval Research under Contract N00014-91-J-1461.