21 April 2018 in Journal of Intelligent & Robotic Systems
The rapid development of autonomous systems and Information and Communications Technologies (ICT) create new opportunities for maritime activities. Existing autonomous systems are becoming more powerful and utilise the capabilities of several types of devices such as Autonomous Underwater Vehicles (AUVs), Unmanned Surface Vehicles (USVs) – sometimes referred as Autonomous Surface Vehicles (ASVs) –, Unmanned Aerial Vehicles (UAVs), moored and drifting systems and, recently emerging, autonomous vessels. Their importance in providing new services in maritime environments is undeniable and the opportunity for coordinated and interconnected operations is clear. However, continuous wide integration of various technologies in maritime environments still faces many challenges. Operations may take place in remote locations, so that dependence on third-party infrastructures such as satellite communication or terrestrial communication systems must be expected. The reliability, performance, availability, and cost of such systems are important issues that need to be tackled. This work reviews the major advancements on state-of-the-art autonomous maritime vehicles and systems, which are used in several different scenarios, from scientific research to transportation. Moreover, the paper highlights how available technologies can be composed in order to efficiently and effectively operate in maritime environments. Highlights of the trade-off between autonomy and communication requirements are provided and followed by an overview of promising communication and networking technologies that could encourage the integration of autonomous systems in maritime scenarios.
26 February 2007 in IEEE Transactions on Wireless Communications
A frequency domain soft-interference canceling minimum mean-square error (MMSE) turbo equalizer is studied. A computationally efficient method for computing extrinsic information transfer (EXIT) function of the equalizer is proposed. The method is based on the Gaussian approximation for the equalizer output and it produces an approximate EXIT chart in a fraction of computational load compared to previous numerical methods. The accuracy of the method is verified for both single-input single-output (SISO) and multiple-input multiple output (MIMO) channels
8 September 2016 in IEEE Transactions on Wireless Communications
In this paper, we consider a wireless sensor network (WSN) with sensors simultaneously reporting their decision to a fusion center (FC) equipped with multiple antennas. A Gaussian mixture channel model is used to obtain a general fading characterization of the channels ensemble between the sensors and the FC. Energy detection is studied as an appealing low-complexity sub-optimal alternative to the (computationally expensive) optimal test based on log-likelihood ratio. Closed-form theoretical performance is obtained for the energy test and furthermore asymptotic analysis for both tests is derived in order to provide a detailed characterization of large-system scenarios. Finally, the simulation results are provided to confirm the theoretical results and compare performance trends of the two tests.
12 December 2014 in IEEE Communications Letters
We analyze sufficiency and optimality of energy detection (ED) for decision fusion. The considered scenario assumes on-off keying (OOK), statistical channel state information and a fusion center (FC) equipped with multiple antennas. The fading is modeled through zero-mean Gaussian mixtures (GM) to deal with arbitrary non-line-of-sight (NLOS) environments. Theoretical findings are supported by numerical simulations.
30 July 2015 in IEEE Transactions on Wireless Communications
To obtain the optimal coefficient matrix for the integer-forcing (IF) linear receiver, the successive minima problem (SMP) on lattices needs to be solved. By decomposing SMP into a series of subspace avoiding problems (SAP) and developing a modified sphere-decoding (SD) algorithm based on the Schnorr-Euchner (SE) enumeration strategy to solve each instance of SAP, two practical algorithms are constructed to solve SMP exactly for real and complex lattices respectively. The initial radius and the starting position on the search-tree of the SAP algorithm are optimized by exploiting the intermediate results obtained in previous rounds. As compared to the Minkowski reduction algorithm, the proposed complex SMP algorithm brings not only more freedom in lattice code design, but also computation reduction in finding the coefficient matrix. Moreover, benefiting from the tree-search initialization optimization, the proposed real SMP algorithm can bring even more computation reduction when the system size is large. However, the proposed algorithms achieve practically the same performance as Minkowski reduction for the IF linear receiver, as the Minkowski-reduced basis approximates successive minima very closely.