The real-time implementation of many digital signalprocessing (DSP) algorithms requires novel algorithm mapping methods and architectures. Some of the architectures developed thus far include data-flow systems, systo...
详细信息
The real-time implementation of many digital signalprocessing (DSP) algorithms requires novel algorithm mapping methods and architectures. Some of the architectures developed thus far include data-flow systems, systolic arrays, and wavefront arrays. Ideas from these architectures are combined with the concept of block data flow processing to present the block data flow architecture (BDFA). Key features of the BDFA include direct input/output to all processors, linear data-flow, and globally asynchronous operation. Use of the BDFA for 2-D filtering is presented and analyzed. The analysis is facilitated using timing results generated by a simulator developed with the C programming language. Development of the simulator is discussed in terms of how an architecture like the BDFA can be described and simulated in C. Simulation results show that the increase in throughput with the number of processors is nearly linear.< >
Several types of heart malfunctions are usually caused by heart attack, rhythm disturbances and pathological degenerations. Unfortunately large groups of people are affected by this problem. The main goal of this pape...
详细信息
Several types of heart malfunctions are usually caused by heart attack, rhythm disturbances and pathological degenerations. Unfortunately large groups of people are affected by this problem. The main goal of this paper is to compare the direct and inverse ECG signalprocessing methods, and to define an optimal solution in different circumstances. Due to the high number of unknown parameters, both algorithms apply stochastic processing methods. None of the processing ways can give us "best" results. The performance is determined by the known and unknown parameters. In most cases both methods can contribute to the optimal solution.
The paper presents a high speed and a high resolution pipelined A/D converter relying on a current mode technique. The A/D converter structure is composed of current mode building blocks. All building blocks have been...
详细信息
The paper presents a high speed and a high resolution pipelined A/D converter relying on a current mode technique. The A/D converter structure is composed of current mode building blocks. All building blocks have been designed, then manufactured, in CMOS AMS 0.8 /spl mu/m technology and measured to verify the proposed concept.
In an effort to produce more efficient means of transforming new algorithm concepts into working models, this paper describes the development of a digital signalprocessing workstation accepting input entirely in grap...
详细信息
In an effort to produce more efficient means of transforming new algorithm concepts into working models, this paper describes the development of a digital signalprocessing workstation accepting input entirely in graphic form. This Graphic Oriented signalprocessing Language (GOSPL) accepts flow graph information in block diagram form using a mouse input device. The researcher uses the mouse to describe graph connections and create function blocks in the flow graph by selecting them from a menu. The system executes a broad class of flow graphs and provides virtual instruments to monitor signals throughout the graph during real-time execution.
This paper quantifies the performance difference between custom and generic hardware algorithm implementations, illustrating the challenges that are involved in Body Area Network signalprocessing implementations. The...
详细信息
This paper quantifies the performance difference between custom and generic hardware algorithm implementations, illustrating the challenges that are involved in Body Area Network signalprocessing implementations. The potential use of analogue signalprocessing to improve the power performance is also demonstrated.
Covariance shaping least squares estimator is a new kind of linear estimator based on covariance shaping in quantum signalprocessing (QSP) *** this paper,we apply the covariance shaping least squares (CSLS) estimator...
详细信息
Covariance shaping least squares estimator is a new kind of linear estimator based on covariance shaping in quantum signalprocessing (QSP) *** this paper,we apply the covariance shaping least squares (CSLS) estimator to the detection of MIMO systems that leads to a new detection algorithm,covariance shaping MIMO detection *** derive the formalism of covariance shaping MIMO detection algorithm,and analyze its performance by numerical *** results show that the performance of system is better than that of detection algorithm with Zero-forcing and MMSE solutions,and the objective covariance matrix plays an important role in the proposed scheme
A theoretical and algorithmic framework is proposed for optimal identification of rational transfer function parameters of discrete-time linear systems from input-output (IO) data. The nonlinear criterion is theoretic...
详细信息
A theoretical and algorithmic framework is proposed for optimal identification of rational transfer function parameters of discrete-time linear systems from input-output (IO) data. The nonlinear criterion is theoretically decoupled into a purely linear problem for estimating the optimal numerator and a nonlinear problem for the optimal denominator. The proposed decoupled approach has reduced computational requirements when compared with existing algorithms that estimate the parameters simultaneously.
It is noted that signalprocessing designs for real-time large-scale systems are increasingly confronted with two conflicting objectives. The traditional objective of optimal design in low signal-to-noise ratio enviro...
详细信息
It is noted that signalprocessing designs for real-time large-scale systems are increasingly confronted with two conflicting objectives. The traditional objective of optimal design in low signal-to-noise ratio environments is confronted with the need for simplicity in implementation and speed of computation. The inclusion of high throughput and efficient hardware utilization as constraints on digital filter designs is considered. In particular, implementation of the design via an array processor is introduced. The concept of fast processing becomes synonymous with high throughout and efficient implementation on such a device. Using an array interpretation of the FFT structure, the retention of this highly efficient structure in a general design setting is demonstrated. For a typical signal extraction design, a constrained least-squares minimization is introduced to determine optimal enhancing filters with highly efficient array implementation.< >
There is a growing cross-disciplinary effort in the broad domain of optimization and learning with streams of data, applied to settings where traditional batch optimization techniques cannot produce solutions at time ...
详细信息
There is a growing cross-disciplinary effort in the broad domain of optimization and learning with streams of data, applied to settings where traditional batch optimization techniques cannot produce solutions at time scales that match the interarrival times of the data points due to computational and/or communication bottlenecks. Special types of online algorithms can handle this situation, and this article focuses on such time-varying optimization algorithms, with emphasis on machine leaning (ML) and signalprocessing (SP) as well as data-driven control (DDC). Approaches for the design of time-varying or online first-order optimization methods are discussed, with emphasis on algorithms that can handle errors in the gradient, as may arise when the gradient is estimated. Insights into performance metrics and accompanying claims are provided, along with evidence of cases where algorithms that are provably convergent in batch optimization may perform poorly in an online regime. The role of distributed computation is discussed. Illustrative numerical examples for a number of applications of broad interest are provided to convey key ideas.
Bi-level optimization, where the objective function depends on the solution of an inner optimization problem, provides a flexible framework for solving a rich class of problems such as hyper-parameter optimization and...
详细信息
Bi-level optimization, where the objective function depends on the solution of an inner optimization problem, provides a flexible framework for solving a rich class of problems such as hyper-parameter optimization and model-agnostic meta-learning. This work puts forth the first Stochastic Bi-level Frank-Wolfe (SBFW) algorithm to solve the stochastic bi-level optimization problems in a projection-free manner. We utilize a momentum based gradient tracker that results in a sample complexity of O(epsilon(-3)) for convex outer objectives and O(epsilon(-4)) for non-convex outer objectives with strongly convex inner objectives. The stochastic compositional optimization problems (a special case of bi-level optimization problems entailing the minimization of a composition of two expected-value functions) are also considered within the same rubric. The proposed Stochastic Compositional Frank-Wolfe (SCFW) algorithm is shown to achieve a sample complexity of O (epsilon(-2)) for convex objectives and O(epsilon(-3)) for non-convex objectives, at par with the state-of-the-art rates of projection-free algorithms for single-level problems. The usefulness and flexibility of SBFW and SCFW algorithms are demonstrated via extensive numerical tests. We show that SBFW outperforms the state-of-the-art methods for the problem of matrix completion with denoising, and achieve improvements of up to 82% in terms of the wall-clock time required to achieve a particular level of accuracy. Furthermore, we demonstrate the improved performance of SCFW over the competing projection-free variants on the policy evaluation problem in reinforcement learning.
暂无评论