Optical signal transmitter and optical communication system using constant modulus formats, and method for generating modulation codes

Patent metadata

Field	Value
Publication number	US-9806739-B1
Application number	US-201615372611-A
Country	US
Kind code	B1
Filing date	Dec 8, 2016
Priority date	Aug 4, 2016
Publication date	Oct 31, 2017
Grant date	Oct 31, 2017

Abstract

An optical data coding method includes at least steps of selecting a modulation scheme comprising an X-polarization constellation format having first and second amplitude rings with circular grids corresponding to predetermined phase angles and a Y-polarization constellation format having the first and second amplitude rings with the circular grids corresponding to the predetermined phase angles, arranging a first part of the symbol on a first circular grid of the first amplitude ring on the X-polarization constellation format, and arranging a second part of the symbol on a second circular grid of the second amplitude ring on the Y-polarization constellation format.

First claim

We claim:

1. An optical data coding method for generating optical data codes from a symbol using a processor in communication with a memory, the method comprising steps of;
selecting a modulation scheme comprising an X-polarization constellation format having first and second amplitude rings with circular grids corresponding to predetermined phase angles and a Y-polarization constellation format having the first and second amplitude rings with the circular grids corresponding to the predetermined phase angles;
arranging a first part of the symbol on a first circular grid of the first amplitude ring on the X-polarization constellation format;
arranging a second part of the symbol on a second circular grid of the second amplitude ring on the Y-polarization constellation format;
encoding the first part of the symbol into a first subset of an optical data code using the first amplitude ring indicating a first amplitude value and the first circular grid indicating a first phase angle; and
encoding the second part of the symbol into a second subset of the optical data code using the second amplitude ring indicating a second amplitude value and the second circular grid indicating a second phase angle.

2. The method of claim 1 , wherein the first subset of the optical data code is represented by first four bits having three bits indicating the first phase angle in Gray coding and one bit being a first parity bit indicating the first amplitude value, and the second subset of the optical data code is represented by second four bits having three bits indicating the second phase angle in Gray coding and one bit being a second parity bit indicating the second amplitude value of the second subset of the symbol.

3. The method of claim 2 , wherein the symbol is assigned predetermined five information bits of b0, b1, b2, b3 and b4,
wherein the three bits of the first four bits are represented by the information bits b0, b1 and b2, and the three bits of the second four bits are represented by information bits b3, b4 and a third parity bit b5, and the first parity bit and the second parity bit are respectively represented by additional bits b6 and b7,
wherein the third parity bit b5 is determined by a logical exclusive-OR (XOR) operation of a first predetermined combination of b0, b1, b2, b3 and b4,
wherein the first parity bit is determined by the XOR operation expressed by the logical XOR operation of a second predetermined combination of b0, b1, b2, b3 and b4, and
wherein the second parity bit is determined by a logical NOT operation expressed by b7=NOT(b6).

4. The method of claim 2 , wherein the symbol is assigned predetermined five information bits of b0, b1, b2, b3 and b4,
wherein the three bits of the first four bits are represented by the information bits b0, b1 and b2, and the three bits of the second four bits are represented by information bits b3, b4 and a third parity bit b5, and the first and second parity bits are respectively represented by additional bits b6 and b7,
wherein the third parity bit b5 is determined by a logical exclusive-OR (XOR) operation expressed by b5=XOR(b0, b1, b2),
wherein the first parity bit is determined by the XOR operation expressed by b6=XOR(b2, b3, b4), and
wherein the second parity bit is determined by a logical NOT operation expressed by b7=NOT(b6).

5. The method of claim 2 , wherein the symbol is assigned predetermined five information bits of b0, b1, b2, b3 and b4,
wherein the three bits of the first four bits are represented by the information bits b0, b1 and b2, and the three bits of the second four bits are represented by information bits b3, b4 and a third bit b5, and the first parity bit and the second parity bit are respectively represented by additional bits b6 and b7,
wherein the third parity bit b5 is determined by a logical exclusive-OR (XOR) operation expressed by b5=XOR(b0, b1, b2),
wherein the first parity bit is determined by the XOR operation expressed by b6=XOR(b0, b1, b3, b4), and
wherein the second parity bit is determined by a logical NOT operation expressed by b7=NOT(b6).

