Several polymer nanocomposites have been examined by the research community, aiming to clarify how the incorporation of nanoparticles in a pure polymer affects its dielectric properties. A number of factors can affect...
详细信息
Future wireless systems need extremely fast and flexible architectures to support varying standards, algorithms and protocols with data rates in the range of 10-100 Mbps. Software Defined Radios (SDRs) based on DSP-FP...
详细信息
Future wireless systems need extremely fast and flexible architectures to support varying standards, algorithms and protocols with data rates in the range of 10-100 Mbps. Software Defined Radios (SDRs) based on DSP-FPGAs are a widely proposed solution for these systems. However, these SDR solutions have not been able to meet real-time requirements. We propose a programmable architecture solution for SDRs using a stream-based architecture based on the Imagine media processor. The configurable Imagine simulator allows us to investigate issues such as memory bottlenecks, number and type of functional units needed, and the utilization of those functional units. To evaluate stream-based architectures for baseband processing, we parallelize and implement sophisticated baseband algorithms including multiuser estimation, multiuser detection and Viterbi decoding on this simulator. We present the bottlenecks in such a stream-based architecture for efficient communications processing. Comparisons with current generation DSP-based solutions show orders-of-magnitude performance improvements, both due to the stream-based nature of computations as well as the increase in the number of functional units having a high utilization factor. The result is a baseband processor designed with broad system functionality and flexibility that approaches real-time performance for future wireless systems.
The advent of network coding has blurred the line between compression and routing in networks. In this talk, we overview the main principles of network coding and discuss the applicability of network coding to wireles...
详细信息
The advent of network coding has blurred the line between compression and routing in networks. In this talk, we overview the main principles of network coding and discuss the applicability of network coding to wireless network settings. In particular, we argue that the ablity to construct both network codes and minimum-cost subgraphs in a completely distributed fashion may provide considerable improvements, in performance and in ease of network management, over current routing-based approaches.
We present simple coding strategies, which are variants of the Schalkwijk-Kailath scheme, for communicating reliably over additive white noise channels in the presence of corrupted *** specifically, we consider a fram...
详细信息
ISBN:
(纸本)9781604237924
We present simple coding strategies, which are variants of the Schalkwijk-Kailath scheme, for communicating reliably over additive white noise channels in the presence of corrupted *** specifically, we consider a framework comprising an additive white forward channel and a backward link which is used for feedback. We consider two types of corruption mechanisms in the backward link. The first is quantization noise, i.e., the encoder receives the quantized values of the past outputs of the forward channel. The quantization is uniform, memoryless and time invariant (that is, symbol-bysymbol scalar quantization), with bounded quantization error. The second corruption mechanism is an arbitrarily distributed additive bounded noise in the backward link. Here we allow symbol-by-symbol encoding at the input to the backward channel. We propose simple explicit schemes that guarantee positive information rate, in bits per channel use, with positive error exponent. If the forward channel is additive white Gaussian then our schemes achieve capacity, in the limit of diminishing amplitude of the noise components at the backward link, while guaranteeing that the probability of error converges to zero as a doubly exponential function of the block length. Furthermore, if the forward channel is additive white Gaussian and the backward link consists of an additive bounded noise channel, with signal-To-noise ratio (SNR) constrained symbol-by-symbol encoding, then our schemes are also capacity-Achieving in the limit of high SNR.
We present a method to compute the inter-frame transformation between two range image views of complex multi-part objects. No exact feature matching is attempted and no initial approximate transformation is provided. ...
详细信息
In this paper the problem of determination of bounded output-feedback control laws which stabilize multivariable discrete-time systems described by ARMA models is investigated. The proposed approach is based upon the ...
详细信息
作者：
Lee, HuaImaging Systems Laboratory
Department of Electrical and Computer Engineering University of California Santa Barbara United States
UUV homing and docking and UAV collision avoidance are two seemingly separate research topics for different applications. Upon close examination, these two are a pair of dual problems, with interesting correspondences...
详细信息
Literature indicates that spatial diversity can be utilized to compensate channel uncertainties such as multipath fading. Therefore, in this paper, spatial diversity is exploited for locating stationary and mobile obj...
详细信息
The complexity of nonlinear and nonstationary time series is often estimated to extract features for classification and modelling. This is of particular interest to anomaly detection in cyber-physical security where t...
详细信息
This paper proposes a new algorithm for full body human motion estimation using 3D marker position measurements. The joints are represented with Lie group members, including special orthogonal groups SO(2) and SO(3), ...
详细信息
暂无评论