Une communication est impulsive chaque fois que le signal portant des informations est intermittent dans le temps et que la transmission se produit à rafales. Des exemples du concept impulsife sont : les signaux radio impulsifs, c’est-à-dire des signaux très courts dans le temps; les signaux optiques utilisé dans les systèmes de télécommunications; certains signaux acoustiques et, en particulier, les impulsions produites par le système glottale; les signaux électriques modulés en position d’impulsions; une séquence d’événements dans une file d’attente; les trains de potentiels neuronaux dans le système neuronal. Ce paradigme de transmission est différent des communications continues traditionnelles et la compréhension des communications impulsives est donc essentielle. Afin d’affronter le problème des communications impulsives, le cadre de la recherche doit inclure les aspects suivants : la statistique d’interférence qui suit directement la structure des signaux impulsifs; l’interaction du signal impulsif avec le milieu physique; la possibilité pour les communications impulsives de coder l’information dans la structure temporelle. Cette thèse adresse une partie des questions précédentes et trace des lignes indicatives pour de futures recherches. En particulier, nous avons étudié: un système d'accès multiple où les utilisateurs adoptent des signaux avec étalement de spectre par saut temporel (time-hopping spread spectrum) pour communiquer vers un récepteur commun; un système avec un préfiltre à l'émetteur, et plus précisément un transmit matched filter, également connu comme time reversal dans la littérature de systèmes à bande ultra large; un modèle d'interférence pour des signaux impulsifs. / A communication is impulsive whenever the information-bearing signal is burst-like in time. Examples of the impulsive concept are: impulse-radio signals, that is, wireless signals occurring within short intervals of time; optical signals conveyed by photons; speech signals represented by sound pressure variations; pulse-position modulated electrical signals; a sequence of arrival/departure events in a queue; neural spike trains in the brain. Understanding impulsive communications requires to identify what is peculiar to this transmission paradigm, that is, different from traditional continuous communications.In order to address the problem of understanding impulsive vs. non-impulsive communications, the framework of investigation must include the following aspects: the different interference statistics directly following from the impulsive signal structure; the different interaction of the impulsive signal with the physical medium; the actual possibility for impulsive communications of coding information into the time structure, relaxing the implicit assumption made in continuous transmissions that time is a mere support. This thesis partially addresses a few of the above issues, and draws future lines of investigation. In particular, we studied: multiple access channels where each user adopts time-hopping spread-spectrum; systems using a specific prefilter at the transmitter side, namely the transmit matched filter (also known as time reversal), particularly suited for ultrawide bandwidhts; the distribution function of interference for impulsive systems in several different settings.

Une communication est impulsive chaque fois que le signal portant des informations est intermittent dans le temps et que la transmission se produit à rafales. Des exemples du concept impulsife sont : les signaux radio impulsifs, c’est-à-dire des signaux très courts dans le temps; les signaux optiques utilisé dans les systèmes de télécommunications; certains signaux acoustiques et, en particulier, les impulsions produites par le système glottale; les signaux électriques modulés en position d’impulsions; une séquence d’événements dans une file d’attente; les trains de potentiels neuronaux dans le système neuronal. Ce paradigme de transmission est différent des communications continues traditionnelles et la compréhension des communications impulsives est donc essentielle. Afin d’affronter le problème des communications impulsives, le cadre de la recherche doit inclure les aspects suivants : la statistique d’interférence qui suit directement la structure des signaux impulsifs; l’interaction du signal impulsif avec le milieu physique; la possibilité pour les communications impulsives de coder l’information dans la structure temporelle. Cette thèse adresse une partie des questions précédentes et trace des lignes indicatives pour de futures recherches. En particulier, nous avons étudié: un système d'accès multiple où les utilisateurs adoptent des signaux avec étalement de spectre par saut temporel (time-hopping spread spectrum) pour communiquer vers un récepteur commun; un système avec un préfiltre à l'émetteur, et plus précisément un transmit matched filter, également connu comme time reversal dans la littérature de systèmes à bande ultra large; un modèle d'interférence pour des signaux impulsifs. / A communication is impulsive whenever the information-bearing signal is burst-like in time. Examples of the impulsive concept are: impulse-radio signals, that is, wireless signals occurring within short intervals of time; optical signals conveyed by photons; speech signals represented by sound pressure variations; pulse-position modulated electrical signals; a sequence of arrival/departure events in a queue; neural spike trains in the brain. Understanding impulsive communications requires to identify what is peculiar to this transmission paradigm, that is, different from traditional continuous communications.In order to address the problem of understanding impulsive vs. non-impulsive communications, the framework of investigation must include the following aspects: the different interference statistics directly following from the impulsive signal structure; the different interaction of the impulsive signal with the physical medium; the actual possibility for impulsive communications of coding information into the time structure, relaxing the implicit assumption made in continuous transmissions that time is a mere support. This thesis partially addresses a few of the above issues, and draws future lines of investigation. In particular, we studied: multiple access channels where each user adopts time-hopping spread-spectrum; systems using a specific prefilter at the transmitter side, namely the transmit matched filter (also known as time reversal), particularly suited for ultrawide bandwidhts; the distribution function of interference for impulsive systems in several different settings.

