Search

Non-terrestrial networks (NTNs) complement their terrestrial counterparts in enabling ubiquitous connectivity globally by serving unserved and/or underserved areas of the world. While supporting enhanced mobile broadband (eMBB) data over NTNs has been extensively studied in the past, focus on massive machine type communication (mMTC) over NTNs is currently growing, as also witnessed by the new study and work items included into the 3rd generation partnership project (3GPP) agenda for commissioning specifications for Internet-of-Things (IoT) communications over NTNs. Supporting mMTC in non-terrestrial cellular IoT (C-IoT) networks requires jointly addressing the unique challenges introduced in NTNs and CIoT communications. In this paper, we tackle one such issue caused due to the extended round-trip time and increased path loss in NTNs resulting in a degraded network throughput. We propose smarter transport blocks scheduling methods that can increase the efficiency of resource utilization. We conduct end-to-end link-level simulations of C-IoT traffic over NTNs and present numerical results of the data rate gains achieved to show the performance of our proposed solutions against legacy scheduling methods., Comment: 11 pages, 11 figures. Submitted to an IEEE journal

We introduce a Bayesian carrier phase recovery (CPR) algorithm which is robust against low signal-to-noise ratio scenarios. It is therefore effective for phase recovery for probabilistic amplitude shaping (PAS). Results validate that the new algorithm overcomes the degradation experienced by blind phase-search CPR for PAS., Comment: 4 pages, 2 figures. Submitted to the 49th European Conference on Optical Communications

Probabilistic amplitude shaping (PAS) is a practical means to achieve a shaping gain in optical fiber communication. However, PAS and shaping in general also affect the signal-dependent generation of nonlinear interference. This provides an opportunity for nonlinearity mitigation through PAS, which is also referred to as a nonlinear shaping gain. In this paper, we introduce a linear lowpass filter model that relates transmitted symbol-energy sequences and nonlinear distortion experienced in an optical fiber channel. Based on this model, we conduct a nonlinearity analysis of PAS with respect to shaping blocklength and mapping strategy. Our model explains results and relationships found in literature and can be used as a design tool for PAS with improved nonlinearity tolerance. We use the model to introduce a new metric for PAS with sequence selection. We perform simulations of selection-based PAS with various amplitude shapers and mapping strategies to demonstrate the effectiveness of the new metric in different optical fiber system scenarios., Comment: 16 pages, 17 figues, Submitted to IEEE Journal of Lightwave Technology on August 4, 2022

Smart electrical grids rely on data communication to support their operation and on sensing for diagnostics and maintenance. Usually, the roles of communication and sensing equipment are different, i.e., communication equipment does not participate in sensing tasks and vice versa. Power line communication (PLC) offers a cost-effective solution for joint communication and sensing for smart grids. This is because the high-frequency PLC signals used for data communication also reveal detailed information regarding the health of the power lines that they travel through. Traditional PLC-based power line or cable diagnostic solutions are dependent on prior knowledge of the cable type, network topology, and/or characteristics of the anomalies. In this paper, we develop a power line sensing technique that can detect various types of cable anomalies without any prior domain knowledge. To this end, we design a solution that first uses time-series forecasting to predict the PLC channel state information at any given point in time based on its historical data. Under the approximation that the prediction error follows a Gaussian distribution, we then perform chi-squared statistical test to build an anomaly detector which identifies the occurrence of a cable fault. We demonstrate the effectiveness and universality of our sensing solution via evaluations conducted using both synthetic and real-world data extracted from low- and medium-voltage distribution networks.

Neural networks have enabled applications in artificial intelligence through machine learning, and neuromorphic computing. Software implementations of neural networks on conventional computers that have separate memory and processor (and that operate sequentially) are limited in speed and energy efficiency. Neuromorphic engineering aims to build processors in which hardware mimics neurons and synapses in the brain for distributed and parallel processing. Neuromorphic engineering enabled by photonics (optical physics) can offer sub-nanosecond latencies and high bandwidth with low energies to extend the domain of artificial intelligence and neuromorphic computing applications to machine learning acceleration, nonlinear programming, intelligent signal processing, etc. Photonic neural networks have been demonstrated on integrated platforms and free-space optics depending on the class of applications being targeted. Here, we discuss the prospects and demonstrated applications of these photonic neural networks.

