Search results for "Computer Science::Information Theory"
showing 10 items of 272 documents
Modeling and statistical characterization of wideband indoor radio propagation channels
2010
In this paper, we focus on the modeling of wideband single-input single-output (SISO) mobile fading channels for indoor propagation environments. The derived indoor reference channel model is based on a geometrical scattering model, which consists of an infinite number of scatterers uniformly distributed over the two-dimensional (2D) horizontal plane of a rectangular room. We derive analytical expressions for the probability density function (PDF) of the angle of arrival (AOA), the power delay profile (PDP), and the frequency correlation function (FCF). An efficient sum-of-cisoids (SOC) channel simulator will be derived from the proposed non-realizable reference model. It is shown that the …
Dynamic Channel Aggregation Strategies in Cognitive Radio Networks with Spectrum Adaptation
2011
In cognitive radio networks, channel aggregation techniques which combine several channels together as one channel have been proposed in many MAC protocols. In this paper, spectrum adaptation is proposed in channel aggregation and two strategies which dynamically adjust channel occupancy of ongoing traffic flows are further developed. The performance of these strategies is evaluated using continuous time Markov chain models. Moreover, models in the quasi-stationary regime are analyzed and the closed-form capacity expression is derived in this regime. Numerical results demonstrate that the capacity of the secondary network can be improved by using channel aggregation with spectrum adaptation.
Parameter optimization for amplify-and-forward relaying systems with pilot symbol assisted modulation scheme
2009
Article published in the journal:Wireless Sensor Network Also available from publisher: http://dx.doi.org/10.4236/wsn.2009.11003 Cooperative diversity is a promising technology for future wireless networks. In this paper, we consider a cooperative communication system operating in an amplify-and-forward (AF) mode with a pilot symbol assisted modulation (PSAM) scheme. It is assumed that a linear minimum mean square estimator (LMMSE) is used for the channel estimation at the receiver. A simple and easy-to-evaluate asymptotical upper bound (AUB) of the symbol-error-rate (SER) is derived for uncoded AF cooperative communication systems with quadrature amplitude modulation (QAM) constellations. …
A continuous-space analytical approach for relay node placement in hybrid cellular and ad hoc networks
2009
A hybrid network is composed of a cellular component and an ad hoc component connected by a relay node, for the purpose of coverage extension and/or capacity improvement. In this paper, we analyze the capacity of such a hybrid network by employing a continuous-space analytical methodology based on circular geometry for uniformly distributed nodes. To achieve maximal overall capacity, the relay node needs to be placed in an optimum location between the base station and the mobile station located at the boundary of the hybrid network. Numerical results show that for obtaining the optimum overall capacity for the hybrid network, the placement of the relay node should be in a range which is nei…
Non-Markovianity-assisted optimal continuous variable quantum teleportation
2018
We study the continuous-variable (CV) quantum teleportation protocol in the case that one of the two modes of the shared entangled resource is sent to the receiver through a Gaussian Quantum Brownian Motion noisy channel. We show that if the channel is engineered in a non-Markovian regime, the information backflow from the environment induces an extra dependance of the phase of the two-mode squeezing of the shared Gaussian entangled resource on the transit time along the channel of the shared mode sent to the receiver. Optimizing over the non-Markovianity dependent phase of the squeezing yields a significant enhancement of the teleportation fidelity. For short enough channel transit times, …
Search for Higgs bosons produced via vector-boson fusion and decaying into bottom quark pairs in s=13 TeV pp collisions with the ATLAS detector
2018
A search for the b (b) over bar decay of the Standard Model Higgs boson produced through vector-boson fusion is presented. Three mutually exclusive channels are considered: two all-hadronic channel ...
Unitary Space–Time Constellation Design Based on the Chernoff Bound of the Pairwise Error Probability
2008
Unitary space-time constellation design is considered for noncoherent multiple-antenna communications, where neither the transmitter nor the receiver knows the fading coefficients of the channel. By employing the Clarke's subdifferential theorem of the sum of the kappa largest singular values of a unitary matrix, we present a numerical optimization procedure for finding unitary space-time signal constellations of any dimension. The Chernoff bound of the pairwise error probability is used directly as a design criterion. The constellations are found by performing gradient descent search on a family ldquosurrogaterdquo functions that converge to the maximum pairwise error probability. The comp…
Development of a MATLAB Toolbox for Mobile Radio Channel Simulators
2011
Masteroppgave i informasjons- og kommunikasjonsteknologi IKT590 2011 – Universitetet i Agder, Grimstad A profound knowledge of mobile radio channels is required for the development, evaluation, and also assessment at practical conditions of present and future mobile radio communication systems. The modelling, analysis, and simulation of mobile radio channels are important sub area since the initiation of mobile communications. In addition to that knowledge of channel behaviour in mobile radio communication is extensively recommended for the study of transmitter/receiver performances. Our intention in this master's thesis is to develop various kinds of mobile fading channel simulators using …
Time multiplexing super-resolved imaging without a priori knowledge of the spatial distribution of the encoding structured illumination
2021
Time multiplexing is a super-resolution technique that sacrifices time to overcome the resolution reduction obtained because of diffraction. There are many super resolution methods based on time multiplexing, but all of them require a priori knowledge of the time changing encoding mask, which is projected on the object and used to encode and decode the high-resolution information. In this paper, we present a time multiplexing technique that does not require the a priori knowledge on the projected encoding mask. First, the theoretical concept of the technique is demonstrated; then, numerical simulations and experimental results are presented.
NP-completeness of the hamming salesman problem
1985
It is shown that the traveling salesman problem, where cities are bit strings with Hamming distances, is NP-complete.