Institute for Systems Research Technical Reports

Permanent URI for this collectionhttp://hdl.handle.net/1903/4376

This archive contains a collection of reports generated by the faculty and students of the Institute for Systems Research (ISR), a permanent, interdisciplinary research unit in the A. James Clark School of Engineering at the University of Maryland. ISR-based projects are conducted through partnerships with industry and government, bringing together faculty and students from multiple academic departments and colleges across the university.

Browse

Search Results

Now showing 1 - 10 of 56
  • Thumbnail Image
    Item
    Next Generation Satellite Systems for Aeronautical Communications
    (2000) Ercetin, Ozgur; Ball, Michael O.; Tassiulas, Leandros; Tassiulas, Leandros; ISR; NEXTOR
    The US airspace is reaching its capacity with the current Air Traffic Control system and a number of flights that is constantly rising, and estimated to be over 54 million per year by 2002. The FAA has undertaken several projects to modernize the National Airspace System (NAS) to ensure the safety of the increasing number of flights. Of special importance is the modernization of the Air-Ground (A/G) Communications infrastructure, which is the heart of the air traffic control (ATC).

    The current plan in the modernization of the A/G communications is to migrate from analog voice only system to integrated digital voice and data system. The next generation satellite systems can be an alternative to the terrestrial A/G systems by their low propagation and transmission delays, global coverage, high capacity, and free flight suitable characteristics. In this paper, we give an overview of the current and the future ATC architectures, describe the systems and the communications issues in these systems, and develop a framework in which LEO/MEO next generation satellite systems can be integrated to the future ATC systems.

  • Thumbnail Image
    Item
    Stochastic Approximation and Optimization for Markov Chains
    (2000) Bartusek, John D.; Makowski, Armand M.; ISR
    We study the convergence properties of the projected stochasticapproximation (SA) algorithm which may be used to find the root of an unknown steady state function of a parameterized family of Markov chains. The analysis is based on the ODE Method and we develop a set of application-oriented conditions which imply almost sure convergence and are verifiable in terms of typically available model data. Specific results are obtained for geometrically ergodic Markov chains satisfying a uniform Foster-Lyapunov drift inequality.

    Stochastic optimization is a direct application of the above root finding problem if the SA is driven by a gradient estimate of steady state performance. We study the convergence properties of an SA driven by agradient estimator which observes an increasing number of samples from the Markov chain at each step of the SA's recursion. To show almost sure convergence to the optimizer, a framework of verifiable conditions is introduced which builds on the general SA conditions proposed for the root finding problem.

    We also consider a difficulty sometimes encountered in applicationswhen selecting the set used in the projection operator of the SA algorithm.Suppose there exists a well-behaved positive recurrent region of the state process parameter space where the convergence conditions are satisfied; this being the ideal set to project on. Unfortunately, the boundaries of this projection set are not known a priori when implementing the SA. Therefore, we consider the convergence properties when the projection set is chosen to include regions outside the well-behaved region. Specifically, we consider an SA applied to an M/M/1 which adjusts the service rate parameter when the projection set includes parameters that cause the queue to be transient.

    Finally, we consider an alternative SA where the recursion is driven by a sample average of observations. We develop conditions implying convergence for this algorithm which are based on a uniform large deviation upper bound and we present specialized conditions implyingthis property for finite state Markov chains.

  • Thumbnail Image
    Item
    Study of DS-CDMA, RAKE Receiver and Proposal for a Multicarrier DS-CDMA System
    (1999) Han, Zhu; Baras, John S.; ISR; CSHCN
    This paper gives a review of DS-CDMA, RAKE receiver and multicarrier DS-CDMA as well as a proposal and numerical result for a multicarrier DS-CDMA system.

    This paper is organized as follows: Section I introduces the development of methods for wireless communication over multipath fading channel. Section II gives Turin's evaluation of the effects of multipath and fading on the performance of DS-CDMA systems. Section III gives Pursley's evaluation of this issue. Section IV explains the structure and performance of conventional RAKE receiver. Section V shows Sourour's work on Multicarrier DS-CDMA. Section VI is a proposal for a multicarrier DS-CDMA system and some numerical results I have gotten. Section VII is devoted to the conclusions and future work.

  • Thumbnail Image
    Item
    Architecture for Guaranteed Delay Service in High Speed Networks
    (1997) Peris, Vinod; Makowski, Armand; ISR; CSHCN
    The increasing importance of network connections coupled with the lack of abundant link capacity suggests that the day when service guarantees are required by individual connections is not far off. In this dissertation we describe a networking architecture that can efficiently provide end-to-end delay guarantees on a per- connection basis. In order to provide any kind of service guarantee it is imperative for the source traffic to be accurately characterized at the ingress to the network. Furthermore, this characterization should be enforceable through the use of a traffic shaper (or similar device). We go one step further and assume an extensive use of traffic shapers at each of the network elements. Reshaping makes the traffic at each node more predictable and therefore simplifies the task of providing efficient delay guarantees to individual connections. The use of per-connection reshapers to regulate traffic at each hop in the network is referred to as a Rate Controlled Service (RCS) discipline. By exploiting some properties of traffic shapers we demonstrate how the per-hop reshaping does not increase the bound on the end-to-end delay experienced by a connection. In particular, we show that an appropriate choice of traffic shaper parameters enables the RCS discipline to provide better end-to- end delay guarantees than any other service discipline known today. The RCS discipline can provide efficient end-to-end delay guarantees to a connection; however, by definition it is not work-conserving. This fact may increase the average delay that is observed by a connection even if there is no congestion in the network. We outline a mechanism by which an RCS discipline can be modified to be work-conserving without sacrificing the efficient end-to-end delay guarantees that can be provided to individual connections. Using the notion of service curves to bound the service process at each network element, we are able to provide an upper bound on the buffers required to ensure zero loss at the network element. Finally, we examine how the RCS discipline can be used in the context of the Guaranteed Services specification that is currently in the process of being standardized by the Internet Engineering Task Force.
  • Thumbnail Image
    Item
    Architecture, Design, Simulation and Performance Evaluation for Implementing ALAX -- The ATM LAN Access Switch Integrating the IEEE 1355 Serial Bus
    (1997) Charleston, Giles C.; Makowski, A.; ISR; CSHCN
    IEEE 1355 is a serial bus standard for Heterogeneous Inter Connect (HIC) developed for "enabling high-performance, scalable, modular and parallel systems to be built with low system integration cost." However to date, few systems have been built around this standard specification. In this thesis, we propose ALAX -- an internetworking switching device based on IEEE 1355. The aim of the thesis is two-fold. First, we discuss and summarize research works leading to the architecture, design and simulation development for ALAX; we synthesize and analyze relevant data collected from the simulation experiments of the 4- port model of ALAX (i.e., 4-by-4 with four input and output queues) -- these activities were conducted during the 2-year length of the project. Secondly, we expand the original 4-by-4 size of the ALAX simulation model into 8-, 12- and 16-port models and present and interpret the outcomes. Thus, overall we establish a performance assessment of the ALAX switch, and also identify several critical design measurements to support the ALAX prototype implementation. We review progresses made in Local Area Networks (LANs) where traditional software-enabled bridges or routers are being replaced in many instances by hardware-enabled switches to enhance network performance. Within that context, ATM (Asynchronous Transfer Mode) technology emerges as an alternative for the next generation of high-speed LANs. Hence, ALAX incarnates our effective approach to build an ATM-LAN interface using a suitable switching platform. ALAX currently provides the capability to conveniently interconnect legacy Ethernet and ATM- based networks. Its distributed architecture features a multi- processor environment of T9000 transputers with parallel processing capability, a 32-by-32 way non-blocking crossbar fabric (C104 chipset) partitioned into Transport (i.e., Data) and Control planes, and many other modules interlaced with IEEE 1355- based connectors. It also employs existing and emerging protocols such as LANE (LAN Emulation), IEEE 802.3 and SNMP (Simple Network Management Protocol). We provide the component breakdown of the ALAX simulation model based on Optimized Network Engineering Tools (OPNET). The critical parameters for the study are acceptable processor speeds and queuing sizes of shared memory buffer at each switch port. The performance metric used is the end-to-end packet delay. Finally, we end the thesis with conclusive recommendations pertaining to performance and design measurement, and a brief summary of areas for further research study.
  • Thumbnail Image
    Item
    An Integrated Rapid Prototyping and Vacuum Casting System for Medical Applications
    (1997) Surana, Rena; ISR
    Evaluation of products in the design stage has played a critical role in product development. Methods to build functional prototypes have been a deciding factor for designverification. As an emerging technology, rapid prototyping is revolutionizingthe process of building prototypes. However, material limitations and highcosts call for further expansion of this technology focusing on batch productionof prototypes with material options.

    Recognizing the challenge to produce multiple prototypes, this thesisresearch aims to integrate three state-of-the-art technologies: 3D solid modeling, rapid prototyping, and vacuum casting. A system architecture combining hardwareand computer software is designed and implemented.

    The system utilizes computergraphics to construct a 3D model of an object through visualitzion. A softwaresystem, Maestro, processes a CAD file, generates support structures, and creates slice data to build prototypes by a stereolithography process. Thebuilt part serves as a master pattern for creation of a silicone rubber mold in a vacuum environment. This vacuum environment creates a material flow ratethat ensures replicas with superior quality in regards to surface finish anddimensional accuracy. This mold is then used to cast multiple replicas ofthe master pattern.

    The unique contribution of this research is the application of thedeveloped system to meet a specific need in medical research - an effort torestore sight in blind individuals by implanting electordes in the visualcortex. Six replcas of a monkey skull are produced for surgeions to practicesurgical procedures. Image data obtained from CT scans of a mondkey head are successfully used to contruct a 3D solid model to fabricate a batch of six functional prototypes. The superior quality of these replicas hasoffered a unique opportunity for exploratory surgery in efforts to restoresight.

  • Thumbnail Image
    Item
    Zero-Crossing Rates of Some Non-Gaussian Processes with Application to Detection and Estimation
    (1996) Barnett, John T.; Kedem, B.; ISR
    In this dissertation we present extensions of Rice's formula for the expected zero-crossing rate of a Gaussian process to some useful non-Gaussian cases. In particular, we extend Rice's formula to the class of stationary processes which are a monotone transformation of a Gaussian process, to countable mixtures of Gaussians, and to products of independent Gaussian processes. In all the above mentioned cases the expected zero-crossing rates are given for both continuous time and discrete time processes. We also investigate the application of parametric filtering, using zero-crossing count statistics, to the problem of frequency estimation in a mixed spectrum model and the application of mean- level-crossing counts of the envelope of a Gaussian process to a radar detection problem. For the radar problem we prove asymptotic normality of the level-crossings of the envelope of a Gaussian process and provide and expression for the asymptotic variance.
  • Thumbnail Image
    Item
    Signal Processing Techniques for Increasing Channel Capacity in Wireless Communications
    (1996) Wang, H.; Liu, K.J.R.; ISR
    As the digital signal processing technology advances, the use of adaptive arrays to combat multipath fading and to reduce interference becomes increasingly valuable as a means of adding capacity to mobile communications. This dissertation address the major obstacles encountered in applying the two most applicable adaptive array algorithms to time division multiple access (TDMA) wireless communication systems.

    We first investigated the reference signal based adaptive diversity combining algorithm, which conventionally relies on feedback symbols in the absence of reference signals. Our computer simulation revealed that on a fast time varying fading channel, error propagation in the decision directed tracking mode severely degrades the performance. We developed a simultaneous diversity combining and decoding technique which incorporated QR decomposition-based recursive least-square parallel weights tracking and M-D decoding algorithms. In contrast to the conventional system where only one set of array weights is kept and updated, in our system, we update M sets of candidate weights. Thus we are able to make a more reliable symbol decision based on D symbols without compromising weights tracking speed. The M-D algorithm was first developed for the binary convolutional codes and then extended to Trellis-coded modulation. This technique significantly reduces error propagation. Simulation results showed that about 8 to 10dB improvement in the total interference suppression at low ISR and about 5dB improvement at high ISR can be achieved with a moderate increase in complexity.

    In the next part of the dissertation, we proposed and studied the use of the constrained adaptive array algorithm for extracting signals from interferences at separable directions. This algorithm requires direction-of-arrival (DOA) information and does not need reference signals. However, most of the high resolution DOAs estimation methods are only effective for noncoherent signals, while in mobile radio channels, coherent signals are inevitable. We developed a general spatial smoothing (SS) technique and a forward backward spatial smoothing technique for two dimensional arrays to decorrelate coherent signals from arbitrary directions. We found and proved the necessary and sufficient conditions on an array configuration for applying SS. This array must have an orientational invariance structure with an ambiguity free center array, and the number of subarrays must be larger than or equal to the size of the largest group of coherent signals. We also studies the causes of ambiguities and found some ambiguity free array manifolds. We expanded the application of our SS to several high resolution DOA estimation and constrained adaptive beamforming algorithms. All the predicted results were verified by simulations. In the last part of the dissertation, we investigated the applications of adaptive array technique in DS/CDMA systems. We applied reference-signal- based simultaneous diversity combining and decoding to reduce fading and suppress interference caused by poor synchronization and power control.

  • Thumbnail Image
    Item
    A Hybrid-ARQ System Using Rate-Compatible Trellis Codes Designed for Rayleigh Fading
    (1996) Eroz, Mustafa; Fuja, Tom E.; ISR
    This paper presents classes of rate-compatible trellis codes designed for channels with flat, slow Rayleigh fading. The codes thus described are ﲭultiple TCM (MTCM) codes as proposed by Divsalar and Simon - i.e., codes in which multiple symbols are associated with each transition through the trellis; by applying appropriate puncturing tables to low-rate MTCM codes, we obtain families of MTCM codes, all of which can be decoded with (essentially) the same decoder.

    By means of computer search, several such families are designed so that each family member is at least as good as any comparable code in the literature. (ﲇood here is defined in terms of minimum time diversity and minimum squared product distance, the most important parameters for performance over Rayleigh fading channels.) A protocol to implement these rate-compatible trellis codes in a type-II hybrid ARQ format with only a low-rate feedback channel is described. Upper bounds on the resulting bit error rate are developed and the results are used to select the best adaptive code from several possibilities. Simulation results comparing the proposed scheme with fixed-rate codes of the same throughput show substantial coding gain. Finally, a protocol modification limiting the variability of the code rate over a frame is described; this modification eliminates the need for excessive buffering, with a very small effect on performance

  • Thumbnail Image
    Item
    Fast Blind Adaptive Algorithms for Equalization and Diversity Reception in Wireless Communications Using Antenna Arrays
    (1996) Li, Ye; Liu, K.J. Ray; ISR
    To combat the multipath and time-variant fading of wireless communication channels, antenna arrays are usually used to improve the quality and increase the capacity of communication service. This paper investigates the fast blind adaptive algorithms for the equalization and diversity combining in wireless communication systems using antenna arrays. Two second- order statistics based algorithms, SOSA and MSOS, for equalization and diversity combining are proposed and their convergence in noiseless and noisy channels is analyzed. Since the proposed algorithms use only second-order statistics or correlation of the channel outputs, they converge faster than the higher-order statistics based algorithms, which is also confirmed by computer simulations examples.