In optical communication systems, short blocklength probabilistic enumerative sphere shaping (ESS) provides both linear shaping gain and nonlinear tolerance. In this work, we investigate the performance and complexity of ESS in comparison with fiber nonlinearity compensation via digital back propagation (DBP) with different steps per span. We evaluate the impact of the shaping blocklength in terms of nonlinear tolerance and also consider the case of ESS with a Volterra-based nonlinear equalizer (VNLE), which provides lower complexity than DBP. In single-channel transmission, ESS with VNLE achieves similar performance in terms of finite length bit-metric decoding rate to uniform signaling with one step per span DBP. In the context of a dense wavelength-division multiplexing (WDM) transmission system, we show that ESS outperforms uniform signaling with DBP for different step sizes.

In optical communication systems, short blocklength probabilistic enumerative sphere shaping (ESS) provides both linear shaping gain and nonlinear tolerance. In this work, we investigate the performance and complexity of ESS in comparison with fiber nonlinearity compensation via digital back propagation (DBP) with different steps per span. We evaluate the impact of the shaping blocklength in terms of nonlinear tolerance and also consider the case of ESS with a Volterra-based nonlinear equalizer (VNLE), which provides lower complexity than DBP. In single-channel transmission, ESS with VNLE achieves similar performance in terms of finite length bit-metric decoding rate to uniform signaling with one step per span DBP. In the context of a dense wavelength-division multiplexing (WDM) transmission system, we show that ESS outperforms uniform signaling with DBP for different step sizes., Comment: 4 pages, 5 figures

The integration of unmanned aerial vehicles (UAVs) into wireless networks has opened a new horizon to meet the capacity and coverage requirements foreseen in future wireless networks. Harnessing UAVs as flying base stations (BSs) has helped to achieve a cost-effective and on-the-go wireless network that may be used in several scenarios such as to support disaster response and in temporary hotspots. Despite the extensive research on the application side of UAVs, the integration of UAVs as BSs into existing wireless networks remains an open challenge. While UAV BSs can help to increase the area spectral efficiency, the added network heterogeneity and BS densification may diminish the capacity gains due to increased handover rates. In this work, we shed some light on this tradeoff by studying a three tier network architecture consisting of macro, small, and UAV BSs and analyze its coverage and rate performance. In particular, we consider joint control/data and split architectures and express the rate performance for stationary and mobile users, using an analytical approach based on stochastic geometry. While both joint and split architectures offer similar performance for stationary users, the numerical results suggest the splitting of control and data plane for mobile users., Comment: Accepted in IEEE Globecom Workshops 2018

Ultra-dense networks (UDNs) envision the massive deployment of heterogenous base stations (BSs) to meet the desired traffic demands. Furthermore, UDNs are expected to support the diverse devices e.g., personal mobile devices and unmanned ariel vehicles. User mobility and the resulting excessive changes in user to BS associations in such highly dense networks may however nullify the capacity gains foreseen through BS densification. Thus there exists a need to quantify the effect of user mobility in UDNs. In this article, we consider a three-dimensional N-tier downlink network and determine the association probabilities and inter/intra tier handover rates using tools from stochastic geometry. In particular, we incorporate user and BSs' antenna heights into the mathematical analysis and study the impact of user height on the association and handover rate. The numerical trends show that the intra-tier handovers are dominant for the tiers with shortest relative elevation w.r.t. the user and this dominance is more prominent when there exists a high discrepancy among the tiers' heights. However, biasing can be employed to balance the handover load among the network tiers., Comment: Submitted to IEEE TVT as a correspondence paper, April, 2018

