206639827
OFDM or single-carrier block transmissions?
We compare two block transmission systems over frequency-selective fading channels: orthogonal frequency-division multiplexing (OFDM) versus single-carrier modulated blocks with zero padding (ZP). We first compare their peak-to-average power ratio (PAR) and the corresponding power amplifier backoff for phase-shift keying or quadrature amplitude modulation. Then, we study the effects of carrier frequency offset on their performance and throughput. We further compare the performance and complexity of uncoded and coded transmissions over random dispersive channels, including Rayleigh fading channels, as well as practical HIPERLAN/2 indoor and outdoor channels. We establish that unlike OFDM, uncoded block transmissions with ZP enjoy maximum diversity and coding gains within the class of linearly precoded block transmissions. Analysis and computer simulations confirm the considerable edge of ZP-only in terms of PAR, robustness to carrier frequency offset, and uncoded performance, at the price of slightly increased complexity. In the coded case, ZP is preferable when the code rate is high (e.g., 3/4), while coded OFDM is to be preferred in terms of both performance and complexity when the code rate is low (e.g., 1/2) and the error-correcting capability is enhanced. As ZP block transmissions can approximate serial single-carrier systems as well, the scope of the present comparison is broader.
18739199
Block spreading for MUI/ISI-resilient generalized multi-carrier CDMA with multirate capabilities
The potential increase in capacity along with the need to provide multimedia services and cope with multiuser interference (MUI) and intersymbol interference (ISI) arising due to wireless multipath propagation, motivate well multirate wideband code-division multiple-access (CDMA) systems. This paper develops an all-digital block-spread filterbank framework capable of encompassing single- or multi-rate transceivers for asynchronous or quasi-synchronous CDMA transmissions through multipath channels. Thanks to symbol blocking and through appropriate design of user codes, the resulting generalized multi-carrier (GMC) CDMA system guarantees symbol recovery irrespective of the (possibly unknown) FIR multipath channels in both downlink and uplink setups with low complexity FIR receivers. Simulations corroborate that the novel GMC-CDMA system outperforms existing multirate alternatives in the presence of asynchronism and multipath.
13893124
Lifetime Maximization of Sensor Networks Under Connectivity and k-Coverage Constraints
In this paper, we study the fundamental limits of a wireless sensor network's lifetime under connectivity and k-coverage constraints. We consider a wireless sensor network with n sensors deployed independently and uniformly in a square field of unit area. Each sensor is active with probability p, independently from others, and each active sensor can sense a disc area with radius rs. Moreover, considering the inherent irregularity of a sensor's sensing range caused by time-varying environments, we model the sensing radius rs as a random variable with mean r0 and variance r$_{\rm 0}^{\rm 2}$σ$_{s}^{\rm 2}$. Two active sensors can communicate with each other if and only if the distance between them is smaller than or equal to the communication radius rc. 
 
