2019
DOI: 10.1117/1.oe.58.3.035101
|View full text |Cite
|
Sign up to set email alerts
|

Performance analysis of optical code division multiple access networks for multimedia applications using multilength weighted modified prime codes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
17
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 13 publications
(17 citation statements)
references
References 0 publications
0
17
0
Order By: Relevance
“…Throughout the analysis, it has been assumed that N is the maximum number of active users out of P2 available number of sequences, where the remaining number of users is inactive. Furthermore, αn,nthickmathspace}{1,2,,P2 is given as a random variable that is defined as [13, 15] αn=thickmathspace{1em4pt1,ifthickmathspaceuserthinmathspace#nthinmathspaceisthinmathspaceactive0,ifthinmathspaceuserthinmathspace#nthinmathspaceisthinmathspaceinactiveThus, n=1P)(P1αn=N. Additionally, in the first group the number of active users can be represented by a random variable U , and u is the realisation variable of U . If user #2 is recommended, then U=n=1P)(P1αn, hence, the probability distribution can be expressed as PU)(u=)(1em4ptP)(P1Nu)(1em4ptP1u1)(1em4ptP)(P11N1where …”
Section: Ber Performance Analysis and Simulation Resultsmentioning
confidence: 99%
See 3 more Smart Citations
“…Throughout the analysis, it has been assumed that N is the maximum number of active users out of P2 available number of sequences, where the remaining number of users is inactive. Furthermore, αn,nthickmathspace}{1,2,,P2 is given as a random variable that is defined as [13, 15] αn=thickmathspace{1em4pt1,ifthickmathspaceuserthinmathspace#nthinmathspaceisthinmathspaceactive0,ifthinmathspaceuserthinmathspace#nthinmathspaceisthinmathspaceinactiveThus, n=1P)(P1αn=N. Additionally, in the first group the number of active users can be represented by a random variable U , and u is the realisation variable of U . If user #2 is recommended, then U=n=1P)(P1αn, hence, the probability distribution can be expressed as PU)(u=)(1em4ptP)(P1Nu)(1em4ptP1u1)(1em4ptP)(P11N1where …”
Section: Ber Performance Analysis and Simulation Resultsmentioning
confidence: 99%
“…In [13–15], many comparisons were held between the codes are illustrated in Table 2, such comparisons included the other important code used in OCDMA systems such as the optical orthogonal code (OOC). These comparisons indicated that the MPC outperforms the OOC.…”
Section: Ber Performance Analysis and Simulation Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…thermal noise, shot noise, and multiple access interference). The probability of l interfering PPM chips overlaps with the desired chip for the case of an ideal chip-synchronous OCDMA network when employing optical orthogonal codes, which is given by [26,27]…”
Section: Ber Performance Analysismentioning
confidence: 99%