We investigate the problem of coded caching for nonuniform demands when the structured clique cover algorithm proposed by Maddah-Ali and Niesen for decentralized caching is used for delivery. We apply this algorithm to all user demands regardless of their request probabilities. This allows for coding among the files that have different request probabilities but makes the allocation of memory to different files challenging during the content placement phase. As our main contribution, we analytically characterize the optimal placement strategy that minimizes the expected delivery rate under a storage capacity constraint. It is shown that the optimal placement follows either a two or a three group strategy, where a set of less popular files are not cached at all and the files within each of the other sets are allocated identical amounts of storage as if they had the same request probabilities. We show that for a finite set of storage capacities, that we call the base-cases of the problem, the two group strategy is always optimal. For other storage capacities, optimal placement is achieved by memory sharing between certain base-cases and the resulting placement either follows a two or a three group strategy depending on the corresponding base-cases used. We derive a polynomial time algorithm that determines the base-cases of the problem given the number of caches and popularity distribution of files. Given the base-cases of the problem, the optimal memory allocation parameters for any storage capacity are derived analytically., Comment: Submitted to IEEE Transactions on Information Theory

In an advanced metering infrastructure (AMI), data acquisition points (DAPs) are responsible for collecting traffic from several smart meters and automated devices and transmitting them to the utility control center. Although the problem of optimized data collector placement has already been addressed for wireless broadband and sensor networks, DAP placement is quite a new research area for AMIs. In this paper, we investigate the minimum required number of DAPs and their optimized locations on top of the existing utility poles in a distribution grid such that smart grid quality of service requirements can best be provided. In order to solve the problem for large-scale AMIs, we devise a novel heuristic algorithm using a greedy approach for identifying potential pole locations for DAP placement and the Dijkstra shortest path algorithm for constructing reliable routes. We employ the characteristics of medium access schemes from the IEEE 802.15.4g smart utility network (SUN) standard, and consider mission-critical and non-critical smart grid traffic. The performance and time-complexity of our algorithm are compared with those obtained by the IBM CPLEX software for small scenarios. Finally, we apply our devised DAP placement algorithm to examples of realistic smart grid AMI topologies., Comment: 31 pages, IEEE Transactions

Opportunistic Routing (OR) can be used as an alternative to the legacy routing (LR) protocols in networks with a broadcast lossy channel and possibility of overhearing the signal. The power line medium creates such an environment. OR can better exploit the channel than LR because it allows the cooperation of all nodes that receive any data. With LR, only a chain of nodes is selected for communication. Other nodes drop the received information. We investigate OR for the one-source one-destination scenario with one traffic flow. First, we evaluate the upper bound on the achievable data rate and advocate the decentralized algorithm for its calculation. This knowledge is used in the design of Basic Routing Rules (BRR). They use the link quality metric that equals the upper bound on the achievable data rate between the given node and the destination. We call it the node priority. It considers the possibility of multi-path communication and the packet loss correlation. BRR allows achieving the optimal data rate pertaining certain theoretical assumptions. The Extended BRR (BRR-E) are free of them. The major difference between BRR and BRR-E lies in the usage of Network Coding (NC) for prognosis of the feedback. In this way, the protocol overhead can be severely reduced. We also study Automatic Repeat-reQuest (ARQ) mechanism that is applicable with OR. It differs to ARQ with LR in that each sender has several sinks and none of the sinks except destination require the full recovery of the original message. Using BRR-E, ARQ and other services like network initialization and link state control, we design the Advanced Network Coding based Opportunistic Routing protocol (ANChOR). With the analytic and simulation results we demonstrate the near optimum performance of ANChOR. For the triangular topology, the achievable data rate is just 2% away from the theoretical maximum and it is up to 90% higher than it is possible to achieve with LR. Using the G.hn standard, we also show the f