In this thesis, we consider a vector Gaussian multiple access channel (MAC) with users demanding reliable communication at specific (Shannon-theoretic) rates. The objective is to assign vectors and powers to these users such that their rate requirements are met and the sum of powers received is minimum. We identify this power minimization problem as an instance of a separable convex optimization problem with linear ascending constraints. Under an ordering condition on the slopes of the functions at the origin, an algorithm that determines the optimum point in a finite number of steps is described. This provides a complete characterization of the minimum sum power for the vector Gaussian multiple access channel. Furthermore, we prove a strong duality between the above sum power minimization problem and the problem of sum rate maximization under power constraints. We then propose finite step algorithms to explicitly identify an assignment of vectors and powers that solve the above power minimization and sum rate maximization problems. The distinguishing feature of the proposed algorithms is the size of the output vector sets. In particular, we prove an upper bound on the size of the vector sets that is independent of the number of users. Finally, we restrict vectors to an orthonormal set. The goal is to identify an assignment of vectors (from an orthonormal set) to users such that the user rate requirements is met with minimum sum power. This is a combinatorial optimization problem. We study the complexity of the decision version of this problem. Our results indicate that when the dimensionality of the vector set is part of the input, the decision version is NP-complete.

The purpose of this thesis was to explore the potential of near-infrared spectroscopy (NIRS) as an access channel by establishing reliable signal detection to verify the existence of signal differences associated with changes in activity. This thesis focused on using NIRS to measure brain activity from the prefrontal cortex during an auditory Go-No-Go task. A singular spectrum analysis change-point detection algorithm was applied to identify transition points where the NIRS signal properties varied from previous data points in the signal, indicating a change in brain activity. With this algorithm, latency values for change-points detected ranged from 6.44 s to 9.34 s. The averaged positive predictive values over all runs were modest (from 49.41% to 67.73%), with the corresponding negative predictive values being generally higher (48.66% to 78.80%). However, positive and negative predictive values up to 97.22% and 95.14%, respectively, were achieved for individual runs. No hemispheric differences were found.

The purpose of this thesis was to explore the potential of near-infrared spectroscopy (NIRS) as an access channel by establishing reliable signal detection to verify the existence of signal differences associated with changes in activity. This thesis focused on using NIRS to measure brain activity from the prefrontal cortex during an auditory Go-No-Go task. A singular spectrum analysis change-point detection algorithm was applied to identify transition points where the NIRS signal properties varied from previous data points in the signal, indicating a change in brain activity. With this algorithm, latency values for change-points detected ranged from 6.44 s to 9.34 s. The averaged positive predictive values over all runs were modest (from 49.41% to 67.73%), with the corresponding negative predictive values being generally higher (48.66% to 78.80%). However, positive and negative predictive values up to 97.22% and 95.14%, respectively, were achieved for individual runs. No hemispheric differences were found.

