.png){kind=icon}
.png){kind=icon}
Return
Blind phase search algorithm based on threshold simplification
.png){kind=icon}
OA
AI
DOI：10.1007/s11082-022-04505-x.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A simplified scheme for the blind phase search (BPS) algorithm is proposed. By comparing the loss function with a threshold value, the number of test phases is reduced. Simulation and experimental results show that compared with the traditional BPS algorithm, this algorithm only needs half of the test phases under the same performance.
Keywords:
QAM
BPS
Polarization multiplexing
Optical communication
Journal
IF:
4
Papers:
9.9K
Citations:
1.8W