Please use this identifier to cite or link to this item: http://dspace.unimap.edu.my:80/xmlui/handle/123456789/14055
Title: Development of a new code family based on SAC-OCDMA system with large cardinality for OCDMA network
Authors: Thanaa Hussein, Abd
Syed Alwee Aljunid, Syed Junid, Prof. Dr.
Hilal Adnan, Fadhil
R. A., Ahmad
Mohamad Naufal, Mohamad Saad, Dr.
Keywords: Modified Quadratic Congruence (MQC) code and Random Diagonal (RD) code
Multi-Diagonal (MD) code
Spectral Amplitude - Coding Optical Code Division Multiple Access (SAC-OCDMA)
Issue Date: Jul-2011
Publisher: Elsevier Inc.
Citation: Optical Fiber Technology, vol. 17 (4), 2011, pages 273-280
Abstract: We have proposed a new Multi-Diagonal (MD) code for Spectral Amplitude - Coding Optical Code Division Multiple Access (SAC-OCDMA). Although this new MD code has many properties, one of the important properties of this code is that the cross correlation is always zero. Simplicity in code construction and flexibility in cross correlation control has made this code a compelling candidate for future OCDMA applications. The Multiple access interference (MAI) effects have been successfully and completely eliminated. Based on the theoretical analysis MD code is shown here to provide a much better performance compared to Modified Quadratic Congruence (MQC) code and Random Diagonal (RD) code. Proof-of-principle simulations of encoding with 5 and 10 users with 622 Mb/s data transmission at a BER of 10-12 have been successfully demonstrated together with the DIRECT detection scheme.
Description: Link to publisher's homepage at http://www.elsevier.com/
URI: http://www.sciencedirect.com/science/article/pii/S1068520011000526
http://dspace.unimap.edu.my/123456789/14055
ISSN: 1068-5200
Appears in Collections:School of Computer and Communication Engineering (Articles)
Syed Alwee Aljunid Syed Junid, Prof. Ir. Ts. Dr.

Files in This Item:
File Description SizeFormat 
development of the new code family.pdf7.52 kBAdobe PDFView/Open


Items in UniMAP Library Digital Repository are protected by copyright, with all rights reserved, unless otherwise indicated.