| 1. |
|
|
| 2. |
- Agrell, Erik, 1965-, et al.
(författare)
-
On the optimality of the binary reflected Gray code
- 2004
-
Ingår i: IEEE Transactions on Information Theory. - 0018-9448. ; 50:12, s. 3170-3182
-
Tidskriftsartikel (refereegranskat)abstract
- This paper concerns the problem of selecting a binary labeling for the signal constellation in M-PSK, M-PAM, and M-QAM communication systems. Gray labelings are discussed and the original work by Frank Gray is analyzed. As is noted, the number of distinct Gray labelings that result in different bit-error probability grows rapidly with increasing constellation size. By introducing a recursive Gray labeling construction method called expansion, the paper answers the natural question of what labeling, among all possible constellation labelings, will give the lowest possible average probability of bit errors for the considered constellations. Under certain assumptions on the channel, the answer is that the labeling proposed by Gray, the binary reflected Gray code, is the optimal labeling for all three constellations, which has, surprisingly, never been proved before.
|
|
| 3. |
|
|
| 4. |
- Agrell, Erik, 1965-, et al.
(författare)
-
The binary reflected Gray code is optimal for M-PSK
- 2004
-
Ingår i: Proc. IEEE International Symposium on Information Theory, Chicago, Illinois, USA. - 0-7803-8280-3
-
Konferensbidrag (refereegranskat)abstract
- This paper is concerned with the problem of selecting a binary labeling for the signal constellation in an M-PSK communication system. A good starting point is labelings having the Gray property, but this is not altogether enough, since the number of distinct Gray labelings that result in different bit error probability grows rapidly with increasing constellation size. By introducing a recursive Gray labeling construction method called expansion, the paper answers the natural question of what labeling, among all possible constellation labelings (not only Gray), that will give the lowest possible average probability of bit errors. Under certain assumptions on the channel, the answer is that the labeling originally proposed by Gray, the binary reflected Gray code, is the optimal labeling for M-PSK systems, which has, surprisingly, never been proved before.
|
|
| 5. |
- 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.
-
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.
|
|
| 6. |
- Haghighi, Kasra, 1978-, et al.
(författare)
-
On Optimum Causal Cognitive Spectrum Reutilization Strategy
- 2012
-
Ingår i: IEEE Journal on Selected Areas in Communication. - 0733-8716. ; 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.
|
|
| 7. |
|
|
| 8. |
|
|
| 9. |
|
|
| 10. |
|
|