Opportunistic Routing (OR) can be used as an alternative to the legacy routing (LR) protocols in networks with a broadcast lossy channel and possibility of overhearing the signal. The power line medium creates such an environment. OR can better exploit the channel than LR because it allows the cooperation of all nodes that receive any data. With LR, only a chain of nodes is selected for communication. Other nodes drop the received information. We investigate OR for the one-source one-destination scenario with one traffic flow. First, we evaluate the upper bound on the achievable data rate and advocate the decentralized algorithm for its calculation. This knowledge is used in the design of Basic Routing Rules (BRR). They use the link quality metric that equals the upper bound on the achievable data rate between the given node and the destination. We call it the node priority. It considers the possibility of multi-path communication and the packet loss correlation. BRR allows achieving the optimal data rate pertaining certain theoretical assumptions. The Extended BRR (BRR-E) are free of them. The major difference between BRR and BRR-E lies in the usage of Network Coding (NC) for prognosis of the feedback. In this way, the protocol overhead can be severely reduced. We also study Automatic Repeat-reQuest (ARQ) mechanism that is applicable with OR. It differs to ARQ with LR in that each sender has several sinks and none of the sinks except destination require the full recovery of the original message. Using BRR-E, ARQ and other services like network initialization and link state control, we design the Advanced Network Coding based Opportunistic Routing protocol (ANChOR). With the analytic and simulation results we demonstrate the near optimum performance of ANChOR. For the triangular topology, the achievable data rate is just 2% away from the theoretical maximum and it is up to 90% higher than it is possible to achieve with LR. Using the G.hn standard, we also show the f

Opportunistic Routing (OR) can be used as an alternative to the legacy routing (LR) protocols in networks with a broadcast lossy channel and possibility of overhearing the signal. The power line medium creates such an environment. OR can better exploit the channel than LR because it allows the cooperation of all nodes that receive any data. With LR, only a chain of nodes is selected for communication. Other nodes drop the received information. We investigate OR for the one-source one-destination scenario with one traffic flow. First, we evaluate the upper bound on the achievable data rate and advocate the decentralized algorithm for its calculation. This knowledge is used in the design of Basic Routing Rules (BRR). They use the link quality metric that equals the upper bound on the achievable data rate between the given node and the destination. We call it the node priority. It considers the possibility of multi-path communication and the packet loss correlation. BRR allows achieving the optimal data rate pertaining certain theoretical assumptions. The Extended BRR (BRR-E) are free of them. The major difference between BRR and BRR-E lies in the usage of Network Coding (NC) for prognosis of the feedback. In this way, the protocol overhead can be severely reduced. We also study Automatic Repeat-reQuest (ARQ) mechanism that is applicable with OR. It differs to ARQ with LR in that each sender has several sinks and none of the sinks except destination require the full recovery of the original message. Using BRR-E, ARQ and other services like network initialization and link state control, we design the Advanced Network Coding based Opportunistic Routing protocol (ANChOR). With the analytic and simulation results we demonstrate the near optimum performance of ANChOR. For the triangular topology, the achievable data rate is just 2% away from the theoretical maximum and it is up to 90% higher than it is possible to achieve with LR. Using the G.hn standard, we also show the f

Opportunistic Routing (OR) can be used as an alternative to the legacy routing (LR) protocols in networks with a broadcast lossy channel and possibility of overhearing the signal. The power line medium creates such an environment. OR can better exploit the channel than LR because it allows the cooperation of all nodes that receive any data. With LR, only a chain of nodes is selected for communication. Other nodes drop the received information. We investigate OR for the one-source one-destination scenario with one traffic flow. First, we evaluate the upper bound on the achievable data rate and advocate the decentralized algorithm for its calculation. This knowledge is used in the design of Basic Routing Rules (BRR). They use the link quality metric that equals the upper bound on the achievable data rate between the given node and the destination. We call it the node priority. It considers the possibility of multi-path communication and the packet loss correlation. BRR allows achieving the optimal data rate pertaining certain theoretical assumptions. The Extended BRR (BRR-E) are free of them. The major difference between BRR and BRR-E lies in the usage of Network Coding (NC) for prognosis of the feedback. In this way, the protocol overhead can be severely reduced. We also study Automatic Repeat-reQuest (ARQ) mechanism that is applicable with OR. It differs to ARQ with LR in that each sender has several sinks and none of the sinks except destination require the full recovery of the original message. Using BRR-E, ARQ and other services like network initialization and link state control, we design the Advanced Network Coding based Opportunistic Routing protocol (ANChOR). With the analytic and simulation results we demonstrate the near optimum performance of ANChOR. For the triangular topology, the achievable data rate is just 2% away from the theoretical maximum and it is up to 90% higher than it is possible to achieve with LR. Using the G.hn standard, we also show the f