abstract: Distributed inference has applications in a wide range of fields such as source localization, target detection, environment monitoring, and healthcare. In this dissertation, distributed inference schemes which use bounded transmit power are considered. The performance of the proposed schemes are studied for a variety of inference problems. In the first part of the dissertation, a distributed detection scheme where the sensors transmit with constant modulus signals over a Gaussian multiple access channel is considered. The deflection coefficient of the proposed scheme is shown to depend on the characteristic function of the sensing noise, and the error exponent for the system is derived using large deviation theory. Optimization of the deflection coefficient and error exponent are considered with respect to a transmission phase parameter for a variety of sensing noise distributions including impulsive ones. The proposed scheme is also favorably compared with existing amplify-and-forward (AF) and detect-and-forward (DF) schemes. The effect of fading is shown to be detrimental to the detection performance and simulations are provided to corroborate the analytical results. The second part of the dissertation studies a distributed inference scheme which uses bounded transmission functions over a Gaussian multiple access channel. The conditions on the transmission functions under which consistent estimation and reliable detection are possible is characterized. For the distributed estimation problem, an estimation scheme that uses bounded transmission functions is proved to be strongly consistent provided that the variance of the noise samples are bounded and that the transmission function is one-to-one. The proposed estimation scheme is compared with the amplify and forward technique and its robustness to impulsive sensing noise distributions is highlighted. It is also shown that bounded transmissions suffer from inconsistent estimates if the sensing noise variance goes to infinity. For the distributed detection problem, similar results are obtained by studying the deflection coefficient. Simulations corroborate our analytical results. In the third part of this dissertation, the problem of estimating the average of samples distributed at the nodes of a sensor network is considered. A distributed average consensus algorithm in which every sensor transmits with bounded peak power is proposed. In the presence of communication noise, it is shown that the nodes reach consensus asymptotically to a finite random variable whose expectation is the desired sample average of the initial observations with a variance that depends on the step size of the algorithm and the variance of the communication noise. The asymptotic performance is characterized by deriving the asymptotic covariance matrix using results from stochastic approximation theory. It is shown that using bounded transmissions results in slower convergence compared to the linear consensus algorithm based on the Laplacian heuristic. Simulations corroborate our analytical findings. Finally, a robust distributed average consensus algorithm in which every sensor performs a nonlinear processing at the receiver is proposed. It is shown that non-linearity at the receiver nodes makes the algorithm robust to a wide range of channel noise distributions including the impulsive ones. It is shown that the nodes reach consensus asymptotically and similar results are obtained as in the case of transmit non-linearity. Simulations corroborate our analytical findings and highlight the robustness of the proposed algorithm. / Dissertation/Thesis / Ph.D. Electrical Engineering 2013

No description available.

No description available.

<h2 id="x-x-x-bp_categories-h"> </h2> / <p>The discrete-time Poisson (DTP) channel models a wide range of optical communication channels. The channel capacity and capacity-achieving distributions are generally unknown. This thesis addresses system design of DTP channels and presents novel contributions to the capacity of DTP channel, properties and closed-form expression of the capacity-achieving distribution under peak and average constraints, signalling design, and sum-capacity-achieving distributions of DTP multiple access channel (MAC) with peak amplitude constraints.</p> <p>Two algorithms are developed to compute the channel capacity of DTP channel as well as the capacity-achieving distribution with average and peak amplitude constraints. Tight lower bounds based on input distributions with simple forms are presented. Non-uniform signalling algorithms to achieve the channel capacity are also demonstrated. Fundamental properties of capacity-achieving distributions for DTP channels are established. Furthermore, necessary and sufficient conditions on the optimality of binary distributions are presented. Analytical expressions for the capacity-achieving distributions of the DTP channel are derived when there is no dark current and when the dark current is large enough. A two-user DTP multiple access channel model is proposed and it is shown that the sum-capacity-achieving distributions under peak amplitude constraints are discrete with a finite number of mass points.</p> / Doctor of Philosophy (PhD)

