We present a memory efficient method for transposing a run-length encoded bi-level image. Image transposing is a commonly used operation for affine transformations such as document image deskewing. The best existing m...
Broadband networks are indispensable for multimedia applications over the emerging Internet and Intranet. The very large scale integration (VLSI) has become a critical factor for cost reduction and performance improve...
详细信息
Broadband networks are indispensable for multimedia applications over the emerging Internet and Intranet. The very large scale integration (VLSI) has become a critical factor for cost reduction and performance improvement in broadband communication systems. In this paper, we study all kinds of VLSI technologies and show the optimal partition of the system functionality based upon the available VLSI processings. We demonstrate that the VLSI can provide the best solution for the performance, cost and quality of broadband networks.
We investigate the application of blind adaptive equalizers in GSM wireless communication systems. Based on a single-input two-output linear approximated model, a diversity based constant modulus algorithm (CMA) and s...
详细信息
We investigate the application of blind adaptive equalizers in GSM wireless communication systems. Based on a single-input two-output linear approximated model, a diversity based constant modulus algorithm (CMA) and super-exponential algorithm (SEA) adaptive equalizers are implemented to GSM systems without additional antennas. These diversity based CMA and SEA equalizers are robust to channel order mismatch that cannot be overcome by SOS blind channel algorithms. They are also applicable to time-variant mobile channels due to utilization of statistical information from the entire burst. The condition for the adaptive equalizers to converge is given. All simulation results are based on a more practical wireless channel model that is quasi-time-variant (piecewise time-invariant).
We propose a GSM channel identification algorithm based on the decision feedback of the derotation-based constant modulus (DB-CMA) equalizer. By using the entire DB-CMA equalizer output as the reference "training...
详细信息
We propose a GSM channel identification algorithm based on the decision feedback of the derotation-based constant modulus (DB-CMA) equalizer. By using the entire DB-CMA equalizer output as the reference "training", the channel impulse response can be more accurately identified for sequence estimation. We also propose a new semi-blind channel identification method. Based on the blind subspace method, a shorter training sequence is combined with "reliable" subspace information for channel identification with lower sensitivity to channel order mismatch and robustness to common zeros among diversity subchannels. Both methods are based on an approximated linearization of GMSK modulation and its single-input two-output model resulted from a derotation scheme. Overall improvement in the system efficiency is achieved.
Initial implementations of middleware based on standards such as CORBA have concentrated on host and language transparency issues in order to demonstrate interoperability. They have largely adopted a no-replication ap...
详细信息
Initial implementations of middleware based on standards such as CORBA have concentrated on host and language transparency issues in order to demonstrate interoperability. They have largely adopted a no-replication approach and have frequently neglected performance-at-scale issues. This has led to continuing deployment of either non-scalable full-replication approaches or ad-hoc messaging-based middleware for applications such as intelligent networks, WWW applications and collaborative virtual reality. These applications require millions of objects globally distributed across hundreds of hosts and demand a very high throughput of low-latency method invocations. Our main research aim is to be able to reason about the performance of such applications when using scalable partial-replication and object-oriented approaches to middleware. Our approach is to use a simulator to explore potential design and implemention choices. Our current simulator-driven design, called "MinORB", has been fully implemented and tested. MinORB supports scalable high performance by a combination of techniques, including weak and application-specified consistency and partial replication using fine-grained proxy caching. Experimental results show that our work compares very favourably with other leading implementations, such as OmniORB. Scalability is unparalleled, with up to 1,000,000,000 objects per address space, a maximum throughput of 42,000 invocations per second and service times as low as 4 ms.
We analyze the convergence behavior of the CRLS-SA algorithm for inverse filtering. The CRLS-SA is a cascade adaptive filter based on the RLS algorithm, with each section adapted independently based on global minimiza...
详细信息
We analyze the convergence behavior of the CRLS-SA algorithm for inverse filtering. The CRLS-SA is a cascade adaptive filter based on the RLS algorithm, with each section adapted independently based on global minimization. The subsection adaptation results in reduced computational complexity. The rate of convergence is evaluated based on the convergence time constant defined as the ratio of condition number and sensitivity. The smaller the convergence time constant, the faster the structure converges. Analysis and simulation explain and show that CRLS-SA exhibits faster convergence than the direct form RLS adaptive filter for speech type signals.
We present a memory efficient method for transposing a run-length encoded bi-level image. Image transposing is a commonly used operation for affine transformations such as document image deskewing. The best existing m...
详细信息
We present a memory efficient method for transposing a run-length encoded bi-level image. Image transposing is a commonly used operation for affine transformations such as document image deskewing. The best existing method for transposing a run-length image is the pxy table based method. For images of typical engineering drawings, which are large, crowded and noisy, this method requires an exorbitant amount of memory. The method proposed uses a very compact representation of run-length encoded images. Also, it bypasses certain steps from the pxy table based method. Consequently, the saving in memory use is proportional to the number of horizontal runs and the number of vertical (transposed) runs. The computation time for both the methods is almost identical.
We present methods to provide fault-tolerant real-time communication over ATM networks. Specifically, we are concerned with messages that have to be delivered by their deadlines even in the presence of faults. Connect...
详细信息
We present methods to provide fault-tolerant real-time communication over ATM networks. Specifically, we are concerned with messages that have to be delivered by their deadlines even in the presence of faults. Connection-oriented communications service is well-suited for mission critical applications that demand delay guarantees. A critical part of connection oriented communication is the design of a connection admission control algorithm. We develop innovative fault tolerant real-time connection admission control algorithms that use an integrated spatial and temporal redundancy scheme and provide algorithms that determine the appropriate redundancy parameters. To aid delay analysis, we first develop a generic traffic model to describe the traffic of individual connections in the network. We then develop an analytical method to derive the end-to-end delay bounds taking into account the impact of faults.
In this paper, we perform analysis and simulation for the calculation of the minimum buffer size requirements for Available Bit Rate (ABR) traffic. We utilized a recently developed feedback flow control congestion mec...
详细信息
In this paper, we perform analysis and simulation for the calculation of the minimum buffer size requirements for Available Bit Rate (ABR) traffic. We utilized a recently developed feedback flow control congestion mechanism. This mechanism belongs to a class of Backpressure (BP) algorithms. It ensures no data loss and operates based on simple "stop" and "start" signals. In our analysis, a feedback scheme on multiple ABR connections is used. Two buffering approaches are analyzed: (1) A Dedicated Approach; in which the flow control mechanism is applied independently for each of the connections. Thus, each connection is provided with its own buffer. (2) A Shared Approach; in which there will be some form of buffer sharing among the ABR connections. We studied the effects of changing the distance between nodes (connection length), number of connections, and the peak rate of each connection on buffer requirements using the two approaches.
暂无评论