On the sampling of generalized almost-cyclostationary signals

Chapter 9 - Discrete-Time Signals and Systems

Chapter 1 - Continuous-Time Signals

Hybrid systems modelers like Simulink come with a rich collection of discrete-time and continuous-time blocks. Most blocks are not defined in terms of more elementary ones—and some cannot be—but are instead written in imperative code and explained informally in a reference manual. This raises the question of defining a minimal set of orthogonal programming constructs such that most blocks can be programmed directly and thereby given a specification that is mathematically precise, and whose compiled version performs comparably to handwritten code. In this paper, we show that a fairly large set of blocks of a standard library like the one provided by Simulink can be programmed in a precise, purely functional language using stream equations, hierarchical automata, Ordinary Differential Equations (ODEs), and deterministic synchronous parallel composition. Some blocks cannot be expressed in our setting as they mix discrete-time and continuous-time signals in unprincipled ways that are statically forbidden by the type checker. The experiment is conducted in Zélus, a synchronous language that conservatively extends L ustre with ODEs to program systems that mix discrete-time and continuous-time signals.

Continuous-time or analog signals are processed using analog devices such as amplifiers, filters, etc. It is impossible to process signals multiplexed from various sources using a single hardware system in the analog domain. On the other hand, digital signals can be processed using both special-purpose hardware and software systems. Worldwide use of Internet, mobile communications, etc. demands all kinds of data such as video, audio, graphics, etc. In order to receive this information on a single device, computer, for instance, it is impossible to use analog signals and techniques. In order to be able to design and implement digitally based systems, it is absolutely necessary to have an understanding of digital signals and systems. Digital signals are discrete in time and amplitude. However, we will assume discrete-time signals to have a continuum of amplitude in order to be able to analyze such signals and systems mathematically. In this chapter we will describe typical discrete-time signals mathematically and then use them to describe and analyze linear time-invariant discrete-time systems. To help the readers understand the mathematical details, we will work out examples followed by MATLAB-based examples. Since digital signals are obtained from analog sources, we will also discuss the conversion of continuous-time signals into digital signals using analog-to-digital converters (ADC).

A discrete time signal is one that has a value only for a finite or infinite number of time instants whereas a continuous time signal has a value for every (real) time instant. For example, consider: The sound pressure wave of a speech signal The electrical that is the output of a transducer that is used to mesdsure the cound pressure wave of a speech signal The sequence of numbers that is obtained from connecting an analg to digital converter (ADC) to the electrical signal sound pressure wave of a speech signal KeywordsSpeech SignalAnalog SignalAnalog InputLinear Predictive CodeDiscrete Time SignalThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This paper proposes an adaptive digital filtering method which improves continuous-time performance. To take account of continuous-time performance, we make an assumption that the adaptive filter can exploit the continuous-time error signal, and define the integral of the square error signal as a performance index. Using lifting, the performance index can be equivalently reduced to a summation of discrete-time signals. Therefore it is shown that the recursive formula for the filtering problem with the performance index is given by the well-known RLS algorithm. Next, a more implementable case is considered where the output of the unknown system is approximated by the oversampled discrete-time signal and the summation of the squared discrete-time signals is defined as an approximate performance index. It is shown that the approximate performance index can be directly applied to the first result. Finally, some numerical examples are given to illustrate the effectiveness of the proposed method.

Basics of Multirate Digital Signal Processing

Gabor's expansion and the Zak transform for continuous-time and discrete-time signals

We derive an approximate analytic model for the eigenfunctions of underspread LTV channels which plays a fundamental role in the analysis/synthesis of the optimal precoding that maximizes the information rate in transmissions over linear time-varying (LTV) channels. We assume that channel status information is available to both receiver and transmitter and that the channel impulse response can be predicted exactly, within a finite duration interval, from its past evolution. More specifically, we use our analytic model to prove that the optimal precoding is equivalent to applying the water-filling principle in the time-frequency domain and to simplify the computation of the optimal precoder. We include numerical results to support the validity of our model.

When discretizing continuous-time systems or signals, one is often interested in preserving a property termed covariance-invariance. In this paper a technique is outlined for synthesizing discrete-time systems and signals which are covariance-invariant with corresponding continuous-time systems and signals. Applications of the technique to process simulation, minimum mean-squared error estimation, and digital filter synthesis are outlined, with example designs presented for covariance-invariant Butterworth and Chebychev digital filters. Based on the frequency response of these designs it is argued that the method of covariance-invariance is superior to the methods of impulse-invariance and bilinear-z as a response matching design technique for the synthesis of digital filters. This superiority is especially apparent at sampling rates that are marginal with respect to filter critical frequencies.

General Information Product Theory in Economics Science

Central limit theorem, modern extreme value theory and the theory that the discrete orthogonal frequency division multiplexing signals converge weakly to a Gaussian random process are generally employed to derive the best approximation of peak-to-average power ratio distributions of discrete-time and continuous-time signals. In this paper, we arrive at a simple, rigorously justified, and accurate expression of the upper bound of the probability density function of the PAPR in context of orthogonal frequency division multiplexing systems. Since this bound has a complex expression not convenient to deal with in practice, we show also the demonstration of an accurate estimation of the proposed bound.

In this paper, we discuss a concept of the mixed Fourier transformation, when signals are transformed to the time-frequency domain, where the difference between the time and frequency is disappeared. Both cases of continuous-time and discrete-time signals are considered, and properties of the mixed transformations are described. The concept of mixed Fourier transform includes the fractional power of the discrete Fourier transform (DFT) which is referred to as a discrete version of the fractional Fourier transform. Mixed Fourier transformations can be used for calculation of roots of the Fourier and identity transformations. Examples of such root transforms for signal processing and image encryption are given.

Switched-capacitor decimation filter design using time-multiplexing and polyphase decomposition of transfer functions with low denominator orders

Functional Reactive Programming (FRP) is an approach to reactive programming where systems are structured as networks of functions operating on signals. FRP is based on the synchronous data-flow paradigm and supports both continuous-time and discrete-time signals (hybrid systems). What sets FRP apart from most other languages for similar applications is its support for systems with dynamic structure and for higher-order reactive constructs.Statically guaranteeing correctness properties of programs is an attractive proposition. This is true in particular for typical application domains for reactive programming such as embedded systems. To that end, many existing reactive languages have type systems or other static checks that guarantee domain-specific properties, such as feedback loops always being well-formed. However, they are limited in their capabilities to support dynamism and higher-order data-flow compared with FRP. Thus, the onus of ensuring such properties of FRP programs has so far been on the programmer as established static techniques do not suffice.In this paper, we show how dependent types allow this concern to be addressed. We present an implementation of FRP embedded in the dependently-typed language Agda, leveraging the type system of the host language to craft a domain-specific (dependent) type system for FRP. The implementation constitutes a discrete, operational semantics of FRP, and as it passes the Agda type, coverage, and termination checks, we know the operational semantics is total, which means our type system is safe.