We propose a low-complexity sign-dependent metric for sequence selection and study the nonlinear shaping gain achievable for a given computational cost, establishing a benchmark for future research. Small gains are obtained with feasible complexity. Higher gains are achievable in principle, but with high complexity or a more sophisticated metric.

翻译：我们提出了一种低复杂度的符号相关度量用于序列选择，并研究了在给定计算成本下可实现的非线性整形增益，为未来研究建立了基准。在可行复杂度下可获得较小增益。原则上可实现更高增益，但需更高复杂度或更复杂的度量方法。