2,036 research outputs found

    Echo tracker/range finder for radars and sonars

    Get PDF
    An echo tracker/range finder or altimeter is described. The pulse repetition frequency (PFR) of a predetermined plurality of transmitted pulses is adjusted so that echo pulses received from a reflecting object are positioned between transmitted pulses and divided their interpulse time interval into two time intervals having a predetermined ratio with respect to each other. The invention described provides a means whereby the arrival time of a plurality of echo pulses is defined as the time at which a composite echo pulse formed of a sum of the individual echo pulses has the highest amplitude. The invention is applicable to radar systems, sonar systems, or any other kind of system in which pulses are transmitted and echoes received therefrom

    Investigation of temporal variations of winds

    Get PDF
    Nighttime observations of upper atmospheric wind data to determine physical properties of atmospher

    Observations of chemical releases from high flying aircraft

    Get PDF
    Barium and lithium vapors were released from sounding rockets in the thermosphere and observed from aboard the NASA Convair 990 at an altitude of 40,000 ft. The purpose of the releases was to (1) check out observational and operational procedures associated with the large high altitude barium release from a Scout rocket (BIC); (2) develop an all-weather technique for observing chemical releases; (3) evaluate methods of observing daytime releases, and (4) investigate the possibilities of observations from a manned satellite. The initial analysis indicates that the previous limitations on the usage of the vapor release method have been removed by the use of the aircraft and innovative photographic techniques. Methods of analysis and applications to the investigation of the thermosphere are discussed

    Numerical evaluation of the incomplete airy functions and their application to high frequency scattering and diffraction

    Get PDF
    The incomplete Airy integrals serve as canonical functions for the uniform ray optical solutions to several high frequency scattering and diffraction problems that involve a class of integrals characterized by two stationary points that are arbitrarily close to one another or to an integration endpoint. Integrals of such analytical properties describe transition region phenomena associated with composite shadow boundaries. An efficient and accurate method for computing the incomplete Airy functions would make the solutions to such problems useful for engineering purposes. Here, a convergent series solution form for the incomplete Airy functions is derived. Asymptotic expansions involving several terms were also developed and serve as large argument approximations. The combination of the series solution form with the asymptotic formulae provides for an efficient and accurate computation of the incomplete Airy functions. Validation of accuracy is accomplished using direct numerical integration data

    Study of the dynamics and ionization of the upper atmosphere Final report

    Get PDF
    Wind effects on nighttime E region ionization layer distributio

    Investigation of the time variation of sporadic-E layers Final report

    Get PDF
    Analysis of wind and electron density profiles of E-region obtained from Nike-Apache rockets launched 22 Feb. 196

    Loop splitting for efficient pipelining in high-level synthesis

    Get PDF
    Loop pipelining is widely adopted as a key optimization method in high-level synthesis (HLS). However, when complex memory dependencies appear in a loop, commercial HLS tools are still not able to maximize pipeline performance. In this paper, we leverage parametric polyhedral analysis to reason about memory dependence patterns that are uncertain (i.e., parameterised by an undetermined variable) and/or nonuniform (i.e., varying between loop iterations). We develop an automated source-to-source code transformation to split the loop into pieces, which are then synthesised by Vivado HLS as the hardware generation back-end. Our technique allows generated loops to run with a minimal interval, automatically inserting statically-determined parametric pipeline breaks at those iterations violating dependencies. Our experiments on seven representative benchmarks show that, compared to default loop pipelining, our parametric loop splitting improves pipeline performance by 4:3 in terms of clock cycles per iteration. The optimized pipelines consume 2:0 as many LUTs, 1:8 as many registers, and 1:1 as many DSP blocks. Hence the area-time product is improved by nearly a factor of 2

    Balancing Static Islands in Dynamically Scheduled Circuits using Continuous Petri Nets

    Get PDF
    High-level synthesis (HLS) tools automatically transform a high-level program, for example in C/C++, into a low-level hardware description. A key challenge in HLS is scheduling, i.e. determining the start time of all the operations in the untimed program. A major shortcoming of existing approaches to scheduling – whether they are static (start times determined at compile-time), dynamic (start times determined at run-time), or a hybrid of both – is that the static analysis cannot efficiently explore the run-time hardware behaviours. Existing approaches either assume the timing behaviour in extreme cases, which can cause sub-optimal performance or larger area, or use simulation-based approaches, which take a long time to explore enough program traces. In this article, we propose an efficient approach using probabilistic analysis for HLS tools to efficiently explore the timing behaviour of scheduled hardware. We capture the performance of the hardware using Timed Continous Petri nets with immediate transitions, allowing us to leverage efficient Petri net analysis tools for making HLS decisions. We demonstrate the utility of our approach by using it to automatically estimate the hardware throughput for balancing the throughput for statically scheduled components (also known as static islands) computing in a dynamically scheduled circuit. Over a set of benchmarks, we show that our approach on average incurs a 2% overhead in area-delay product compared to optimal designs by exhaustive search
    corecore