Opportunistic Routing (OR) can be used as an alternative to the legacy routing (LR) protocols in networks with a broadcast lossy channel and possibility of overhearing the signal. The power line medium creates such an environment. OR can better exploit the channel than LR because it allows the cooperation of all nodes that receive any data. With LR, only a chain of nodes is selected for communication. Other nodes drop the received information. We investigate OR for the one-source one-destination scenario with one traffic flow. First, we evaluate the upper bound on the achievable data rate and advocate the decentralized algorithm for its calculation. This knowledge is used in the design of Basic Routing Rules (BRR). They use the link quality metric that equals the upper bound on the achievable data rate between the given node and the destination. We call it the node priority. It considers the possibility of multi-path communication and the packet loss correlation. BRR allows achieving the optimal data rate pertaining certain theoretical assumptions. The Extended BRR (BRR-E) are free of them. The major difference between BRR and BRR-E lies in the usage of Network Coding (NC) for prognosis of the feedback. In this way, the protocol overhead can be severely reduced. We also study Automatic Repeat-reQuest (ARQ) mechanism that is applicable with OR. It differs to ARQ with LR in that each sender has several sinks and none of the sinks except destination require the full recovery of the original message. Using BRR-E, ARQ and other services like network initialization and link state control, we design the Advanced Network Coding based Opportunistic Routing protocol (ANChOR). With the analytic and simulation results we demonstrate the near optimum performance of ANChOR. For the triangular topology, the achievable data rate is just 2% away from the theoretical maximum and it is up to 90% higher than it is possible to achieve with LR. Using the G.hn standard, we also show the f

We consider a full-duplex (FD) multiple-input multiple-output (MIMO) interference-channel, where multiple pairs of FD nodes coexist in the same network, and hence each node not only suffers from self-interference due to operating in FD mode, but also from co-channel-interference (CCI) from other pairs due to simultaneous transmission at each link. Transmission power expenditure is a significant source for power consumption in communication systems. One way to extend battery life is to utilize power-efficient resource allocation that minimizes the transmit power consumption. Therefore, in this paper we propose a penalty-based algorithm to address the Quality-of-Service (QoS) issue of this FD system where the total transmit power is minimized subject to minimum rate constraints at each node. The algorithm exploits both spatial and temporal freedoms of the source covariance matrices of MIMO links between the nodes to achieve a lower total system power. © 2017 VDE VERLAG GMBH.

Coded caching is an effective technique to reduce the redundant traffic in wireless networks. The existing coded caching schemes require the splitting of files into a possibly large number of subfiles, i.e., they perform coded subfile caching. Keeping the files intact during the caching process would actually be appealing, broadly speaking because of its simpler implementation. However, little is known about the effectiveness of this coded file caching in reducing the data delivery rate. In this paper, we propose such a file caching scheme which uses a decentralized algorithm for content placement and either an online clique cover or matching algorithm for the delivery of missing data. We derive approximations for the expected delivery rate of both schemes using the differential equations method, and show them to be tight through concentration analysis and computer simulations. Our numerical results demonstrate that the proposed coded file caching is significantly more effective than uncoded caching in reducing the delivery rate. We furthermore show the additional improvement in the performance of the proposed scheme when its application is extended to subfile caching with a small number of subfiles., Comment: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=8614426&isnumber=4656680

The problem of content delivery in caching networks is investigated for scenarios where multiple users request identical files. Redundant user demands are likely when the file popularity distribution is highly non-uniform or the user demands are positively correlated. An adaptive method is proposed for the delivery of redundant demands in caching networks. Based on the redundancy pattern in the current demand vector, the proposed method decides between the transmission of uncoded messages or the coded messages of [1] for delivery. Moreover, a lower bound on the delivery rate of redundant requests is derived based on a cutset bound argument. The performance of the adaptive method is investigated through numerical examples of the delivery rate of several specific demand vectors as well as the average delivery rate of a caching network with correlated requests. The adaptive method is shown to considerably reduce the gap between the non-adaptive delivery rate and the lower bound. In some specific cases, using the adaptive method, this gap shrinks by almost 50% for the average rate., Comment: 8 pages,8 figures. Submitted to IEEE transaction on Communications in 2015. A short version of this article was published as an IEEE Communications Letter with DOI: 10.1109/LCOMM.2016.2558144

