Constellation optimization based on generalized mutual information over a nonlinear optical channel

Patent metadata

Field	Value
Publication number	US-10382138-B2
Application number	US-201815912852-A
Country	US
Kind code	B2
Filing date	Mar 6, 2018
Priority date	Mar 6, 2017
Publication date	Aug 13, 2019
Grant date	Aug 13, 2019

Abstract

Aspects of the present disclosure describe methods of generating an optimized set of constellation symbols for an optical transmission network wherein the optimized constellation is based on GMI cost and considers both fiber nonlinearity and linear transmission noise.

First claim

The invention claimed is:

1. A computer implemented method of generating an optimized constellation for an optical fiber network including one or more optical channels, the method comprising: by the computer:
receiving by the computer for one of the one or more optical channels, a target constellation X with assigned bit mapping and geometric shape, wherein X is taken from an N-dim signal constellation {X 1 ,X 2 , - - - ,X M } at a specified probability mass function (PMF) given by p(Xi), i∈{1,2, - - - ,M};
receiving by the computer for the one of the one or more optical channels, channel parameters for the one channel including fiber dispersion, nonlinearity coefficients, span length, noise figures, channel spacing and symbol baudrate;
determining by the computer for the one of the one or more optical channels using the target constellation and the channel parameters, a received nonlinear signal-to-noise ratio (SNR) including both linear amplifier noise and modulation-dependent nonlinear noise;
iteratively determining for the received nonlinear SNR, a generalized mutual information (GMI) cost function by generating random symbols from the target constellation X following a given PMF p(xi), the GMI determined according to the following relationship:

R
GMI

=

H
⁡

(
X
)

+

∑

i
=
1

l
⁢

⁢
o
⁢

⁢

g
2

⁢
M

⁢

〈

log
2

⁡

[

b
i

⁡

(
j
)

·

L
1

⁡

(
j
)

+

(

1
-

b
i

⁡

(
j
)

)

·

L
0

⁡

(
j
)

p
y

⁡

(
j
)

]

〉

,

where bi(j)ε{0,1} denotes transmitted bits for jth symbol at ith bit and Py(j) is a probability of a received jth symbol Y(j), and operator <⋅> represents an arithmetic average over all a simulated symbol index j;
L 0 and L 1 represent a bit likelihood (L) for the received jth symbol Y(j), which is determined according to the following relationship:

L

b
,

=
0

,
1

j

⁢

∑

x

b
i

=
0

,
1

⁢

p
⁡

(

y
⁡

(
j
)

|

x

b

Assignees

• Nec Lab America Inc
• Nec Corp

Inventors

• Zhang Shaoliang
• Yaman Fatih
• Rodriguez Eduardo Mateo
• Inada Yoshihisa

Classifications

• H03M13/255

  with Low Density Parity Check [LDPC] codes · CPC title

• H04L1/0057

  Block codes (H04L1/0061, H04L1/0064 take precedence) · CPC title

• H04L1/0041

  Arrangements at the transmitter end · CPC title

• H04B10/5161 Primary

  Combination of different modulation schemes · CPC title

• H04L27/3405

  Modifications of the signal space to increase the efficiency of transmission, e.g. reduction of the bit error rate, bandwidth, or average power · CPC title