| 1. |
- Haghighi, Kasra, 1978, et al.
(författare)
-
An LLR-based Cognitive Transmission Strategy for Higher Spectrum Reutilization
- 2011
-
Ingår i: IEEE GLOBECOM 2011 - Cognitive Radio and Networks Symposium. - 9781424492688
-
Konferensbidrag (refereegranskat)abstract
- Reutilization of the spectrum licensed to services with low occupancy is of great interest for cognitive radios (CRs). To achieve this goal, we introduce a simple hidden Markov model which captures the primary users activity, signal uncertainties, and noise. For evaluating the performance of any CR, two new criteria are presented entitled spectrum utilization ratio (UR) and interference ratio (IR). Based on this model and new measures, a new a-posterior log-likelihood-ratio based CR is designed and implemented. Its performance is compared with standard energy-detection based spectrum-sensing CR. We demonstrate more than 300% increase in UR for up to 1% allowed interference at the SNR of -5dB.
|
|
| 2. |
- Haghighi, Kasra, 1978, et al.
(författare)
-
On Optimum Causal Cognitive Spectrum Reutilization Strategy
- 2012
-
Ingår i: IEEE Journal on Selected Areas in Communications. - 0733-8716 .- 1558-0008. ; 30:10, s. 1911-1921
-
Tidskriftsartikel (refereegranskat)abstract
- In this paper we study opportunistic transmission strategies for cognitive radios (CR) in which causal noisy observation from a primary user(s) (PU) state is available. PU is assumed to be operating in a slotted manner, according to a two-state Markov model. The objective is to maximize utilization ratio (UR), i.e., relative number of the PU-idle slots that are used by CR, subject to interference ratio (IR), i.e., relative number of the PU-active slots that are used by CR, below a certain level. We introduce an a-posteriori LLR-based cognitive transmission strategy and show that this strategy is optimum in the sense of maximizing UR given a certain maximum allowed IR. Two methods for calculating threshold for this strategy in practical situations are presented. One of them performs well in higher SNRs but might have too large IR at low SNRs and low PU activity levels, and the other is proven to never violate the allowed IR at the price of a reduced UR. In addition, an upper-bound for the UR of any CR strategy operating in the presence of Markovian PU is presented. Simulation results have shown a more than 116% improvement in UR at SNR of -3dB and IR level of 10% with PU state estimation. Thus, this opportunistic CR mechanism possesses a high potential in practical scenarios in which there exists no information about true states of PU.
|
|
| 3. |
- Haghighi, Kasra, 1978, et al.
(författare)
-
Sensing or Transmission: Causal Cognitive Radio Strategies with Censorship
- 2014
-
Ingår i: IEEE Transactions on Wireless Communications. - 1558-2248 .- 1536-1276. ; 13:6, s. 3031-3041
-
Tidskriftsartikel (refereegranskat)abstract
- This paper introduces a novel opportunistic transmission strategy for cognitive radios (CRs). The primary user (PU) is assumed to transmit in a time-slotted manner according to a two-state Markov model, and the CR is either sensing, that is, obtaining a causal, noisy observation of a primary user (PU) state, or transmitting, but not both at the same time. In other words, the CR observations of the PU are censored whenever the CR is transmitting. The objective of the CR transmission strategy is to maximize the utilization ratio (UR), i.e., the relative number of the PU-idle slots that are used by the CR, subject to that the interference ratio (IR), i.e., the relative number of the PU-active slots that are used by the CR, is below a certain level. We introduce an a-posteriori LLR-based CR transmission strategy, called CLAPP, and evaluate this strategy in terms of the achievable UR for different PU model parameters and received signal-to-noise ratios (SNRs). The performance of CLAPP is compared with a simple censored energy detection scheme. Simulation results show that CLAPP has 52% gain in UR over the best censored energy detection scheme for a maximum IR level of 10% and an SNR of -2dB. © 2002-2012 IEEE.
|
|
| 4. |
- Agrell, Erik, 1965, et al.
(författare)
-
Achieving the Shannon Limit with Probabilistically Shaped BICM
- 2012
-
Ingår i: IEEE International Symposium on Information Theory - Proceedings. - 2157-8095. - 9781467325806 ; , s. 2421-2425
-
Konferensbidrag (refereegranskat)abstract
- Probabilistic shaping for bit-interleaved coded modulation (BICM) systems at low signal-to-noise ratio (SNR) is investigated. Using known results for BICM systems with a uniform input distribution, the combinations of input alphabet, input distribution, and binary labeling that achieve the Shannon limit -1.59 dB are fully characterized. It is found that a BICM system achieves the Shannon limit at low SNR if and only if it can be represented as a zero-mean linear projection of a hypercube, which is the same condition as for uniform input distributions. Hence, probabilistic shaping offers no extra degrees of freedom to optimize the low-SNR mutual information of BICM systems, in addition to what is provided by geometrical shaping.
|
|
| 5. |
- Agrell, Erik, 1965, et al.
(författare)
-
Capacity of a nonlinear optical channel with finite memory
- 2014
-
Ingår i: Journal of Lightwave Technology. - 0733-8724 .- 1558-2213. ; 32:16, s. 2862-2876
-
Tidskriftsartikel (refereegranskat)abstract
- The channel capacity of a nonlinear, dispersive fiber-optic link is revisited. To this end, the popular Gaussian noise (GN) model is extended with a parameter to account for the finite memory of realistic fiber channels. This finite-memory model is harder to analyze mathematically but, in contrast to previous models, it is valid also for nonstationary or heavy-tailed input signals. For uncoded transmission and standard modulation formats, the new model gives the same results as the regular GN model when the memory of the channel is about ten symbols or more. These results confirm previous results that the GN model is accurate for uncoded transmission. However, when coding is considered, the results obtained using the finite-memory model are very different from those obtained by previous models, even when the channel memory is large. In particular, the peaky behavior of the channel capacity, which has been reported for numerous nonlinear channel models, appears to be an artifact of applying models derived for independent input in a coded (i.e., dependent) scenario. © 1983-2012 IEEE.
|
|
| 6. |
|
|
| 7. |
|
|
| 8. |
- Agrell, Erik, 1965, et al.
(författare)
-
First-order asymptotics of the BICM mutual information: Uniform vs. nonuniform distributions
- 2012
-
Ingår i: Information Theory and Applications Workshop (ITA) 2012, San Diego, CA [Invited]. - 9781467314732 ; , s. 306 - 310
-
Konferensbidrag (refereegranskat)abstract
- A linear, invertible transform is defined between two vectors or matrices as a tool for analyzing the bit-interleaved coded modulation (BICM) mutual information in the wideband regime. The transform coefficients depend on a set of real values, which can be interpreted as probabilities. The transform relates any BICM system with a nonuniform input distribution to another BICM system with a uniform distribution. Numerical evidence suggests that the two systems have the same first-order behavior, which would make possible to analyze nonuniform BICM systems based on known properties of uniform BICM systems.
|
|
| 9. |
- Agrell, Erik, 1965
(författare)
-
Nonlinear fiber capacity
- 2013
-
Ingår i: 39th European Conference and Exhibition on Optical Communication, ECOC 2013; London; United Kingdom; 22 September 2013 through 26 September 2013. - : Institution of Engineering and Technology. - 9781849197595 ; :622 CP, s. 630-632
-
Konferensbidrag (refereegranskat)abstract
- In this semi-tutorial presentation, we review fundamental information theory for links with and without memory, in the linear and nonlinear regimes. A comparison between channel models with long (but finite) memory and infinite memory yields an unexpected result.
|
|
| 10. |
- Agrell, Erik, 1965, et al.
(författare)
-
On the symbol error probability of regular polytopes
- 2011
-
Ingår i: IEEE Transactions on Information Theory. - 0018-9448 .- 1557-9654. ; 57:6, s. 3411-3415
-
Tidskriftsartikel (refereegranskat)abstract
- An exact expression is derived for the symbol error probability when the vertices of the four-dimensional 24-cell are used for digital transmission in Gaussian noise. Corresponding expressions for other regular convex polytopes are summarized. Numerically stable versions of these error probabilities are also obtained. © 2011 IEEE.
|
|