In this paper we address the linear precoding and decoding design problem for a bidirectional orthogonal frequencydivision multiplexing (OFDM) communication system, between two multiple-input multiple-output (MIMO) full-duplex (FD) nodes. The effects of hardware distortion as well as the channel state information error are taken into account. In the first step, we transform the available time-domain characterization of the hardware distortions for FD MIMO transceivers to the frequency domain, via a linear Fourier transformation. As a result, the explicit impact of hardware inaccuracies on the residual selfinterference (RSI) and inter-carrier leakage (ICL) is formulated in relation to the intended transmit/received signals. Afterwards, linear precoding and decoding designs are proposed to enhance the system performance following the minimum-mean-squarederror (MMSE) and sum rate maximization strategies, assuming the availability of perfect or erroneous CSI. The proposed designs are based on the application of alternating optimization over the system parameters, leading to a necessary convergence. Numerical results indicate that the application of a distortionaware design is essential for a system with a high hardware distortion, or for a system with a low thermal noise variance., Comment: Submitted to IEEE for publication

This paper studies the performance of the scaled largest eigenvalue (SLE) detector used for the detection of stationary time-series. We focus on a single-antenna setup and a blind detection scenario (neither the signal covariance, nor the noise variance are known). The SLE detector has received much attention in the context of cognitive radios (CR) due to its simplicity, good performance and robustness to noise level uncertainties. Specifically, our goal is to analyze the detector based on the statistic Γ = λ1∑i=1 p λi, where λ1 ≥ λ2 ≥ ⋯ ≥ λp represent the ordered eigenvalues of the sample covariance matrix. We derive a large-sample-size closed-form approximation for the test statistic which allows us to derive its statistical distribution and set up the detector to achieve the required probability of false-alarm (Pfa) and probability of detection (Pd). We also study the robustness of the detector in the presence of noise uncertainty and impulsive-noise and investigate the benefits of the spatial sign filter for such scenarios., SCOPUS: ar.j, info:eu-repo/semantics/published

In recent decades, power line communication (PLC) has attracted considerable attention from the research community and industry, as well as from regulatory and standardization bodies. In this paper, we provide an overview of both narrowband and broadband systems, covering potential applications, regulatory and standardization efforts, and recent research advancements in channel characterization, physical layer performance, medium access, and higher layer specifications and evaluations. We also identify the areas of current and further study that will enable the continued success of PLC technology.

In recent decades, power line communication (PLC) has attracted considerable attention from the research community and industry, as well as from regulatory and standardization bodies. In this paper, we provide an overview of both narrowband and broadband systems, covering potential applications, regulatory and standardization efforts, and recent research advancements in channel characterization, physical layer performance, medium access, and higher layer specifications and evaluations. We also identify the areas of current and further study that will enable the continued success of PLC technology.

In recent decades, power line communication has attracted considerable attention from the research community and industry, as well as from regulatory and standardization bodies. In this article we provide an overview of both narrowband and broadband systems, covering potential applications, regulatory and standardization efforts and recent research advancements in channel characterization, physical layer performance, medium access and higher layer specifications and evaluations. We also identify areas of current and further study that will enable the continued success of power line communication technology., Comment: 19 pages, 12 figures. Accepted for publication, IEEE Journal on Selected Areas in Communications. Special Issue on Power Line Communications and its Integration with the Networking Ecosystem. 2016

