Linear spectral unmixing is a challenging problem in hyperspectral imaging that consists of decomposing an observed pixel into a linear combination of pure spectra (or endmembers) with their corresponding proportions (or abundances). Endmember extraction algorithms can be employed for recovering the spectral signatures while abundances are estimated using an inversion step. Recent works have shown that exploiting spatial dependencies between image pixels can improve spectral unmixing. Markov random fields (MRF) are classically used to model these spatial correlations and partition the image into multiple classes with homogeneous abundances. This paper proposes to define the MRF sites using similarity regions. These regions are built using a self-complementary area filter that stems from the morphological theory. This kind of filter divides the original image into flat zones where the underlying pixels have the same spectral values. Once the MRF has been clearly established, a hierarchical Bayesian algorithm is proposed to estimate the abundances, the class labels, the noise variance, and the corresponding hyperparameters. A hybrid Gibbs sampler is constructed to generate samples according to the corresponding posterior distribution of the unknown parameters and hyperparameters. Simulations conducted on synthetic and real AVIRIS data demonstrate the good performance of the algorithm.

DVB-SH (Digital Video Broadcasting- Satellite Handled) is a hybrid satellite terrestrial broadcasting standard dedicated to provide video or audio services for handheld terminals. On the satellite part, this standard can make use of interleaving mechanisms to mitigate the effects of the Land Mobile Satellite (LMS) channel. As result, these mechanisms enables the in-time distribution of a codeword over a duration ranging from 100 ms to about 30 s, depending of their parameters. This mechanism significantly improves the error recovery performance of the code however, in the literature, a theoretical evaluation at system level of this improvement is missing. Moreover, carrying out Monte-Carlo simulations implementing real decoding processes on significant traveled distances is time prohibitive. We propose hereafter a prediction method compatible with fast simulations to quantitatively evaluate the system performance in function the Packet Error Rate (PER), Erroneous Second Ratio (ESR) and zapping time. This method is based on the computation of the mutual information between emitted and received symbols for QPSK modulation and turbo coding. We demonstrate that our method reaches a prediction precision of the order of 0.1 dB, which is significantly better than two classical prediction methods. Moreover, our solution reduces the simulation time by a factor of 500 compared to Monte-Carlo. Beyond DVB-SH application, the presented approach can be applied in a large panel of satellite mobile systems and is completely new for the satellite community.

Initially envisaged to support handover between different wireless 802.x network technologies, the IEEE 802.21 standard also appears as the good candidate for handover management in future integrated satellite / terrestrial systems.This paper presents an analysis of how this standard could be implemented in the frame of a realistic scenario and taking into account the current trends in wireless network and mobility architectures. Our solution is then evaluated by means of emulation over a DVB-RCS representative testbed, and based on an experimental MIH implementation. We finally show that seamless handover can nearly be achieved with very short service outages.

This paper proposes a new modulation format suited to power- and band-limited, non-frequency selective channels. It is considered here for satellite broadcast and broadband applications. The proposed format uses combinations of Gold sequences transmitted through a spectral-efficient multi-carrier format with orthogonal frequency-division multiplexing (OFDM). We present the modulation design as well as an analytical approximation of the performances and a comparison with existing modulations. The focus is put on the power efficiency improvement. Moreover, the multi-carrier format alleviates the receiver synchronization and improves the spectral efficiency. The critical issue of Peak-to-Average-Power Ratio (PAPR) distribution and reduction is finally discussed.

This thesis, in collaboration with Rockwell-Collins France, forms part of the development of an X-band FMCW airborne radar designed for obstacles detection and collision avoidance. More precisely, this thesis deals with the problem of detecting targets which exhibit a collision trajectory with the radar carrier, in presence of ground clutter. Target detection performances are highly degraded when the targets of interest fall into ground clutter. The main goal of this thesis is to develop signal processing methods to increase radar detection capacities and recognition for collision targets inside ground clutter. First, we give a brief review of signal processing methods for target detection using an airborne FMCW radar : conventional beamforming, range migration compensation, double-FFTs for Range-Doppler Map visualization. We then derive an adaptive antenna array processing to separate ground clutter and fixed hazardous obstacles above the ground (cables, pylons, buildings, ...) using their difference in elevation angle. In the second part of this thesis, we use a long integration time and include extra information on the time model of a range cell signal : Doppler frequency variation. A collision target does not exhibit Doppler frequency ariation, whereas fixed obstacle or ground clutter exhibits a known variation depending on the carrier velocity and the aspect angle. We take advantage of this variation first to separate a cable from a pylon, and then separate collision target from ground clutter. We finally tackle the problem of adaptively detecting a collision mobile spread target in ground clutter region. The proposed algorithms in this thesis have been successively tested on experimental data.

