Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Saeed Mashhadi

dblp:60/4711 · DBLP profile ↗
← Back
6ranked-venue papers
5as first author
0since 2021 · last 2011
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 6 · 5 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
4 papers
Optical networks · 53% Physical-layer communications · 43% Wireless networking · 4%
Theoretical computer science
3 papers
Coding theory · 100%

Topics — the 9 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Optical networks
optical code-division multiple access
0.232008
Optimum code structures for positive optical CDMA using normalized divergencemaximization criterion · IEEE Trans. Commun. 2008
Code-division multiple-access techniques in optical fiber networks - part III: optical AND logic gate receiver structure with generalized optical orthogonal codes · IEEE Trans. Commun. 2006
Code-Division Multiple-Access Techniques in Optical Fiber Networks - Part III: Optical AND Gate Receiver Structure With Generalized Optical Orthogonal Codes · IEEE Trans. Commun. 2006
Optical networks › optical code-division multiple access
optical orthogonal codes
0.122006
Code-division multiple-access techniques in optical fiber networks - part III: optical AND logic gate receiver structure with generalized optical orthogonal codes · IEEE Trans. Commun. 2006
Code-Division Multiple-Access Techniques in Optical Fiber Networks - Part III: Optical AND Gate Receiver Structure With Generalized Optical Orthogonal Codes · IEEE Trans. Commun. 2006
Physical-layer communications › channel coding › error control coding
code design
0.112008
Optimum code structures for positive optical CDMA using normalized divergencemaximization criterion · IEEE Trans. Commun. 2008
Physical-layer communications
code-division multiple access
0.112008
UWB spectrally-encoded spread-time CDMA in the presence of multiple gaussian interferences: RAKE receiver and three-level codes · IEEE Trans. Commun. 2008
Physical-layer communications
spread spectrum
0.112008
UWB spectrally-encoded spread-time CDMA in the presence of multiple gaussian interferences: RAKE receiver and three-level codes · IEEE Trans. Commun. 2008
Coding theory › error-correcting codes
code construction
0.022006
Code-division multiple-access techniques in optical fiber networks - part III: optical AND logic gate receiver structure with generalized optical orthogonal codes · IEEE Trans. Commun. 2006
Code-Division Multiple-Access Techniques in Optical Fiber Networks - Part III: Optical AND Gate Receiver Structure With Generalized Optical Orthogonal Codes · IEEE Trans. Commun. 2006
Physical-layer communications › diversity combining
RAKE receiver
0.012008
UWB spectrally-encoded spread-time CDMA in the presence of multiple gaussian interferences: RAKE receiver and three-level codes · IEEE Trans. Commun. 2008
Wireless networking › wireless transmission
ultra-wideband
0.012008
UWB spectrally-encoded spread-time CDMA in the presence of multiple gaussian interferences: RAKE receiver and three-level codes · IEEE Trans. Commun. 2008
Coding theory › sequences › sequence design
optical orthogonal codes
0.012008
Optimum code structures for positive optical CDMA using normalized divergencemaximization criterion · IEEE Trans. Commun. 2008

Methods — techniques the papers use, named apart from their topics