Many different types of promising spectrum sensing algorithms for Cognitive Radio (CR) have already been developed. However, many of these algorithms lack robustness with respect to signal statistical parameters uncertainties, such as the noise variance or the shape of its distribution (often assumed to be simply Gaussian). In conjunction with the low Signal-to-Noise Ratio (SNR) requirements, this lack of robustness can often render interesting sensing algorithms impractical for real-life applications. In this thesis, we primarily focus on the impact of heavy-tail noise distributions on different CR detectors and the use of signal limiters (mostly the spatial sign function) to improve their robustness to such noise distributions. Introducing a non-linear transformation of the received signal prior to its processing by the detector fundamentally changes the signal distribution which in turn modifies the distribution of the detector statistic. In order to parametrize the detector and study its performance, it is then necessary to know the shape of the modified distribution.Three types of detectors are investigated: a generic second-order cyclic-feature detectors, a Scaled-Largest Eigenvalue (SLE) detector studied in the context of stationary time-series and a new Sequential Likelihood Ratio Test (SLRT) detector. The analysis conducted for each detector revolves around the influence of its parameters, the distribution of the detector statistic and several comparisons with similar detectors for various detection scenarios. Our results indicate that at the cost of a moderate performance loss in a Gaussian noise environment, all the detectors fitted with a signal limiter become robust to impulsive noise and noise parameters uncertainties. We provide analytical approximations for the detectors statistical distribution that allow us to use the detectors in such configurations as well as to study their performance for different signal limiters and noise distributions., Doctorat en Sciences de l'ingénieur et technologie, info:eu-repo/semantics/nonPublished

This paper presents a sequential likelihood ratio test (SLRT) detector for spectrum sensing scenarios in cognitive radios (CRs). Similar to other CR detectors, we exploit the structure of the sample covariance matrix of the received signal to achieve detection with minimal information regarding the signal. Unlike the majority of covariance-based CR detectors, the SLRT is a sequential detector that allows for smaller detection delays, which is a prized asset in CR systems. Using methods borrowed from the theory of continuous-time diffusion processes, we derive the statistical properties of the SLRT detector and compare it with an eigenvalue-based sequential detector which has been presented in previous work for CR systems. The comparison also includes detection scenarios with non- Gaussian noise to illustrate the robustness of the proposed detector in these situations., SCOPUS: ar.j, SCOPUS: ar.j, info:eu-repo/semantics/published

A wideband spectrum sensing method for cognitive radios is presented which is based on compressed measurements. The proposed detector does not require signal reconstruction from the compressed measurements. A fusion centre collects the measurements from different sensing nodes and then makes a sensing decision based on a simplified maximum likelihood criterion which does not require prior signal information. This results in an efficient and low complexity spectrum detector especially for dynamic spectrum occupancy scenarios. The performance of the proposed detector is exhibited by means of numerical simulations for probability of erroneous detection and receiver operating characteristic curves., info:eu-repo/semantics/published

The emergence of cognitive radios and their opportunistic use of the radio spectrum calls for efficient spectrum sensing algorithms, able to reliably detect signals in very low Signal-to-Noise Ratio (SNR) environments with unknown or changing statistical distributions. Cyclic-feature detectors, which make use of the cyclostationary signature of communication signals, are a promising lead to meet these requirements. This paper presents a new nonparametric cyclic-feature detector based on the Spatial Sign Cyclic Polyspectrum (SSCP) that detects single-carrier signals for the aforementioned scenarios. In addition to being nonparametric the new detector is also robust with respect to narrowband interferers., info:eu-repo/semantics/published

This paper studies the impact of the spatial sign function on the cyclic features of communication signals and thereby on the performance of cyclic-feature detectors. It extends the existing results obtained for Gaussian signals and provides new insights into the interactions between the cyclic features of a cyclostationary signal sent through a spatial sign filter, which lead to the modified cyclic features at the output. We apply these results to analytically derive the performance of the spatial sign cyclic correlation (SSCC) detector, which filters a received signal by the spatial sign function prior to its processing using a cyclic-feature detector. These results are extended to variations of the spatial sign function and we further motivate their application to general zero-memory non-linear (ZMNL) functions., info:eu-repo/semantics/published

