Showing papers on "Fading published in 2008"
Book•
30 Nov 2008TL;DR: The goal of this paper is to present in a comprehensive fashion the theory underlying bit-interleaved coded modulation, to provide tools for evaluating its performance, and to give guidelines for its design.
Abstract: Zehavi (1992) showed that the performance of coded modulation over a Rayleigh fading channel can be improved by bit-wise interleaving the encoder output and by using an appropriate soft-decision metric as an input to a Viterbi decoder. The goal of this paper is to present in a comprehensive fashion the theory underlying bit-interleaved coded modulation, to provide tools for evaluating its performance, and to give guidelines for its design.
2,098 citations
TL;DR: This paper considers the problem of secret communication between two nodes, over a fading wireless medium, in the presence of a passive eavesdropper, and assumes that the transmitter and its helpers (amplifying relays) have more antennas than the eavesdroppers.
Abstract: The broadcast nature of the wireless medium makes the communication over this medium vulnerable to eavesdropping. This paper considers the problem of secret communication between two nodes, over a fading wireless medium, in the presence of a passive eavesdropper. The assumption used is that the transmitter and its helpers (amplifying relays) have more antennas than the eavesdropper. The transmitter ensures secrecy of communication by utilizing some of the available power to produce 'artificial noise', such that only the eavesdropper's channel is degraded. Two scenarios are considered, one where the transmitter has multiple transmit antennas, and the other where amplifying relays simulate the effect of multiple antennas. The channel state information (CSI) is assumed to be publicly known, and hence, the secrecy of communication is independent of the secrecy of CSI.
1,846 citations
TL;DR: A practical secure communication protocol is developed, which uses a four-step procedure to ensure wireless information-theoretic security and is shown that the protocol is effective in secure key renewal-even in the presence of imperfect channel state information.
Abstract: This paper considers the transmission of confidential data over wireless channels. Based on an information-theoretic formulation of the problem, in which two legitimates partners communicate over a quasi-static fading channel and an eavesdropper observes their transmissions through a second independent quasi-static fading channel, the important role of fading is characterized in terms of average secure communication rates and outage probability. Based on the insights from this analysis, a practical secure communication protocol is developed, which uses a four-step procedure to ensure wireless information-theoretic security: (i) common randomness via opportunistic transmission, (ii) message reconciliation, (iii) common key generation via privacy amplification, and (iv) message protection with a secret key. A reconciliation procedure based on multilevel coding and optimized low-density parity-check (LDPC) codes is introduced, which allows to achieve communication rates close to the fundamental security limits in several relevant instances. Finally, a set of metrics for assessing average secure key generation rates is established, and it is shown that the protocol is effective in secure key renewal-even in the presence of imperfect channel state information.
1,759 citations
TL;DR: It is argued that the tension between primary and secondary users is captured by the technical question of computing the optimal tradeoff between the primary user's capacity and the secondary user's sensing robustness as quantified by the SNR wall.
Abstract: This paper considers the detection of the presence/absence of signals in uncertain low SNR environments. Small modeling uncertainties are unavoidable in any practical system and so robustness to them is a fundamental performance metric. The impact of these modeling uncertainties can be quantified by the position of the "SNR wall" below which a detector will fail to be robust, no matter how long it can observe the channel. We propose simple mathematical models for the uncertainty in the noise and fading processes. These are used to show what aspects of the model lead to SNR walls for differing levels of knowledge of the signal to be detected. These results have implications for wireless spectrum regulators. The context is opportunistically sharing spectrum with primary users that must be detected in order to avoid causing harmful interference on a channel. Ideally, a secondary system would be able to detect primaries robustly without having to know much about their signaling strategies. We argue that the tension between primary and secondary users is captured by the technical question of computing the optimal tradeoff between the primary user's capacity and the secondary user's sensing robustness as quantified by the SNR wall. This is an open problem, but we compute this tradeoff for some simple detectors.
1,505 citations
TL;DR: The positive impact of fading on the secrecy capacity is revealed and the critical role of rate adaptation, based on the main channel CSI, in facilitating secure communications over slow fading channels is established.
Abstract: We consider the secure transmission of information over an ergodic fading channel in the presence of an eavesdropper. Our eavesdropper can be viewed as the wireless counterpart of Wyner's wiretapper. The secrecy capacity of such a system is characterized under the assumption of asymptotically long coherence intervals. We first consider the full channel state information (CSI) case, where the transmitter has access to the channel gains of the legitimate receiver and the eavesdropper. The secrecy capacity under this full CSI assumption serves as an upper bound for the secrecy capacity when only the CSI of the legitimate receiver is known at the transmitter, which is characterized next. In each scenario, the perfect secrecy capacity is obtained along with the optimal power and rate allocation strategies. We then propose a low-complexity on/off power allocation strategy that achieves near-optimal performance with only the main channel CSI. More specifically, this scheme is shown to be asymptotically optimal as the average signal-to-noise ratio (SNR) goes to infinity, and interestingly, is shown to attain the secrecy capacity under the full CSI assumption. Overall, channel fading has a positive impact on the secrecy capacity and rate adaptation, based on the main channel CSI, is critical in facilitating secure communications over slow fading channels.
1,227 citations
TL;DR: This paper proposes an optimal linear cooperation framework for spectrum sensing in order to accurately detect the weak primary signal and proposes a heuristic approach, where a modified deflection coefficient that characterizes the probability distribution function of the global test statistics at the fusion center is proposed.
Abstract: Cognitive radio technology has been proposed to improve spectrum efficiency by having the cognitive radios act as secondary users to opportunistically access under-utilized frequency bands. Spectrum sensing, as a key enabling functionality in cognitive radio networks, needs to reliably detect signals from licensed primary radios to avoid harmful interference. However, due to the effects of channel fading/shadowing, individual cognitive radios may not be able to reliably detect the existence of a primary radio. In this paper, we propose an optimal linear cooperation framework for spectrum sensing in order to accurately detect the weak primary signal. Within this framework, spectrum sensing is based on the linear combination of local statistics from individual cognitive radios. Our objective is to minimize the interference to the primary radio while meeting the requirement of opportunistic spectrum utilization. We formulate the sensing problem as a nonlinear optimization problem. By exploiting the inherent structures in the problem formulation, we develop efficient algorithms to solve for the optimal solutions. To further reduce the computational complexity and obtain solutions for more general cases, we finally propose a heuristic approach, where we instead optimize a modified deflection coefficient that characterizes the probability distribution function of the global test statistics at the fusion center. Simulation results illustrate significant cooperative gain achieved by the proposed strategies. The insights obtained in this paper are useful for the design of optimal spectrum sensing in cognitive radio networks.
1,074 citations
TL;DR: In this article, the secrecy capacity region of the fading broadcast channel with confidential messages (BCC) was investigated, where a source node has common information for two receivers (receivers 1 and 2), and has confidential information intended only for receiver 1.
Abstract: The fading broadcast channel with confidential messages (BCC) is investigated, where a source node has common information for two receivers (receivers 1 and 2), and has confidential information intended only for receiver 1. The confidential information needs to be kept as secret as possible from receiver 2. The broadcast channel from the source node to receivers 1 and 2 is corrupted by multiplicative fading gain coefficients in addition to additive Gaussian noise terms. The channel state information (CSI) is assumed to be known at both the transmitter and the receivers. The parallel BCC with independent subchannels is first studied, which serves as an information-theoretic model for the fading BCC. The secrecy capacity region of the parallel BCC is established, which gives the secrecy capacity region of the parallel BCC with degraded subchannels. The secrecy capacity region is then established for the parallel Gaussian BCC, and the optimal source power allocations that achieve the boundary of the secrecy capacity region are derived. In particular, the secrecy capacity region is established for the basic Gaussian BCC. The secrecy capacity results are then applied to study the fading BCC. The ergodic performance is first studied. The ergodic secrecy capacity region and the optimal power allocations that achieve the boundary of this region are derived. The outage performance is then studied, where a long-term power constraint is assumed. The power allocation is derived that minimizes the outage probability where either the target rate of the common message or the target rate of the confidential message is not achieved. The power allocation is also derived that minimizes the outage probability where the target rate of the confidential message is not achieved subject to the constraint that the target rate of the common message must be achieved for all channel states.
942 citations
TL;DR: It is shown in this paper that an SNR wall reduction can be achieved by employing cooperation among independent cognitive radio users and a new softened hard combination scheme with two-bit overhead for each user is proposed to achieve a good tradeoff between detection performance and complexity.
Abstract: In this letter, we consider cooperative spectrum sensing based on energy detection in cognitive radio networks. Soft combination of the observed energies from different cognitive radio users is investigated. Based on the Neyman-Pearson criterion, we obtain an optimal soft combination scheme that maximizes the detection probability for a given false alarm probability. Encouraged by the performance gain of soft combination, we further propose a new softened hard combination scheme with two-bit overhead for each user and achieve a good tradeoff between detection performance and complexity.
911 citations
06 Jul 2008
TL;DR: This paper compute the perfect secrecy capacity of the multiple antenna MIMO broadcast channel, where the number of antennas is arbitrary for both the transmitter and the two receivers.
Abstract: We consider the MIMO wiretap channel, that is a MIMO broadcast channel where the transmitter sends some confidential information to one user which is a legitimate receiver, while the other user is an eavesdropper. Perfect secrecy is achieved when the transmitter and the legitimate receiver can communicate at some positive rate, while insuring that the eavesdropper gets zero bits of information. In this paper, we compute the perfect secrecy capacity of the multiple antenna MIMO broadcast channel, where the number of antennas is arbitrary for both the transmitter and the two receivers. Our technique involves a careful study of a Sato-like upper bound via the solution of a certain algebraic Riccati equation.
595 citations
TL;DR: This article's goal is to provide an in-depth understanding of the principles of FSMC modeling of fading channels with its applications in wireless communication systems, and to introduce both FSMC models and flat-fading channels.
Abstract: This article's goal is to provide an in-depth understanding of the principles of FSMC modeling of fading channels with its applications in wireless communication systems. While the emphasis is on frequency nonselective or flat-fading channels, this understanding will be useful for future generalizations of FSMC models for frequency-selective fading channels. The target audience of this article include both theory- and practice-oriented researchers who would like to design accurate channel models for evaluating the performance of wireless communication systems in the physical or media access control layers, or those who would like to develop more efficient and reliable transceivers that take advantage of the inherent memory in fading channels. Both FSMC models and flat-fading channels will be formally introduced. FSMC models are particulary suitable to represent and estimate the relatively fast flat-fading channel gain in each subcarrier.
458 citations
TL;DR: This work considers a cooperative wireless network where a set of nodes cooperate to relay in parallel the information from a source to a destination using a decode-and-forward approach, and describes the structure of the optimal transmission scheme.
Abstract: We consider a cooperative wireless network where a set of nodes cooperate to relay in parallel the information from a source to a destination using a decode-and-forward approach. The source broadcasts the data to the relays, some or all of which cooperatively beamform to forward the data to the destination. We generalize the standard approaches for cooperative communications in two key respects: (i) we explicitly model and factor in the cost of acquiring channel state information (CSI), and (ii) we consider more general selection rules for the relays and compute the optimal one among them. In particular, we consider simple relay selection and outage criteria that exploit the inherent diversity of relay networks and satisfy a mandated outage constraint. These criteria include as special cases several relay selection criteria proposed in the literature. We obtain expressions for the total energy consumption for general relay selection and outage criteria for the non-homogeneous case, in which different relay links have different mean channel power gains, and the homogeneous case, in which the relay links statistics are identical. We characterize the structure of the optimal transmission scheme. Numerical results show that the cost of training and feedback of CSI is significant. The optimal strategy is to use a varying subset (and number) of relay nodes to cooperatively beamform at any given time. Depending on the relative location of the relays, the source, and the destination, numerical computations show energy savings of about 16% when an optimal relay selection rule is used. We also study the impact of shadowing correlation on the energy consumption for a cooperative relay network.
TL;DR: In this paper, the outage probability and transmission capacity of ad hoc wireless networks with nodes employing multiple antenna diversity techniques, for a general class of signal distributions, were derived for fading or non-fading environments.
Abstract: This paper derives the outage probability and transmission capacity of ad hoc wireless networks with nodes employing multiple antenna diversity techniques, for a general class of signal distributions. This analysis allows system performance to be quantified for fading or non-fading environments. The transmission capacity is given for interference-limited uniformly random networks on the entire plane with path loss exponent alpha > 2 in which nodes use: (1) static beamforming through M sectorized antennas, for which the increase in transmission capacity is shown to be thetas(M2) if the antennas are without sidelobes, but less in the event of a nonzero sidelobe level; (2) dynamic eigenbeamforming (maximal ratio transmission/combining), in which the increase is shown to be thetas(M 2/alpha ); (3) various transmit antenna selection and receive antenna selection combining schemes, which give appreciable but rapidly diminishing gains; and (4) orthogonal space-time block coding, for which there is only a small gain due to channel hardening, equivalent to Nakagami-m fading for increasing m. It is concluded that in ad hoc networks, static and dynamic beamforming perform best, selection combining performs well but with rapidly diminishing returns with added antennas, and that space-time block coding offers only marginal gains.
TL;DR: The myopic sensing policy has a simple robust structure that reduces channel selection to a round-robin procedure and obviates the need for knowing the channel transition probabilities, which characterizes the maximum throughput of a multi-channel opportunistic communication system and its scaling behavior with respect to the number of channels.
Abstract: We consider a multi-channel opportunistic communication system where the states of these channels evolve as independent and statistically identical Markov chains (the Gilbert- Elliot channel model). A user chooses one channel to sense and access in each slot and collects a reward determined by the state of the chosen channel. The problem is to design a sensing policy for channel selection to maximize the average reward, which can be formulated as a multi-arm restless bandit process. In this paper, we study the structure, optimality, and performance of the myopic sensing policy. We show that the myopic sensing policy has a simple robust structure that reduces channel selection to a round-robin procedure and obviates the need for knowing the channel transition probabilities. The optimality of this simple policy is established for the two-channel case and conjectured for the general case based on numerical results. The performance of the myopic sensing policy is analyzed, which, based on the optimality of myopic sensing, characterizes the maximum throughput of a multi-channel opportunistic communication system and its scaling behavior with respect to the number of channels. These results apply to cognitive radio networks, opportunistic transmission in fading environments, downlink scheduling in centralized networks, and resource-constrained jamming and anti-jamming.
08 Dec 2008
TL;DR: Analytical and simulation results show performance gains over popular multiple antenna APM systems (including Bell Laboratories layered space time (BLAST) and maximum ratio combining (MRC) schemes), making GSSK an excellent candidate for future wireless applications.
Abstract: A fundamental component of spatial modulation (SM), termed generalized space shift keying (GSSK), is presented. GSSK modulation inherently exploits fading in wireless communication to provide better performance over conventional amplitude/phase modulation (APM) techniques. In GSSK, only the antenna indices, and not the symbols themselves (as in the case of SM and APM), relay information. We exploit GSSKpsilas degrees of freedom to achieve better performance, which is done by formulating its constellation in an optimal manner. To support our results, we also derive upper bounds on GSSKpsilas bit error probability, where the source of GSSKpsilas strength is made clear. Analytical and simulation results show performance gains (1.5-3 dB) over popular multiple antenna APM systems (including Bell Laboratories layered space time (BLAST) and maximum ratio combining (MRC) schemes), making GSSK an excellent candidate for future wireless applications.
TL;DR: A relay diversity based cooperative spectrum sensing approach to increase the diversity of detection when some CRs are in heavy shadowing and it is shown that, when combined with algebraic coding, relay diversity can further improve the cooperative Spectrum Sensing performance.
Abstract: In the letter the problem of cooperative spectrum sensing is investigated in cognitive radio (CR) networks over Rayleigh fading channels. By taking into account the error effect on the decision reporting, a general performance analysis of cooperative spectrum sensing is given. The analytical detection results show that the performance of cooperative spectrum sensing is limited by the probability of reporting errors. To deal with this limitation, we propose a transmit diversity based cooperative spectrum sensing method. By regarding multiple CRs as a virtual antenna array, space-time coding and space-frequency coding are applied into CR networks over flat-fading and frequency-selective fading channels, respectively. Moreover, we propose a relay diversity based cooperative spectrum sensing approach to increase the diversity of detection when some CRs are in heavy shadowing. It is then shown that, when combined with algebraic coding, relay diversity can further improve the cooperative spectrum sensing performance.
TL;DR: The average bit-error rate in closed form of a FSO system operating in this channel environment, assuming intensity modulation/direct detection with on-off keying, is evaluated.
Abstract: In this letter, we investigate the error rate performance of free-space optical (FSO) links over strong turbulence fading channels together with misalignment (pointing error) effects. First, we present a novel closed-form expression for the distribution of a stochastic FSO channel model which takes into account both atmospheric turbulence-induced fading and misalignment-induced fading. Then, we evaluate the average bit-error rate in closed form of a FSO system operating in this channel environment, assuming intensity modulation/direct detection with on-off keying. Numerical examples are further provided to collaborate on the derived analytical expressions.
TL;DR: Close-form expressions for the outage and bit error probability of uncoded, threshold-based opportunistic relaying and selection cooperation at arbitrary signal to noise ratios and number of available relays, assuming decode-and-forward relays and Rayleigh fading channels are provided.
Abstract: We provide closed-form expressions for the outage and bit error probability (BEP) of uncoded, threshold-based opportunistic relaying (OR) and selection cooperation (SC), at arbitrary signal to noise ratios (SNRs) and number of available relays, assuming decode-and-forward relays and Rayleigh fading channels. Numerical results demonstrate that SC performs slightly better in terms of outage probability; in terms of BEP, both systems may outperform one another, depending on the SNR threshold that determines the set of relays that participate in the forwarding process.
TL;DR: It is shown that, using a suitable binning strategy, a common message can be reliably and securely transmitted at a rate independent of the number of receivers, and that a simple opportunistic transmission strategy is optimal for the reliable and secure transmission of independent messages in the limit of large number of receiver.
Abstract: We study a problem of broadcasting confidential messages to multiple receivers under an information-theoretic secrecy constraint. Two scenarios are considered: 1) all receivers are to obtain a common message; and 2) each receiver is to obtain an independent message. Moreover, two models are considered: parallel channels and fast-fading channels. For the case of reversely degraded parallel channels, one eavesdropper, and an arbitrary number of legitimate receivers, we determine the secrecy capacity for transmitting a common message, and the secrecy sum-capacity for transmitting independent messages. For the case of fast-fading channels, we assume that the channel state information of the legitimate receivers is known to all the terminals, while that of the eavesdropper is known only to itself. We show that, using a suitable binning strategy, a common message can be reliably and securely transmitted at a rate independent of the number of receivers. We also show that a simple opportunistic transmission strategy is optimal for the reliable and secure transmission of independent messages in the limit of large number of receivers.
TL;DR: The industrial environment is categorized into different topographies and large-scale fading is well expressed by a one-slope path-loss model and excellent agreement with a lognormal distribution is obtained.
Abstract: In this paper, large-scale fading and temporal fading characteristics of the industrial radio channel at 900, 2400, and 5200 MHz are determined. In contrast to measurements performed in houses and in office buildings, few attempts have been made until now to model propagation in industrial environments. In this paper, the industrial environment is categorized into different topographies. Industrial topographies are defined separately for large-scale and temporal fading, and their definition is based upon the specific physical characteristics of the local surroundings affecting both types of fading. Large-scale fading is well expressed by a one-slope path-loss model and excellent agreement with a lognormal distribution is obtained. Temporal fading is found to be Ricean and Ricean K-factors have been determined. Ricean K-factors are found to follow a lognormal distribution.
TL;DR: A throughput analysis of the IEEE 802.11 protocol at the data link layer in non-saturated traffic conditions taking into account the impact of both transmission channel and capture effects in Rayleigh fading environment is provided.
Abstract: In this paper, we provide a saturation throughput analysis of the IEEE 802.11 protocol at the data link layer by including the impact of both transmission channel and capture effects in Rayleigh fading environment. Impacts of both non-ideal channel and capture effects, specially in an environment of high interference, become important in terms of the actual observed throughput. As far as the 4-way handshaking mechanism is concerned, we extend the multi-dimensional Markovian state transition model characterizing the behavior at the MAC layer by including transmission states that account for packet transmission failures due to errors caused by propagation through the channel. This way, any channel model characterizing the physical transmission medium can be accommodated, including AWGN and fading channels. We also extend the Markov model in order to consider the behavior of the contention window when employing the basic 2-way handshaking mechanism. Under the usual assumptions regarding the traffic generated per node and independence of packet collisions, we solve for the stationary probabilities of the Markov chain and develop expressions for the saturation throughput as a function of the number of terminals, packet sizes, raw channel error rates, capture probability, and other key system parameters. The theoretical derivations are then compared to simulation results confirming the effectiveness of the proposed models.
TL;DR: A complete framework to perform joint admission control and rate/power allocation for secondary users such that both QoS and interference constraints are only violated within desired limits is developed.
Abstract: We investigate the dynamic spectrum sharing problem among primary and secondary users in a cognitive radio network. We consider the scenario where primary users exhibit on-off behavior and secondary users are able to dynamically measure/estimate sum interference from primary users at their receiving ends. For such a scenario, we solve the problem of fair spectrum sharing among secondary users subject to their QoS constraints (in terms of minimum SINR and transmission rate) and interference constraints for primary users. Since tracking channel gains instantaneously for dynamic spectrum allocation may be very difficult in practice, we consider the case where only mean channel gains averaged over short-term fading are available. Under such scenarios, we derive outage probabilities for secondary users and interference constraint violation probabilities for primary users. Based on the analysis, we develop a complete framework to perform joint admission control and rate/power allocation for secondary users such that both QoS and interference constraints are only violated within desired limits. Throughput performance of primary and secondary networks is investigated via extensive numerical analysis considering different levels of implementation complexity due to channel estimation.
TL;DR: A silent positioning scheme termed UPS for underwater acoustic sensor networks, which requires no time synchronization and provides location privacy at underwater vehicles/sensors whose locations need to be determined, is presented.
Abstract: In this paper, we present a silent positioning scheme termed UPS for underwater acoustic sensor networks. UPS relies on the time difference of arrivals locally measured at a sensor to detect range differences from the sensor to four anchor nodes. These range differences are averaged over multiple beacon intervals before they are combined to estimate the 3-D sensor location through trilateration. UPS requires no time synchronization and provides location privacy at underwater vehicles/sensors whose locations need to be determined. To study the performance of UPS, we model the underwater acoustic channel as a modified ultrawideband Saleh-Valenzuela model: The arrival of each path cluster and the paths within each cluster follow double Poisson distributions, and the multipath channel gain follows a Rician distribution. Based on this channel model, we perform both theoretical analysis and simulation study on the position error of UPS under acoustic fading channels. The obtained results indicate that UPS is an effective scheme for underwater vehicle/sensor self-positioning.
Abstract: Nowadays, automatic modulation classification (AMC) plays an important role in both cooperative and non-cooperative communication applications. Very often, multipath fading channels result in the severe AMC performance degradation or induce large classification errors. The negative impacts of multipath fading channels on AMC have been discussed in the existing literature but no solution has ever been proposed so far to the best of our knowledge. In this paper, we propose a new robust AMC algorithm, which applies higher-order statistics (HOS) in a generic framework for blind channel estimation and pattern recognition. We also derive the Cramer-Rao lower bound for the fourth-order cumulant estimator when the AMC candidates are BPSK and QPSK over the additive white Gaussian noise channel, and it is a nearly minimum-variance estimator leading to robust AMC features in a wide variety of signal-to-noise ratios. The advantage of our new algorithm is that, by carefully designing the essential features needed for AMC, we do not really have to acquire the complete channel information and therefore it can be feasible without any a priori information in practice. The Monte Carlo simulation results show that our new AMC algorithm can achieve the much better classification accuracy than the existing AMC techniques.
Book•
01 Jan 2008
TL;DR: In this article, the authors present a comprehensive overview of short-range wireless positioning methods and their theory of operation, advantages and disadvantages, applicability in different domains, implementation procedures, and accuracy.
Abstract: At last--here's a comprehensive book that puts full details on all short-range wireless-positioning methods at your command for instant access and use. This one-stop resource surveys each technique's theory of operation, advantages and disadvantages, applicability in different domains, implementation procedures, and accuracy to help you select the right technology for any application and ensure the best results possible. Real-life examples together with 161 diagrams help bring all options into sharp focus. After introducing wireless positioning fundamentals along with various personal, commercial, and industrial applications, the book guides you step by step through radio signal time of flight methods, the signal strength method, the angle of arrival system, and the geometric use of distance measurement to determine location. It discusses location awareness applications and implementations using cellular networks. You are brought up to speed on fast-developing techniques involving local area networks (WLANs), personal area networks (WPANs), and radio frequency ID (RFID). Moreover, you find coverage of the distance measurement features in the new IEEE 802.15.4a spec for low rate wireless personal area networks. This practical resource offers detailed guidance on how to implement important technologies, including direct sequence spread spectrum, frequency hopping spread spectrum, and ultrawideband (UWB). The book also explores ways to counteract accuracy impairments caused by noise, multipath and fading, and limitations of antenna directivity and time measurement precision.
TL;DR: A statistical model of interference aggregation in spectrum-sensing cognitive radio networks is developed and distribution of the aggregate interference is characterized in terms of parameters such as sensitivity, transmitted power, and density of the cognitive radios as well as the underlying propagation environment.
Abstract: The increasing demand for the radio spectrum along with the inefficient usage of the licensed bands has led the regulatory bodies to consider opening up the under-utilized licensed frequency bands for dynamic access by unlicensed users. Such dynamic spectrum access is envisioned to resolve the spectrum scarcity by allowing unlicensed users to opportunistically utilize the white spaces across the licensed spectrum on a non-interfering basis. Cognitive radio networks offer a promising realization of this novel paradigm, thanks to their ability to autonomously identify the white spaces through spectrum sensing. Implementation of such networks, however, requires a model translating the regulatory constraint on the aggregate interference to the system-and device-level design parameters. In this paper a statistical model of interference aggregation in spectrum-sensing cognitive radio networks is developed. In particular, distribution of the aggregate interference is characterized in terms of parameters such as sensitivity, transmitted power, and density of the cognitive radios as well as the underlying propagation environment. The model is further extended to account for the effect of cooperative spectrum sensing on the distribution of the aggregate interference.
TL;DR: A low-complexity detector which achieves uncoded near-exponential diversity performance for hundreds of antennas with an average per-bit complexity of just O(NtNr), where Nt and Nr denote the number of transmit and receive antennas, respectively is presented.
Abstract: We consider large MIMO systems, where by 'large' we mean number of transmit and receive antennas of the order of tens to hundreds. Such large MIMO systems will be of immense interest because of the very high spectral efficiencies possible in such systems. We present a low-complexity detector which achieves uncoded near-exponential diversity performance for hundreds of antennas (i.e., achieves near SISO AWGN performance in a large MIMO fading environment) with an average per-bit complexity of just O(NtNr), where Nt and Nr denote the number of transmit and receive antennas, respectively. With an outer turbo code, the proposed detector achieves good coded bit error performance as well. For example, in a 600 transmit and 600 receive antennas V-BLAST system with a high spectral efficiency of 450 bps/Hz (using BPSK and rate-3/4 turbo code), our simulation results show that the proposed detector performs to within about 7 dB from capacity. This practical feasibility of the proposed high-performance, low-complexity detector could potentially trigger wide interest in the theory and implementation of large MIMO systems. We also illustrate the applicability of the proposed detector in the low-complexity detection of high-rate, non-orthogonal space-time block codes and large multicarrier CDMA (MC-CDMA) systems. In large MC-CDMA systems with hundreds of users, the proposed detector is shown to achieve near single-user performance at an average per-bit complexity linear in number of users, which is quite appealing for its use in practical CDMA systems.
TL;DR: It is numerically show that the singularity problem can be eased by linear precoding techniques aided with multiuser selection, and the tradeoff between the performance improvement and the requirement for BS cooperation, signal processing complexity, and channel state information at the transmitter is shown.
Abstract: We study the potential benefits of base-station (BS) cooperation for downlink transmission in multicell networks. Based on a modified Wyner-type model with users clustered at the cell-edges, we analyze the dirty-paper-coding (DPC) precoder and several linear precoding schemes, including cophasing, zero-forcing (ZF), and MMSE precoders. For the nonfading scenario with random phases, we obtain analytical performance expressions for each scheme. In particular, we characterize the high signal-to-noise ratio (SNR) performance gap between the DPC and ZF precoders in large networks, which indicates a singularity problem in certain network settings. Moreover, we demonstrate that the MMSE precoder does not completely resolve the singularity problem. However, by incorporating path gain fading, we numerically show that the singularity problem can be eased by linear precoding techniques aided with multiuser selection. By extending our network model to include cell-interior users, we determine the capacity regions of the two classes of users for various cooperative strategies. In addition to an outer bound and a baseline scheme, we also consider several locally cooperative transmission approaches. The resulting capacity regions show the tradeoff between the performance improvement and the requirement for BS cooperation, signal processing complexity, and channel state information at the transmitter (CSIT).
Posted Content•
TL;DR: In this article, the authors considered spectrum sharing for wireless communication between a CR link and a primary radio link and showed that randomized interference powers over the fading states in the AIP case are more advantageous over deterministic ones in the PIP case for minimizing the resultant PR capacity losses.
Abstract: This paper considers spectrum sharing for wireless communication between a cognitive radio (CR) link and a primary radio (PR) link. It is assumed that the CR protects the PR transmission by applying the so-called interference-temperature constraint, whereby the CR is allowed to transmit regardless of the PR's on/off status provided that the resultant interference power level at the PR receiver is kept below some predefined threshold. For the fading PR and CR channels, the interference-power constraint at the PR receiver is usually one of the following two types: One is to regulate the average interference power (AIP) over all the fading states, while the other is to limit the peak interference power (PIP) at each fading state. From the CR's perspective, given the same average and peak power threshold, the AIP constraint is more favorable than the PIP counterpart because of its more flexibility for dynamically allocating transmit powers over the fading states. On the contrary, from the perspective of protecting the PR, the more restrictive PIP constraint appears at a first glance to be a better option than the AIP. Some surprisingly, this paper shows that in terms of various forms of capacity limits achievable for the PR fading channel, e.g., the ergodic and outage capacities, the AIP constraint is also superior over the PIP. This result is based upon an interesting interference diversity phenomenon, i.e., randomized interference powers over the fading states in the AIP case are more advantageous over deterministic ones in the PIP case for minimizing the resultant PR capacity losses. Therefore, the AIP constraint results in larger fading channel capacities than the PIP for both the CR and PR transmissions.
TL;DR: Constant envelope OFDM (CE-OFDM) transforms the OFDM signal, by way of phase modulation, to a signal designed for efficient power amplification, and is shown to compare favorably to conventional OFDM.
Abstract: This paper describes a transformation technique aimed at solving the peak-to-average power ratio (PAPR) problem associated with OFDM (orthogonal frequency-division multiplexing). Constant envelope OFDM (CE-OFDM) transforms the OFDM signal, by way of phase modulation, to a signal designed for efficient power amplification. At the receiver, the inverse transformation - phase demodulation - is applied prior to the conventional OFDM demodulator. The performance of CE-OFDM is analyzed in additive white Gaussian noise (AWGN) and fading channels. CE-OFDM is shown to achieve good performance in dense multipath with the use of cyclic prefix transmission in conjunction with a frequency- domain equalizer (FDE). By way of computer simulation and hardware realization, CE-OFDM is shown to compare favorably to conventional OFDM.
TL;DR: This paper considers a cognitive radio system in fading wireless channels and proposes an opportunistic power control strategy for the cognitive users, which serves as an alternative way to protect the primary user's transmission and to realize spectrum sharing between thePrimary user and the Cognitive users.
Abstract: In this paper, we consider a cognitive radio system in fading wireless channels and propose an opportunistic power control strategy for the cognitive users, which serves as an alternative way to protect the primary user's transmission and to realize spectrum sharing between the primary user and the cognitive users. The key feature of the proposed strategy is that, via opportunistically adapting its transmit power, the cognitive user can maximize its achievable transmission rate without degrading the outage probability of the primary user. If compared with the existing cognitive protocols, which usually try to keep the instantaneous rate of the primary user unchanged, our strategy relieves the cognitive users from the burden of detecting and relaying the message of the primary user and relaxes the system synchronization requirements. The achievable rate of a cognitive user under the proposed power control strategy is analyzed and simulated, taking into account the impact of imperfect channel estimation. A modified power control strategy is also proposed to reduce the sensitivity of our strategy to the estimation errors. Its effectiveness is verified by the simulations.