“…Multiple algorithms have been proposed to realize sphere shaping by indexing the bounded-energy amplitude sequences [22], [26], [31], [32], [42]. In this work, we use the enumerative approach introduced in [31], and named enumerative sphere shaping (ESS) in [33]- [35].…”
Section: Enumerative Sphere Shapingmentioning
confidence: 99%
“…4. Example 6 (ESS Indexing): Consider the sequence a = (5, 3, 1, 3), which is represented by a path passing through energy levels e = (0, 25,34,35,44) in stages n = 0, 1, 2, 3, 4, respectively. This path is shown with dashed lines in Fig.…”
Section: Enumerative Sphere Shapingmentioning
confidence: 99%
“…Sphere shaping can be implemented using different ways such as: ESS, which has been introduced in [31], shell mapping, and the approach in [32]. Recently, after the proposal of probabilistic amplitude shaping (PAS) scheme [19], ESS has been reconsidered for wireless communications as the amplitude shaper in PAS structure [34], [35]. ESS considers amplitude sequences satisfying a maximum-energy, i.e., sphere, constraint and aims to close the shaping gap by improving the energy-efficiency rather that directly aiming to obtain the capacity-achieving distribution as CCDM.…”
Probabilistic shaping based on constant composition distribution matching (CCDM) has received considerable attention as a way to increase the capacity of fiber optical communication systems. CCDM suffers from significant rate loss at short blocklengths and requires long blocklengths to achieve high shaping gain, which makes its implementation very challenging. In this paper, we propose to use enumerative sphere shaping (ESS) and investigate its performance for the nonlinear fiber optical channel. ESS has lower rate loss than CCDM at the same shaping rate, which makes it a suitable candidate to be implemented in real-time high-speed optical systems. In this paper, we first show that finite blocklength ESS and CCDM exhibit higher effective signal-to-noise ratio than their infinite blocklength counterparts. These results show that for the nonlinear fiber optical channel, large blocklengths should be avoided. We then show that for a 400 Gb/s dual-polarization 64-QAM WDM transmission system, ESS with short blocklengths outperforms both uniform signaling and CCDM. Gains in terms of both bit-metric decoding rate and bit-error rate are presented. ESS with a blocklength of 200 is shown to provide an extension reach of about 200 km in comparison with CCDM with the same blocklength. The obtained reach increase of ESS with a blocklength of 200 over uniform signaling is approximately 450 km (approximately 19%).
“…Multiple algorithms have been proposed to realize sphere shaping by indexing the bounded-energy amplitude sequences [22], [26], [31], [32], [42]. In this work, we use the enumerative approach introduced in [31], and named enumerative sphere shaping (ESS) in [33]- [35].…”
Section: Enumerative Sphere Shapingmentioning
confidence: 99%
“…4. Example 6 (ESS Indexing): Consider the sequence a = (5, 3, 1, 3), which is represented by a path passing through energy levels e = (0, 25,34,35,44) in stages n = 0, 1, 2, 3, 4, respectively. This path is shown with dashed lines in Fig.…”
Section: Enumerative Sphere Shapingmentioning
confidence: 99%
“…Sphere shaping can be implemented using different ways such as: ESS, which has been introduced in [31], shell mapping, and the approach in [32]. Recently, after the proposal of probabilistic amplitude shaping (PAS) scheme [19], ESS has been reconsidered for wireless communications as the amplitude shaper in PAS structure [34], [35]. ESS considers amplitude sequences satisfying a maximum-energy, i.e., sphere, constraint and aims to close the shaping gap by improving the energy-efficiency rather that directly aiming to obtain the capacity-achieving distribution as CCDM.…”
Probabilistic shaping based on constant composition distribution matching (CCDM) has received considerable attention as a way to increase the capacity of fiber optical communication systems. CCDM suffers from significant rate loss at short blocklengths and requires long blocklengths to achieve high shaping gain, which makes its implementation very challenging. In this paper, we propose to use enumerative sphere shaping (ESS) and investigate its performance for the nonlinear fiber optical channel. ESS has lower rate loss than CCDM at the same shaping rate, which makes it a suitable candidate to be implemented in real-time high-speed optical systems. In this paper, we first show that finite blocklength ESS and CCDM exhibit higher effective signal-to-noise ratio than their infinite blocklength counterparts. These results show that for the nonlinear fiber optical channel, large blocklengths should be avoided. We then show that for a 400 Gb/s dual-polarization 64-QAM WDM transmission system, ESS with short blocklengths outperforms both uniform signaling and CCDM. Gains in terms of both bit-metric decoding rate and bit-error rate are presented. ESS with a blocklength of 200 is shown to provide an extension reach of about 200 km in comparison with CCDM with the same blocklength. The obtained reach increase of ESS with a blocklength of 200 over uniform signaling is approximately 450 km (approximately 19%).
“…ESS, on the other hand, is a shaping algorithm based on sphere coding which indirectly induces a nonuniform distribution. In ESS, the output amplitude sequences are bounded-energy sequences, i.e., all sequences satisfy a maximum energy constraint [11,12]. As a consequence of this, more input bits k are used for the same blocklength n, resulting in a much lower rate loss.…”
Section: Pas With Ccdm and Essmentioning
confidence: 99%
“…In this paper, an alternative probabilistic shaping algorithm based on enumerative sphere shaping (ESS) is experimentally validated for the first time. ESS was introduced in 1993 [10] and has been recently considered for wireless communications [11]. Very recently, ESS has been introduced to the optical community in [12].…”
We transmit probabilistic enumerative sphere shaped dual-polarization 64-QAM at 350Gbit/s/channel over 1610km SSMF using a short blocklength of 200. A reach increase of 15% over constant composition distribution matching with identical blocklength is demonstrated.
SummaryWith the continuous expansion scale of data center networks (DCNs), the probability of network failures becomes high. Trustworthy fault‐tolerant routing is extremely significant for reliable communication in data centers. In this article, we tackle the challenge by proposing a novel fault‐tolerant routing scheme for a torus‐based DCN. First, we present a multipath information transmission model based on the trust degree of reachable paths and propose a novel Hamiltonian odd–even turning model without deadlock. Second, we design an efficient deadlock‐free fault‐routing algorithm by constructing the longest fault‐free path between any two fault‐free nodes in DCN. Extensive simulation results show that the proposed fault‐tolerant routing outperforms the previous algorithms. Compared with the most advanced fault‐tolerant routing algorithms, the proposed algorithm has a 21.5% to 25.3% increase in throughput and packet arrival rate. Moreover, it can reduce the average delay of 18.6% and the maximum delay of 23.7% in the network respectively.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.