This thesis, in collaboration with Rockwell-Collins France, forms part of the development of an X-band FMCW airborne radar designed for obstacles detection and collision avoidance. More precisely, this thesis deals with the problem of detecting targets which exhibit a collision trajectory with the radar carrier, in presence of ground clutter. Target detection performances are highly degraded when the targets of interest fall into ground clutter. The main goal of this thesis is to develop signal processing methods to increase radar detection capacities and recognition for collision targets inside ground clutter. First, we give a brief review of signal processing methods for target detection using an airborne FMCW radar : conventional beamforming, range migration compensation, double-FFTs for Range-Doppler Map visualization. We then derive an adaptive antenna array processing to separate ground clutter and fixed hazardous obstacles above the ground (cables, pylons, buildings, ...) using their difference in elevation angle. In the second part of this thesis, we use a long integration time and include extra information on the time model of a range cell signal : Doppler frequency variation. A collision target does not exhibit Doppler frequency ariation, whereas fixed obstacle or ground clutter exhibits a known variation depending on the carrier velocity and the aspect angle. We take advantage of this variation first to separate a cable from a pylon, and then separate collision target from ground clutter. We finally tackle the problem of adaptively detecting a collision mobile spread target in ground clutter region. The proposed algorithms in this thesis have been successively tested on experimental data.

Satellite communication is the achievement of more than 50 years of research in the fields of telecommunications and space technologies.First satellites had exorbitant costs for very limited performances. Technological advances occurred in these areas have helped them to become commercially feasible and satisfying. This enable the increase of satellite launches and thus, building complete satellite networks.Today, there are many GEO or LEO satellite constellations used for civilian or military applications. In general, routing in these constellations is done by pre-computing existing routes. These routes are then used for a given period and refreshed if needed. This type of routing is optimal only on deterministic topologies as a consequence we need to consider other solutions if we relax this assumption. The objective of this thesis is to explore alternatives to pre-computed routing. As a potential solution, we propose to assess the suitability of replication based routing protocols issued from the world of delay tolerant networks, DTN. To provide a relevant framework to study this topic, we focus on a particular constellation that present a quasi-deterministic nature and do not provide direct connectivity between all nodes of the system. In a second part, we focus on the modeling of the Binary Spray and Wait, routing protocol. We develop a model that can theoretically determine the distribution of end-to-end delay for any type of network, homogeneous and heterogeneous. Finally, we present a possible use of this model to conduct more in-depth theoretical analysis.

Satellite communication is the achievement of more than 50 years of research in the fields of telecommunications and space technologies.First satellites had exorbitant costs for very limited performances. Technological advances occurred in these areas have helped them to become commercially feasible and satisfying. This enable the increase of satellite launches and thus, building complete satellite networks.Today, there are many GEO or LEO satellite constellations used for civilian or military applications. In general, routing in these constellations is done by pre-computing existing routes. These routes are then used for a given period and refreshed if needed. This type of routing is optimal only on deterministic topologies as a consequence we need to consider other solutions if we relax this assumption. The objective of this thesis is to explore alternatives to pre-computed routing. As a potential solution, we propose to assess the suitability of replication based routing protocols issued from the world of delay tolerant networks, DTN. To provide a relevant framework to study this topic, we focus on a particular constellation that present a quasi-deterministic nature and do not provide direct connectivity between all nodes of the system. In a second part, we focus on the modeling of the Binary Spray and Wait, routing protocol. We develop a model that can theoretically determine the distribution of end-to-end delay for any type of network, homogeneous and heterogeneous. Finally, we present a possible use of this model to conduct more in-depth theoretical analysis.