The emergence of cognitive radios and their opportunistic use of the radio spectrum calls for efficient spectrum sensing algorithms, able to reliably detect signals in very low Signal-to-Noise Ratio (SNR) environments with unknown or changing statistical distributions. Cyclic-feature detectors, which make use of the cyclostationary signature of communication signals, are a promising lead to meet these requirements. This paper presents a new nonparametric cyclic-feature detector based on the Spatial Sign Cyclic Polyspectrum (SSCP) that detects single-carrier signals for the aforementioned scenarios. In addition to being nonparametric the new detector is also robust with respect to narrowband interferers., info:eu-repo/semantics/published

This paper studies the impact of the spatial sign function on the cyclic features of communication signals and thereby on the performance of cyclic-feature detectors. It extends the existing results obtained for Gaussian signals and provides new insights into the interactions between the cyclic features of a cyclostationary signal sent through a spatial sign filter, which lead to the modified cyclic features at the output. We apply these results to analytically derive the performance of the spatial sign cyclic correlation (SSCC) detector, which filters a received signal by the spatial sign function prior to its processing using a cyclic-feature detector. These results are extended to variations of the spatial sign function and we further motivate their application to general zero-memory non-linear (ZMNL) functions., info:eu-repo/semantics/published

Cognitive radios are a new technology introduced to resolve the spectrum scarcity problemby superimposing new services in the already allocated bands under a non-interference constraint.It has been recently demonstrated that the challenging implementation of the signal detectors canbe facilitated by using the theory of compressive sampling. In this paper, we consider a distributednetwork of secondary nodes that cooperate to detect the primary signals. Each secondary nodesamples the signal periodically at a rate much smaller than the Nyquist rate. The delays inherentto the propagation channel are used to implement a periodic non-uniform sampling detector whenthe secondary nodes combine their observations. We demonstrate that the proposed detector canefficiently detect the primary user signal, even under fading channels., info:eu-repo/semantics/published

In this paper we present an alternative separable implementation of L2-orthogonal space-time codes (STC) for continuous phase modulation (CPM). In this approach, we split the STC CPM transmitter into a single conventional CPM modulator and a correction filter bank. While the CPM modulator is common to all transmit antennas, the correction filter bank applies different correction units to each antenna. Thereby desirable code properties as orthogonality and full diversity are achievable with just a slightly larger bandwidth demand. This new representation has three main advantages. First, it allows to easily generalize the orthogonality condition to any arbitrary number of transmit antennas. Second, for a quite general set of correction functions that we detail, it can be proved that full diversity is achieved. Third, by separating the modulation and correction steps inside the receiver, a simpler receiver can be designed as a bank of data independent inverse correction filters followed by a single CPM demodulator. Therefore, in this implementation, only one correlation filter bank for the detection of all transmitted signals is necessary. The decoding effort grows only linearly with the number of transmit antennas.

Several recent standards such as IEEE 802.11a/g, IEEE 802.16, and ECMA Multiband Orthogonal Frequency Division Multiplexing (MB-OFDM) for high data-rate Ultra-Wideband (UWB), employ bit-interleaved convolutionally-coded multicarrier modulation over quasi-static fading channels. Motivated by the lack of appropriate error rate analysis techniques for this popular type of system and channel model, we present two novel analytical methods for bit error rate (BER) estimation of coded multicarrier systems operating over frequency-selective quasi-static channels with non-ideal interleaving. In the first method, the approximate performance of the system is calculated for each realization of the channel, which is suitable for obtaining the outage BER performance (a common performance measure for e.g. MB-OFDM systems). The second method assumes Rayleigh distributed frequency-domain subcarrier channel gains and knowledge of their correlation matrix, and can be used to directly obtain the average BER performance. Both methods are applicable to convolutionally-coded interleaved multicarrier systems employing Quadrature Amplitude Modulation (QAM), and are also able to account for narrowband interference (modeled as a sum of tone interferers). To illustrate the application of the proposed analysis, both methods are used to study the performance of a tone-interference-impaired MB-OFDM system., Comment: 31 pages, 9 figures, 1 table. Submitted to the IEEE Transactions on Communications (June 20, 2006)