The key contributions of this paper are: (1) we introduce a new definition of a wireless sensor network's lifetime from a novel probabilistic perspective, called ω-lifetime (0 ≤ ω ≤ 1). It is defined as the expectation of the time interval during which the probability of guaranteeing connectivity and k-coverage simultaneously is at least ω; and (2) based on the analysis results, we propose a near-optimal scheduling algorithm, called PIS (Pre-planned Independent Sleeping), to achieve the network's maximum ω-lifetime, which is validated by simulation results, and present a possible implementation of the PIS scheme in the distributed manner.
750827
Outage mutual information of space-time MIMO channels
We derive analytical expressions for the probability density function (pdf) of the random mutual information between transmitted and received vector signals of a random space-time independent and identically distributed (i.i.d.) multiple-input multiple-output (MIMO) channel, assuming that the transmitted signals from the multiple antennas are Gaussian i.i.d.. We show that this pdf can be well approximated by a Gaussian distribution, and such a Gaussian approximation is based on expressions for the given pdfs mean and variance that we derive. We prove that at high signal-to-noise ratio (SNR), every factor of 2 increase in SNR leads to an increase in outage rate in the amount of min(M,N) bits, where M and N denote the number of transmit and receive antennas, respectively. A simple expression for the moment generating function (MGF) of the mutual information pdf is also provided, based on which we establish normality of the pdf, when both M and N are large, and the SNR is large.
7391513
Asymptotic performance of hybrid-selection/maximal-ratio combining over fading channels
In this letter, we study the asymptotic performance of hybrid-selection/maximal-ratio combining (HS/MRC) and postdetection HS/equal-gain combining (HS/EGC) over generalized fading channels for large average signal-to-noise ratios (ASNRs). By evaluating the asymptotic moment generating function of the HS/MRC output SNR at high ASNR, we derive the diversity and coding gains for HS/MRC for a large class of modulation formats and versatile fading conditions, including different types of fading channels and nonidentical SNR statistics across diversity branches. Our analytical results reveal that the diversity gains of HS/MRC and HS/EGC are equivalent to that of MRC, and the difference in the coding gains for different modulation formats is manifested in terms of a modulation factor defined in this letter. Some new analytical results about effects of the number of combined branches for HS/MRC and noncoherent combining loss of HS/EGC are also provided.
14892821
A Novel Real-Time MAC Protocol Exploiting Spatial and Temporal Channel Diversity in Wireless Industrial Networks
Wireless technology is increasingly finding its way into industrial communication because of the tremendous advantages it is capable of offering. However, the high bit error rate characteristics of wireless channel due to conditions like attenuation, noise, channel fading and interference seriously impact the timeliness and guarantee that need to be provided for real-time traffic. Existing wired protocols including the popular PROFIBUS perform unfavorably when extended or adapted to the wireless context. Other wireless protocols proposed either do not adapt well to erroneous channel conditions or do not provide real-time guarantees. In this paper, we present a novel real-time MAC (Medium Access Control) protocol that is specifically tailored to the message characteristics and requirements of the industrial environments. The protocol exploits both the spatial and temporal diversity of the wireless channel to effectively schedule real-time messages in the presence of bursty channel error conditions. Simulation results show that the proposed protocol achieves much better loss rate compared to baseline protocols under bursty channel conditions.
18764674
Image information restoration based on long-range correlation
A new class of image information restoration algorithms, virtually different from traditional techniques, is proposed. In comparison with other approaches, our methods use not only the information in local areas, but also that in the remote regions of the image. The methods originate from the idea that there exists abundant long-range correlation within natural images and the human vision system, composed of our eyes and brains, can sufficiently utilize such types of information redundancy to implement the functions of image interpretation, representation, restoration, enhancement and error concealment. Our general approach can be summarized as five basic steps: fetching, searching, matching, competing and recovering. The experimental results on several practical applications show that our methods perform substantially better than many other state-of-the-art methods.
33403859
Area-power-time efficient pipeline-interleaved architectures for wave digital filters
Various forms of pipelining are explored for low power implementation of lattice wave digital filters realized with 3-port adaptors. In these filters, the time performance of pipelining is constrained by recursion. Using the fastest, block pipelined architecture as a reference point, it is shown that additional levels of pipelining can be applied to reduce the power consumption, at the expense of slightly changing the maximum sample rate. In one case power is reduced by 65% with only a modest speed penalty. Area increases due to additional pipeline registers can be more than offset if the consequent interleaving capability is utilized.
153966
Compiling for the Impulse memory controller
The Impulse memory controller provides an interface for remapping irregular or sparse memory accesses into dense accesses in the cache memory. This capability significantly increases processor cache and system bus utilization, and previous work shows performance improvements from a factor of 1.2 to 5 with current technology models for hand-coded kernels in a cycle-level simulator. To attain widespread use of any specialized hardware feature requires automating its use in a compiler. We present compiler cost models using dependence and locality analysis that determine when to use Impulse to improve performance based on the reduction in misses, the additional cost for misses in Impulse, and the fixed cost for setting up a remapping. We implement the cost models and generate the appropriate Impulse system calls in the Scale compiler framework. Our results demonstrate that our cost models correctly choose when and when not to use Impulse. We also combine and compare Impulse with our implementation of loop permutation for improving locality. If loop permutation can achieve the same dense access pattern as Impulse, we prefer it, since it has no overheads, but we show that the combination can yield better performance.
5251967
Foveation scalable video coding with automatic fixation selection
Image and video coding is an optimization problem. A successful image and video coding algorithm delivers a good tradeoff between visual quality and other coding performance measures, such as compression, complexity, scalability, robustness, and security. In this paper, we follow two recent trends in image and video coding research. One is to incorporate human visual system (HVS) models to improve the current state-of-the-art of image and video coding algorithms by better exploiting the properties of the intended receiver. The other is to design rate scalable image and video codecs, which allow the extraction of coded visual information at continuously varying bit rates from a single compressed bitstream. Specifically, we propose a foveation scalable video coding (FSVC) algorithm which supplies good quality-compression performance as well as effective rate scalability. The key idea is to organize the encoded bitstream to provide the best decoded video at an arbitrary bit rate in terms of foveated visual quality measurement. A foveation-based HVS model plays an important role in the algorithm. The algorithm is adaptable to different applications, such as knowledge-based video coding and video communications over time-varying, multiuser and interactive networks.
1450237
An Improved Constructive Neural Network Ensemble Approach to Medical Diagnoses
Neural networks have played an important role in intelligent medical diagnoses. This paper presents an Improved Constructive Neural Network Ensemble (ICNNE) approach to three medical diagnosis problems. New initial structure of the ensemble, new freezing criterion, and a different error function are presented. Experiment results show that our ICNNE approach performed better for most problems.