Sciweavers

CCECE
2006
IEEE
13 years 10 months ago
Likelihood-Based Algorithms for Linear Digital Modulation Classification in Fading Channels
Blind modulation classification (MC) is an intermediate step between signal detection and demodulation, with both military and civilian applications. MC is a challenging task, esp...
Octavia A. Dobre, Fahed Hameed
ANSS
2006
IEEE
13 years 10 months ago
Grid-Boxing for Spatial Simulation Performance Optimisation
— Computer simulations of complex systems such as physical aggregation processes or swarming and collective behaviour of life-forms, often require order N-squared computational c...
Kenneth A. Hawick, Heath A. James, C. J. Scogings
STACS
2007
Springer
13 years 10 months ago
On the Complexity of Unary Tiling-Recognizable Picture Languages
Abstract. We give a characterization, in terms of computational complexity, of the family Rec1 of the unary picture languages that are tiling recognizable. We introduce quasi-unary...
Alberto Bertoni, Massimiliano Goldwurm, Violetta L...
MFCS
2007
Springer
13 years 10 months ago
On the Complexity of Computing Treelength
We resolve the computational complexity of determining the treelength of a graph, thereby solving an open problem of Dourisboure and Gavoille, who introduced this parameter, and a...
Daniel Lokshtanov
ATAL
2007
Springer
13 years 11 months ago
Normative system games
We develop a model of normative systems in which agents are assumed to have multiple goals of increasing priority, and investigate the computational complexity and game theoretic ...
Thomas Ågotnes, Wiebe van der Hoek, Michael ...
VTC
2007
IEEE
154views Communications» more  VTC 2007»
13 years 11 months ago
An Improved Peak-to-Average Power Ratio Estimation Scheme for OFDM Systems
—To approximate the exact peaks of continuous-time orthogonal frequency division multiplexing (OFDM) signals, four times oversampling is usually employed for discrete-time OFDM s...
Chin-Liang Wang, Sheng-Ju Ku, Chun-Ju Yang
ICRA
2007
IEEE
122views Robotics» more  ICRA 2007»
13 years 11 months ago
Exploiting the Information at the Loop Closure in SLAM
— This paper presents two methods able to exploit the information at the loop closure in the SLAM problem. Both methods have three fundamental advantages. The first one is that ...
Agostino Martinelli, Roland Siegwart
ICC
2007
IEEE
110views Communications» more  ICC 2007»
13 years 11 months ago
Joint Source and Channel Coding for Image Transmission over Time Varying Channels
—In this paper, the joint source and channel coding for progressive image transmission over channels with varying SNR is considered. Since the feedback of channel status informat...
Lei Cao
VTC
2008
IEEE
236views Communications» more  VTC 2008»
13 years 11 months ago
Apriori-LLR-Threshold-Assisted K-Best Sphere Detection for MIMO Channels
—When the maximum number of best candidates retained at each tree search level of the K-Best Sphere Detection (SD) is kept low for the sake of maintaining a low memory requiremen...
Li Wang, Lei Xu, Sheng Chen, Lajos Hanzo
VTC
2008
IEEE
189views Communications» more  VTC 2008»
13 years 11 months ago
Selective Mapping with Symbol Re-Mapping for OFDM/TDM Using MMSE-FDE
—Orthogonal frequency division multiplexing (OFDM) signals have a problem with high peak-to-average power ratio (PAPR). A distortionless selective mapping (SLM) has been proposed...
Haris Gacanin, Fumiyuki Adachi