The recursive least-squares (RLS) algorithm has been used in the adaptive synthesis filter bank for fast convergence. However, because of interpolation operations involved in the synthesis process, fast RLS algorithms...
详细信息
The recursive least-squares (RLS) algorithm has been used in the adaptive synthesis filter bank for fast convergence. However, because of interpolation operations involved in the synthesis process, fast RLS algorithms cannot be applied. In this Letter, an approach is proposed that can formulate subband reconstruction as a multichannel filtering problem. This formulation allows the application of fast multichannel RLS algorithms and substantial reduction in computationalcomplexity.
The potential presence of fractional delays, nonminimum phase parts, and a colouring of the channel output can require adaptive equalisers to adapt very long filters, which can have slow convergence for LMS-type adapt...
详细信息
The potential presence of fractional delays, nonminimum phase parts, and a colouring of the channel output can require adaptive equalisers to adapt very long filters, which can have slow convergence for LMS-type adaptive algorithms. The authors present a novel oversampled subband approach to adaptive equalisation, which can both significantly reduce computationalcomplexity and improve convergence speed.
End-to-end rate based congestion management has been extensively studied for control of computer communication networks, In this paper, we examine some of the properties of end-to-end rate based algorithms for congest...
详细信息
End-to-end rate based congestion management has been extensively studied for control of computer communication networks, In this paper, we examine some of the properties of end-to-end rate based algorithms for congestion management using explicit rate feedback, to achieve maxmin fair rate allocation in the network, We formulate a requirement on a switch's local rate allocation computation sufficient to ensure convergence of the distributed algorithm to the global maxmin fair rate allocation, We provide an upper bound on the convergence time when the switch algorithm satisfies this requirement. We propose a requirement of feasibility of the transmission rates, maintaining which results in oscillation-tree operation of the algorithm while maintaining small queues at the switches, Feasibility implies that the capacity of any of the resources is not exceeded at any time, We suggest a source policy to ensure feasibility of transmission rates, the essence of which is to delay a rate increase by a certain time, while decreasing the transmission rate immediately upon receiving the appropriate feedback, Finally, we seek ways of improving scalability of the computation of maxmin fair rates in the presence of a large number of flows, We suggest using a discrete set of rates, which as we show, reduces the computationalcomplexity and the state requirement at the switches,
A Multiresolution method to match deformed contours is presented [1-2]. Our approach has been inspired by the method due to Duncan and Cohen [3-4]. The innovation of our work is in the incorporation of a new smoothnes...
详细信息
ISBN:
(纸本)7505338900
A Multiresolution method to match deformed contours is presented [1-2]. Our approach has been inspired by the method due to Duncan and Cohen [3-4]. The innovation of our work is in the incorporation of a new smoothness term in the elastic fitting criterion. As a result, the computationalcomplexity is reduced and the equation corresponding to the minimization of the fitting criterion has a simple interpretation. In this paper, we investigate the necessary and sufficient conditions to the minimization of the fitting criterion using variational calculus.
This paper presents the idea of optimization algorithm of adaptive wavelets that can improve the coding algorithm to decrease the computation complexity to ten percent of that presented in the paper[5]. The full optim...
详细信息
ISBN:
(纸本)7505338900
This paper presents the idea of optimization algorithm of adaptive wavelets that can improve the coding algorithm to decrease the computation complexity to ten percent of that presented in the paper[5]. The full optimization of adaptive wavelets is replaced by the new method, in which the optimization is divided into two cascaded steps. And the entropy-coding-based quantization of side information is adopted so that tile bit rate is significantly reduced because it accounts for a plenty of percent of bit costs. The bit rate can decrease about 15 percent of that presented ill paper [8] by taking the method. It also coordinates with psycho-acoustics model and dynamic bits allocation scheme to make the coding noise inaudible under the condition of the least bits cost.
In this paper,we propose a novel multiuser detector based on the reduced state Viterbi *** partitions the total K users into G groups according to their power strengths and interference le
ISBN:
(纸本)0780329163
In this paper,we propose a novel multiuser detector based on the reduced state Viterbi *** partitions the total K users into G groups according to their power strengths and interference le
A hierarchical method for efficient solving the false path problem is presented. In a preprocessing step, all the local and user-intended logical incompatibilities are eliminated by generating timing views for these b...
详细信息
A hierarchical method for efficient solving the false path problem is presented. In a preprocessing step, all the local and user-intended logical incompatibilities are eliminated by generating timing views for these basic cells. These timing views are hierarchically composed, and there remain fewer (or no) logical incompatibilities. Therefore, the CPU-times required by the longest sensitizable path algorithm are much lower, and, for complex examples, this can mean a reduction of two orders of magnitude
Stochastic linear predictive coders can produce good quality speech at low bit rates but are computationally very demanding. A method for reducing the computationalcomplexity of the selection process for the optimum ...
详细信息
Stochastic linear predictive coders can produce good quality speech at low bit rates but are computationally very demanding. A method for reducing the computationalcomplexity of the selection process for the optimum innovation sequence is described. The improved efficiency can be achieved without any reduction in the performance of the coder.
暂无评论