probability theory · 0.2optimization · 0.2divergence maximization · 0.2simulation · 0.1
YearPublicationVenuePosition
2011 Performance of three-level spectrally encoded spreadtime CDMA in the presence of multiple interferences
abstract
In this study the authors present an in-depth study, analysis and discussion on maximum likelihood (ML)-based receiver for a typical spectrally encoded spread-time CDMA in the presence of multiple narrowband interference (NBI) signals in an additive white Gaussian noise channel. Furthermore, the authors demonstrate that by combining useful properties of ML-based receiver and three-level codes, that is, codes with values of −1, 0, +1, the authors can introduce a new strategy in which superior performance with respect to previous receiver structure based on two-level codes, that is, codes with values of −1, +1, can be attained. With the help of an example, the authors drive, first, the required signal-to-noise+interference power ratio (SNR) in a multiple access communication environment with multiple NBIs and, second, SNR attenuating parameter owing to multiple NBIs for two- and three-level codes. Finally, the authors relate the above parameters to a number of simple descriptive factors such as bit error rate. The results are validated by an extensive simulation on the aforementioned system.
Saeed Mashhadi, Jawad A. Salehi
IET Commun.1
2009 Novel probabilistic bounds on power level profile of spectrally-encoded spread-time CDMA signals
abstract
In this letter we introduce an effective tool to demonstrate signal power behavior of a typical spectrally encoded spread-time (SE/ST) CDMA system using probabilistic approach. By defining power level profile (PLP), as the probability of stretching instantaneous power from a pre-specified threshold, we can find novel upper bounds on the signal power profile. We discuss various properties owing to PLP and elaborate on the main parameters affecting the PLP value. We present three theorems, propose some simple upper bounds on the PLP, and give an insight on the main contributions of the results. We introduce a fundamental parameter, namely ß, as a key design parameter which relates the most important quantities affecting the PLP behavior. Finally, we propose a corollary demonstrating an approach to guarantee that the PLP value is set at zero. It is shown that using suitable distributions, we can also obtain some distribution gain, thereby enhancing the overall system performance.
Jawad A. Salehi, Saeed Mashhadi
IEEE Trans. Wirel. Commun.2
2008 Optimum code structures for positive optical CDMA using normalized divergencemaximization criterion
abstract
In this letter we consider optimum code structure for positive optical code division multiple-access (optical CDMA) systems. Positive systems are a class of systems that operate with positive real numbers only. We consider the effect of multipleaccess interference in our model and show that code design for both On-Off Keying (OOK) and Binary PPM optical CDMA systems results in the same solutions. Furthermore, we show that a class of codes known as optical orthogonal codes (OOCs) are the best possible positive codes. In obtaining the results we define normalized divergence based on signal-to-multipleaccess interference ratio (SIR) for a multiple-access system in a useful manner and use it as our criterion to maximize the multiple-access capability of the codes. Finally, we demonstrate that BPPM/OOC can be considered as the closest counterpart of plusmn1 pseudorandom sequence in radio CDMA communication systems.
Saeed Mashhadi, Jawad A. Salehi
IEEE Trans. Commun.1
2008 UWB spectrally-encoded spread-time CDMA in the presence of multiple gaussian interferences: RAKE receiver and three-level codes
abstract
In this paper we study and analyze the performance of the RAKE receiver for a typical ultrawideband (UWB) spectrally-encoded spread-time (ST) CDMA in the presence of multiple Gaussian interference (GI) signals. We demonstrate that by combining useful properties of three-level codes, i.e., codes with values of -1, 0, +1, and RAKE receiver, we can introduce a new strategy in which it can result in superior performance when compared to previous results. In particular, following a discussion on three-level codes we can show that RAKE receiver with optimum multiplicative weights achieves a better performance when compared with simple two-level codes. With the help of an example we show various properties of RAKE receiver as well as three-level codes and relate these properties to a number of simple descriptive parameters of the communication media. Simulation results obtained in this paper indicate the precision with which the analytical results have been obtained in modeling the above system.
Saeed Mashhadi, Jawad A. Salehi
IEEE Trans. Commun.1
2006 Code-Division Multiple-Access Techniques in Optical Fiber Networks - Part III: Optical AND Gate Receiver Structure With Generalized Optical Orthogonal Codes
abstract
In this paper, we present a deep insight into the behavior of optical code-division multiple-access (CDMA) systems based on an incoherent, intensity encoding/decoding technique using a well-known class of codes, namely, optical orthogonal codes (OOCs). As opposed to parts I and II of this paper, where OOCs with cross-correlation$lambda = 1$were considered, we consider generalized OOCs with$1 leq lambda leq w$, where$w$is the weight of the corresponding codes. To enhance the performance of such systems, we propose that use of optical AND gate receiver, which, in an ideal case, e.g., in the absence of any noise source except the optical multiple-access noise, is optimum. Using some basic laws on probability, we present direct and exact solutions for OOCs with$lambda = 1,2,3,ldots,w$, with optical AND gate as receiver. Using the exact solution, we obtain empirical solutions that can be easily used in optimizing the design criteria of such systems. From our optimization scheme, we obtain some fresh insight into the performance of OOCs with$lambdageq 1$. In particular, we can obtain some simple relations between$ P_ e min$(minimum error rate),$L_min$(minimum required OOC length), and$N_max$(maximum number of interfering users to be supported), which are the most desired parameters for any optical CDMA system design. Furthermore, we show that in most practical cases, OOCs with$lambda = 2$or$3$perform better than OOCs with$lambda = 1$, while having a much bigger cardinality. Finally, we show that an upper bound on the maximum weight of OOCs are on the order of$sqrt2lambda L$where L is the length of the OOCs used in systems.
Saeed Mashhadi, Jawad A. Salehi
IEEE Trans. Commun.1
2006 Code-division multiple-access techniques in optical fiber networks - part III: optical AND logic gate receiver structure with generalized optical orthogonal codes
abstract
In this paper, we present a deep insight into the behavior of optical code-division multiple-access (OCDMA) systems based on an incoherent, intensity encoding/decoding technique using a well-known class of codes, namely, optical orthogonal codes (OOCs). As opposed to parts I and II of this paper, where OOCs with cross-correlation lambda=1 were considered, we consider generalized OOCs with 1leslambdalesw, where w is the weight of the corresponding codes. To enhance the performance of such systems, we propose the use of an optical and logic gate receiver, which, in an ideal case, e.g., in the absence of any noise source, except the optical multiple-access interference, is optimum. Using some basic laws on probability, we present direct and exact solutions for OOCs with lambda=1,2,3,...,w, with the optical and logic gate as receiver. Using the exact solution, we obtain empirical solutions that can be easily used in optimizing the design criteria of such systems. From our optimization scheme, we obtain some fresh insight into the performance of OOCs with lambdages1. In particular, we can obtain some simple relations between Pemin(minimum error rate), Lmin(minimum required OOC length), and Nmax(maximum number of interfering users to be supported), which are the most desired parameters for any OCDMA system design. Furthermore, we show that in most practical cases, OOCs with lambda=2,3 perform better than OOCs with lambda=1, while having a much bigger cardinality. Finally, we show that an upper bound on the maximum weight of OOCs are on the order of radic2lambdaL where L is the length of the OOCs
Saeed Mashhadi, Jawad A. Salehi
IEEE Trans. Commun.1