This dissertation addresses multi-layer optimization aspects of multiple input multiple output (MIMO) and deep learning-based communication systems. The initial focus is on the rate optimization for multi-user MIMO (MU-MIMO) configurations; specifically, multiple access channel (MAC) and interference channel (IC). First, the ergodic sum rates of MIMO MAC and IC configurations are determined by jointly integrating the error and overhead effects due to channel estimation (training) and feedback into the rate optimization. Then, we investigated methods that will increase the achievable rate for parallel Gaussian IC (PGIC) which is a special case of MIMO IC where there is no interference between multiple antenna elements. We derive a generalized iterative waterfilling algorithm for power allocation that maximizes the ergodic achievable rate. We verified the sum rate improvement with our proposed scheme through extensive simulation tests. Next, we introduce a novel physical layer scheme for single user MIMO spatial multiplexing systems based on unsupervised deep learning using an autoencoder. Both transmitter and receiver are designed as feedforward neural networks (FNN) and constellation diagrams are optimized to minimize the symbol error rate (SER) based on the channel characteristics. We first evaluate the SER in the presence of a constant Rayleigh-fading channel as a performance upper bound. Then, we quantize the Gaussian distribution and train the autoencoder with multiple quantized channel matrices. The channel is provided as an input to both the transmitter and the receiver. The performance exceeds that of conventional communication systems both when the autoencoder is trained and tested with single and multiple channels and the performance gain is sustained after accounting for the channel estimation error. Moreover, we evaluate the performance with increasing number of quantization points and when there is a difference between training and test channels. We show that the performance loss is minimal when training is performed with sufficiently large number of quantization points and number of channels. Finally, we develop a distributed and decentralized MU-MIMO link selection and activation protocol that enables MU-MIMO operation in wireless networks. We verified the performance gains with the proposed protocol in terms of average network throughput. / Doctor of Philosophy / Multiple Input Multiple Output (MIMO) wireless systems include multiple antennas both at the transmitter and receiver and they are widely used today in cellular and wireless local area network systems to increase robustness, reliability and data rate. Multi-user MIMO (MU-MIMO) configurations include multiple access channel (MAC) where multiple transmitters communicate simultaneously with a single receiver; interference channel (IC) where multiple transmitters communicate simultaneously with their intended receivers; and broadcast channel (BC) where a single transmitter communicates simultaneously with multiple receivers. Channel state information (CSI) is required at the transmitter to precode the signal and mitigate interference effects. This requires CSI to be estimated at the receiver and transmitted back to the transmitter in a feedback loop. Errors occur during both channel estimation and feedback processes. We initially analyze the achievable rate of MAC and IC configurations when both channel estimation and feedback errors are taken into account in the capacity formulations. We treat the errors associated with channel estimation and feedback as additional noise. Next, we develop methods to maximize the achievable rate for IC by using interference cancellation techniques at the receivers when the interference is very strong. We consider parallel Gaussian IC (PGIC) which is a special case of MIMO IC where there is no interference between multiple antenna elements. We develop a power allocation scheme which maximizes the ergodic achievable rate of the communication systems. We verify the performance improvement with our proposed scheme through simulation tests. Standard optimization techniques are used to determine the fundamental limits of MIMO communications systems. However, there is still a gap between current operational systems and these limits due to complexity of these solutions and limitations in their assumptions. Next, we introduce a novel physical layer scheme for MIMO systems based on machine learning; specifically, unsupervised deep learning using an autoencoder. An autoencoder consists of an encoder and a decoder that compresses and decompresses data, respectively. We designed both the encoder and the decoder as feedforward neural networks (FNNs). In our case, encoder performs transmitter functionalities such as modulation and error correction coding and decoder performs receiver functionalities such as demodulation and decoding as part of the communication system. Channel is included as an additional layer between the encoder and decoder. By incorporating the channel effects in the design process of the autoencoder and jointly optimizing the transmitter and receiver, we demonstrate the performance gains over conventional MIMO communication schemes. Finally, we develop a distributed and decentralized MU-MIMO link selection and activation protocol that enables MU-MIMO operation in wireless networks. We verified the performance gains with the proposed protocol in terms of average network throughput.