A REED-SOLOMON CODED OPTICALLY PREAMPLIFIED PPM SYSTEM

被引：0
作者：
CRYAN, RA
机构：
[1] Department of Electrical, Electronic Engineering and Physics, University of Northumbria at Newcastle, Newcastle Upon Tyne
来源：
MICROWAVE AND OPTICAL TECHNOLOGY LETTERS | 1995年 / 9卷 / 03期
关键词：
OPTICAL FIBER COMMUNICATIONS; PULSE POSITION MODULATION; OPTICAL PREAMPLIFICATION; ERROR CORRECTION;
D O I：
10.1002/mop.4650090306
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
A Reed-Solomon coded optically preamplified pulse-position modulation system is analyzed. Results are presented at a bit rate of 622 Mbit/s and a wavelength of 1.537 mu m, comparing the system with an equivalent on-off nonreturn-to-zero (OOK NRZ) system. The theoretical results demonstrate that the system offers a potential sensitivity of 7 photons/bit, which represents an improvement of 7.5 dB over the equivalent OOK system and is comparable with that of the best coherent systems reported to date. (C) 1995 Wiley & Sons, Inc.
引用
收藏
页码：127 / 130
页数：4
相关论文
共 50 条
[31]   Reliable and Secure Multishot Network Coding using Linearized Reed-Solomon Codes [J].
Martinez-Penas, Umberto ;
Kschischang, Frank R. .
2018 56TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2018, :702-709
[32]   Improved Soft Decoding of Reed-Solomon Codes on Gilbert-Elliott Channels [J].
Kulhandjian, Michel ;
Kulhandjian, Hovannes ;
D'Amours, Claude .
2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2019, :1072-1076
[33]   Reliable and Secure Multishot Network Coding Using Linearized Reed-Solomon Codes [J].
Martinez-Penas, Umberto ;
Kschischang, Frank R. .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2019, 65 (08) :4785-4803
[34]   Combinatorial List-Decoding of Reed-Solomon Codes beyond the Johnson Radius [J].
Chong Shangguan ;
Tamo, Itzhak .
PROCEEDINGS OF THE 52ND ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '20), 2020, :538-551
[35]   Error Performance Analysis of Optically-preamplified QPSK M-ary PPM Systems over Atmospheric Turbulent Channels [J].
Landolsi, Taha ;
Elrefaie, Aly F. .
2016 10TH INTERNATIONAL SYMPOSIUM ON COMMUNICATION SYSTEMS, NETWORKS AND DIGITAL SIGNAL PROCESSING (CSNDSP), 2016,
[36]   Using Reed-Solomon codes in the (U | U plus V) construction and an application to cryptography [J].
Marquez-Corbella, Irene ;
Tillich, Jean-Pierre .
2016 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2016, :930-934
[37]   NP-Hardness of Reed-Solomon Decoding and the Prouhet-Tarry-Escott Problem [J].
Gandikota, Venkata ;
Ghazi, Badih ;
Grigorescu, Elena .
2016 IEEE 57TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2016, :760-769
[38]   NP-HARDNESS OF REED-SOLOMON DECODING, AND THE PROUHET-TARRY-ESCOTT PROBLEM [J].
Gandikota, Venkata ;
Ghazi, Badih ;
Grigorescu, Elena .
SIAM JOURNAL ON COMPUTING, 2018, 47 (04) :1547-1584
[39]   Real-Time Video Streaming Using Randomized Expanding Reed-Solomon Code [J].
Xiao, Jimin ;
Tillo, Tammam ;
Zhao, Yao .
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, 2013, 23 (11) :1825-1836
[40]   List decoding Reed-Solomon, Algebraic -Geometric, and Gabidulin subcodes up to the Singleton bound [J].
Guruswami, Venkatesan ;
Xing, Chaoping .
STOC'13: PROCEEDINGS OF THE 2013 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2013, :843-852
12345