
Reduced-complexity algorithm for space-demultiplexing based on higher-order Poincaré spheres
Author(s) -
Gil M. Fernandes,
Nelson J. Muga,
Armando N. Pinto
Publication year - 2018
Publication title -
optics express
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.394
H-Index - 271
ISSN - 1094-4087
DOI - 10.1364/oe.26.013506
Subject(s) - multiplexing , algorithm , computer science , optics , computational complexity theory , convergence (economics) , reduction (mathematics) , inverse , physics , topology (electrical circuits) , mathematics , telecommunications , geometry , combinatorics , economics , economic growth
We propose a reduced-complexity space-demultiplexing algorithm based on higher-order Poincaré spheres (HoPs) which is modulation format agnostic, free of training sequences and robust to the local oscillator phase fluctuations and frequency offsets. The signal tributaries are space-demultiplexed by calculating and realigning the best fit plane in the HoPs, with the inverse channel matrix being iteratively constructed by sequentially space-demultiplexing all pairs of tributaries. When compared with the previous proposed HoPs-based space-demultiplexing algorithm, results show a complexity reduction gain of 99% along with an improvement of 97% in terms of convergence speed.