| 11. |
|
|
| 12. |
|
|
| 13. |
- Lassing, Johan, 1973, et al.
(författare)
-
Unequal Bit-Error Protection in Coherent M-ary PSK
- 2003
-
Ingår i: Proceedings IEEE Vehicular Technology Conference Fall, Orlando, Florida, USA. ; 1, s. 251-256
-
Konferensbidrag (refereegranskat)abstract
- This paper addresses the problem of evaluating the bit-error probability of the individual bits of a symbol in a communication system using coherent M-ary phase shift keying. Exact expressions are provided, and these are evaluated for seven different mappings from bits to symbols, including five Gray mappings, for a 32-PSK system. It is shown that the highly varying error performance obtained with a common binary reflected Gray mapping can be restored by using a balanced Gray mapping.
|
|
| 14. |
- Xu, Yuxin, et al.
(författare)
-
Cross-layer static resource provisioning for dynamic traffic in flexible grid optical networks
- 2021
-
Ingår i: Journal of Optical Communications and Networking. - 1943-0620 .- 1943-0639. ; 13:3, s. 1-13
-
Tidskriftsartikel (refereegranskat)abstract
- Flexible grid networks need rigorous resource planning to avoid network over-dimensioning and resource over-provisioning. The network must provision the hardware and spectrum resources statically, even for dynamic random bandwidth demands, due to the infrastructure of flexible grid networks, hardware limitations, and reconfiguration speed of the control plane. We propose a flexible online–offline probabilistic (FOOP) algorithm for the static spectrum assignment of random bandwidth demands. The FOOP algorithm considers the probabilistic nature of random bandwidth demands and balances hardware and control plane pressures with spectrum assignment efficiency. The FOOP algorithm uses the probabilistic spectrum Gaussian noise (PSGN) model to estimate the physical-layer impairment (PLI) for random bandwidth traffic. Compared to a benchmark spectrum assignment algorithm and a widely applied PLI estimation model, the proposed FOOP algorithm using the PSGN model saves up to 49% of network resources.
|
|
| 15. |
- Xu, Yuxin, et al.
(författare)
-
Probabilistic spectrum Gaussian noise estimate for random bandwidth traffic
- 2019
-
Ingår i: IET Conference Publications. - : Institution of Engineering and Technology.
-
Konferensbidrag (refereegranskat)abstract
- A probabilistic spectrum Gaussian noise (PSGN) model is proposed to predict the nonlinear noise for random bandwidth traffic in long-haul elastic optical networks. The model reduces the noise estimate 9.1% on average compared to the standard Gaussian noise model applied to the maximum bandwidth.
|
|
| 16. |
- Xu, Yuxin, et al.
(författare)
-
Static resource allocation for dynamic traffic
- 2019
-
Ingår i: IET Conference Publications. - : Institution of Engineering and Technology. - 9781839530074
-
Konferensbidrag (refereegranskat)abstract
- A flexible offline probabilistic (FOP) algorithm is designed to aggressively accommodate random bandwidth traffic demands in long-haul networks. Compared to algorithms that configure demands according to their maximum bandwidth, the FOP algorithm can save 15% of the spectrum used, accommodating over 99% of the throughput demand.
|
|
| 17. |
- Yan, Li, 1988, et al.
(författare)
-
Regenerator Allocation in Nonlinear Elastic Optical Networks With Random Data Rates
- 2018
-
Ingår i: 2018 Optical Fiber Communications Conference and Exposition, OFC 2018 - Proceedings. - 9781943580385
-
Konferensbidrag (refereegranskat)abstract
- We optimize the regenerator allocation in nonlinear elastic networks whose traffic demands have random data rates. Compared with previous regenerator allocation algorithms, our method achieves the same blocking probability with 11% fewer regenerator sites.
|
|
| 18. |
|
|
| 19. |
- Agrell, Erik, 1965, et al.
(författare)
-
A table of upper bounds for binary codes
- 2001
-
Ingår i: IEEE Transactions on Information Theory. - : Institute of Electrical and Electronics Engineers (IEEE). - 0018-9448 .- 1557-9654. ; 47:7, s. 3004-3006
-
Tidskriftsartikel (refereegranskat)abstract
- Let A(n, d) denote the maximum possible number of codewords in an (n, d) binary code. We establish four new bounds on A(n, d), namely, A(21, 4)⩽43689, A(22, 4)⩽87378, A(22, 6)⩽6941, and A(23, 4)⩽173491. Furthermore, using previous upper bounds on the size of constant-weight binary codes, we reapply known methods to generate a table of bounds on A(n, d) for all n⩽28. This table extends the range of parameters compared with previously known tables.
|
|
| 20. |
- 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.
|
|