6. The method of claim 2 , wherein the symbol is assigned predetermined six information bits of b0, b1, b2, b3, b4 and b5,
wherein the three bits of the first four bits are represented by the information bits b0, b1 and b2, the three bits of the second four bits are represented by the information bits b3, b4 and b5, and the first parity bit and the second parity bit are respectively represented by additional bits b6 and b7,
wherein the first parity bit is determined by a logical exclusive-OR (XOR) operation of a predetermined combination of b0, b1, b2, b3, b4, and b5, and
wherein the second parity bit is determined by a logical NOT operation expressed by b7=NOT(b6).

7. The method of claim 2 , wherein the symbol is assigned predetermined six information bits of b0, b1, b2, b3, b4 and b5,
wherein the three bits of the first four bits are represented by the information bits b0, b1 and b2, the three bits of the second four bits are represented by the information bits b3, b4 and b5, and the first parity bit and the second parity bit are respectively represented by additional bits b6 and b7,
wherein the first parity bit is determined by a logical exclusive-OR (XOR) operation expressed by b6=XOR(b0, b1, b2, b3, b4, b5), and
wherein the second parity bit is determined by a logical NOT operation expressed by b7=NOT(b6).

8. The method of claim 2 , wherein the symbol is represented by seven information bits b0, b1, b2, b3, b4, b5 and b6,
wherein the three bits of the first four bits are represented by the information bits b0, b1 and b2, and the first parity bit is represented by the information bit b3,
wherein the three bits of the second four bits are represented by the information bits b4, b5 and b6, and the second parity bit is represented by an additional bit b7 determined by a logical NOT operation expressed by b7=NOT(b3).

9. The method of claim 2 , wherein the first subset of the optical data code and the second subset of the optical data code are arranged into at least two time slots.

10. The method of claim 2 , wherein at least one of the first and second subsets is arranged into one time slot among a plurality of time slots.

11. The method of claim 1 , wherein a seven-bit (7-bit) symbol occupies two time slots,
wherein one of the two time slots uses a two-amplitude quadrature phase-shift keying (2AQPSK) format arranging a variable x1 in an X-polarization constellation and a variable y1 in a Y-polarization constellation, and another time slot uses a two-amplitude eight phase-shift keying (2A8PSK) format arranging a variable x2 in the X-polarization constellation and a variable y2 in the Y-polarization constellation,
wherein both 2AQPSK and 2A8PSK formats are four-dimensional (4D) constant modulus,
and wherein Grassmann code condition satisfies y2=−x1*·y1/x2*.

12. The method of claim 1 , wherein a six-bit (6-bit) symbol occupies two time slots,
wherein one of the two time slots uses a two-amplitude quadrature phase-shift keying (2AQPSK) format arranging a variable x1 in an X-polarization constellation and a variable y1 in a Y-polarization constellation, and another time slot uses the 2AQPSK format arranging a variable x2 in the X-polarization constellation and a variable y2 in the Y-polarization constellation, wherein both 2AQPSK formats are four dimensional (4D) constant,
and wherein Grassmann code condition satisfies y2=−x1*·y1/x2*.

13. The method of claim 1 , further comprising:
providing a second symbol including first and second parts, wherein the first and second parts of the second symbol are respect

Assignees

• Mitsubishi Electric Res Laboratories Inc
• Mitsubishi Electric Corp

Inventors

• Kojima Keisuke
• Yoshida Tsuyoshi
• Koike-Akino Toshiaki
• Millar David
• Parsons Kieran

Classifications

• H04B10/532

  Polarisation modulation · CPC title

• H04B10/2507

  for the reduction or elimination of distortion or dispersion · CPC title

• H04B10/5053

  using a parallel, i.e. shunt, combination of modulators · CPC title

• H04B10/5561

  Digital phase modulation · CPC title

• H03M7/30 Primary

  Compression (speech analysis-synthesis for redundancy reduction G10L19/00; for image communication H04N); Expansion; Suppression of unnecessary data, e.g. redundancy reduction · CPC title