17015567
Effect of channel-estimation error on QAM systems with antenna diversity
This paper studies the effect of channel estimation error and antenna diversity on multilevel quadrature amplitude modulation (M-QAM) systems over Rayleigh fading channels. Based on the characteristic function method, a general closed-form bit-error rate (BER) for M-QAM systems is presented. The effect of the inaccurate channel estimation on the performance for pilot-symbol-assisted modulation M-QAM systems with antenna diversity is investigated. Simulation results for M-QAM (M = 4, 16, 64, 256, etc.) show that the analytical method can accurately estimate the system performance. Moreover, numerical results show that with the antenna-diversity technique, the BER performance improves significantly, especially in perfect channel-estimation cases. It is also found that the channel-estimation error limits the benefit of antenna diversity. By increasing the length of the channel estimator and the amplitude of the pilot symbol, more accurate channel estimation can be achieved, so that the BER performance is improved.
16255139
Narrowband interference suppression in time-hopping impulse radio ultra-wideband communications
Ultra-wideband (UWB) technology has been considered an innovative solution for future short-range high-speed wireless communications. Interference suppression is important for the UWB devices to operate over spectrum occupied by narrowband systems. In this paper, the use of a notch filter in time-hopping impulse radio (TH-IR) for UWB communication is considered, where a Gaussian monopulse is employed with pulse position modulation. Lognormal channel fading is assumed, and a complete analytical framework is provided for the performance evaluation of using a transversal-type notch filter to reject narrowband interference (NBI). A closed-form expression of bit-error probability is derived, and the numerical results show that the use of a notch filter can improve the system performance significantly. Furthermore, a performance comparison between TH-IR and multicarrier code-division multiple-access (MC-CDMA) UWB systems is made under the conditions of the same transmit power, the same data rate, and the same bandwidth. It is shown that in the presence of NBI, the TH-IR system and MC-CDMA system achieve similar performance when both use a notch filter
21925389
Downlink transmission of broadband OFCDM Systems-part II: effect of Doppler shift
The orthogonal frequency and code division multiplexing (OFCDM) system with 2-D spreading (time- and frequency-domain spreading) is becoming a promising candidate for future broadband wireless communication systems. OFCDM is more attractive than orthogonal frequency-division multiplexing (OFDM) both by introducing frequency-domain spreading for frequency diversity provision and time-domain spreading for flexible data rate provision. To provide high-speed mobile services, multicode transmission is employed in conjunction with OFCDM. In a Gaussian or flat-fading channel, multicode channels are orthogonal. However, in a realistic wireless channel, the orthogonality no longer maintains. Thus, multicode interference (MCI) is caused. This paper focuses on the investigation of the effect of Doppler shift on the downlink transmission of high-speed mobile OFCDM systems. A practical channel estimation algorithm based on a code-multiplexed pilot channel is employed to track the variations of fading channels. Hybrid MCI cancellation and minimum mean-square error (MMSE) detection proposed by the authors is employed as an efficient way to eliminate the MCI in the frequency domain. The system performance is analytically studied with imperfect channel estimation to show how it is affected by parameters such as the window size in the channel estimation, Doppler shift, the number of stages of the hybrid detection, the power ratio of pilot to data channels, spreading factor, and so on
42638711
Hybrid DS/SFH Spread-Spectrum Multiple Access with Predetection Diversity and Coding for Indoor Radio
The authors derive close upper and lower bounds on the average bit error probability for hybrid direct-sequence/slow-frequency-hopped spread-spectrum multiple-access (DS/SFH-SSMA) systems with noncoherent DPSK demodulation, using predetection diversity (selection combining and equal gain combining) in conjunction with interleaved channel coding (Hamming
4377482
Shell texture functions
We propose a texture function for realistic modeling and efficient rendering of materials that exhibit surface mesostructures, translucency and volumetric texture variations. The appearance of such complex materials for dynamic lighting and viewing directions is expensive to calculate and requires an impractical amount of storage to precompute. To handle this problem, our method models an object as a shell layer, formed by texture synthesis of a volumetric material sample, and a homogeneous inner core. To facilitate computation of surface radiance from the shell layer, we introduce the shell texture function (STF) which describes voxel irradiance fields based on precomputed fine-level light interactions such as shadowing by surface mesostructures and scattering of photons inside the object. Together with a diffusion approximation of homogeneous inner core radiance, the STF leads to fast and detailed raytraced renderings of complex materials.
10338450
CLUE: cluster-based retrieval of images by unsupervised learning
In a typical content-based image retrieval (CBIR) system, target images (images in the database) are sorted by feature similarities with respect to the query. Similarities among target images are usually ignored. This paper introduces a new technique, cluster-based retrieval of images by unsupervised learning (CLUE), for improving user interaction with image retrieval systems by fully exploiting the similarity information. CLUE retrieves image clusters by applying a graph-theoretic clustering algorithm to a collection of images in the vicinity of the query. Clustering in CLUE is dynamic. In particular, clusters formed depend on which images are retrieved in response to the query. CLUE can be combined with any real-valued symmetric similarity measure (metric or nonmetric). Thus, it may be embedded in many current CBIR systems, including relevance feedback systems. The performance of an experimental image retrieval system using CLUE is evaluated on a database of around 60,000 images from COREL. Empirical results demonstrate improved performance compared with a CBIR system using the same image similarity measure. In addition, results on images returned by Google's Image Search reveal the potential of applying CLUE to real-world image data and integrating CLUE as a part of the interface for keyword-based image retrieval systems.
1836730
Compiled Code in Distributed Logic Simulation
A logic simulation approach known as compiled-code event-driven simulation was developed in the past for sequential logic simulation. It improves simulation performance by reducing the logic evaluation and propagation time. In this paper we describe the application of this approach to distributed logic simulation. Our experimental results show that using compiled code can greatly improve the stability and overall performance of a time-warp based logic simulator. We also present a technique called fanout aggregation that makes use of information on circuit partitions and considerably improves the run-time performance of our (distributed) compiled code simulator. It does not produce a similar improvement when used in conjunction with an interpreted simulator because of run-time overhead
19002258
Reconstructing manifold and non-manifold surfaces from point clouds
This paper presents a novel approach for surface reconstruction from point clouds. The proposed technique is general in the sense that it naturally handles both manifold and non-manifold surfaces, providing a consistent way for reconstructing closed surfaces as well as surfaces with boundaries. It is also robust in the presence of noise, irregular sampling and surface gaps. Furthermore, it is fast, parallelizable and easy to implement because it is based on simple local operations. In this approach, surface reconstruction consists of three major steps: first, the space containing the point cloud is subdivided, creating a voxel representation. Then, a voxel surface is computed using gap filling and topological thinning operations. Finally, the resulting voxel surface is converted into a polygonal mesh. We demonstrate the effectiveness of our approach by reconstructing polygonal models from range scans of real objects as well as from synthetic data.
492137
Blind source extraction in various ill-conditioned cases
The paper discusses blind source extraction in various ill-conditioned cases based on a simple extraction network model. Extractability is first analyzed for the following ill-conditioned cases: the mixing matrix is square but-singular; the number of sensors is smaller than that of sources; the number of sensors is larger than that of sources, but the column rank of the mixing matrix is deficient; the number of sources is unknown and the column rank of the mixing matrix is deficient. A necessary and sufficient condition for extractability is obtained. A cost function and an unsupervised learning algorithm for the extraction network model are developed. Simulation results are also presented to show the validity of the theoretical results and the performance and characteristics of the learning algorithm.