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

Svetislav V. Maric

dblp:23/208 · DBLP profile ↗
← Back
10ranked-venue papers
4as first author
0since 2021 · last 2006
—ORCID · none

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

Computer networks · 5 · 3 first-authorSecurity and privacy · 1Graphics, computer vision, multimedia, augmented reality and games · 1Theory of computation · 1Applied, interdisciplinary, general and emerging computing · 1

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.

Theoretical computer science
4 papers
Coding theory · 87% Information theory · 13%
Computer networks
5 papers
Physical-layer communications · 92% Cellular and mobile networks · 5% Internet architecture and protocols · 2%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications
code-division multiple access
0.031999
Variable rate adaptive modulation for DS-CDMA · IEEE Trans. Commun. 1999
Construction and performance analysis of a new family of optical orthogonal codes for CDMA fiber-optic networks · IEEE Trans. Commun. 1995
A new family of optical code sequences for use in spread-spectrum fiber-optic local area networks · IEEE Trans. Commun. 1993
Physical-layer communications
spread spectrum
0.021998
The Capacities of Frequency-Hopped Code-Division Multiple-Access Channels · IEEE Trans. Inf. Theory 1998
A class of frequency hop codes with nearly ideal characteristics for use in multiple-access spread-spectrum communications and radar and sonar systems · IEEE Trans. Commun. 1992
Coding theory › error-correcting codes › code construction
algebraic construction
0.012000
A new family of frequency-hop codes · IEEE Trans. Commun. 2000
Coding theory › sequences › pseudorandom sequences
autocorrelation and cross-correlation properties
0.012000
A new family of frequency-hop codes · IEEE Trans. Commun. 2000
Coding theory › error-correcting codes
code construction
0.012000
A new family of frequency-hop codes · IEEE Trans. Commun. 2000
Coding theory › sequences › sequence design
frequency-hopping codes
0.012000
A new family of frequency-hop codes · IEEE Trans. Commun. 2000
Coding theory › sequences › sequence design
optical orthogonal codes
0.021995
Construction and performance analysis of a new family of optical orthogonal codes for CDMA fiber-optic networks · IEEE Trans. Commun. 1995
A new family of optical code sequences for use in spread-spectrum fiber-optic local area networks · IEEE Trans. Commun. 1993
Physical-layer communications › modulation
adaptive modulation and coding
0.011999
Variable rate adaptive modulation for DS-CDMA · IEEE Trans. Commun. 1999
Physical-layer communications › spread spectrum
frequency hopping
0.011998
The Capacities of Frequency-Hopped Code-Division Multiple-Access Channels · IEEE Trans. Inf. Theory 1998
Information theory
channel capacity
0.011998
The Capacities of Frequency-Hopped Code-Division Multiple-Access Channels · IEEE Trans. Inf. Theory 1998
Cellular and mobile networks
power control
0.011999
Variable rate adaptive modulation for DS-CDMA · IEEE Trans. Commun. 1999
Physical-layer communications › diversity combining
RAKE receiver
0.011999
Variable rate adaptive modulation for DS-CDMA · IEEE Trans. Commun. 1999
Internet architecture and protocols
local area network
0.011993
A new family of optical code sequences for use in spread-spectrum fiber-optic local area networks · IEEE Trans. Commun. 1993

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

gaussian approximation · 0.0costas arrays · 0.0finite field theory · 0.0simulation · 0.0analytical bounds · 0.0quadratic congruences · 0.0number theory · 0.0stochastic approximation · 0.0
YearPublicationVenuePosition
2006 Doubly Periodic Arrays and a New Construction of Multiple Target Sonar and Extended Costas Arrays with Perfect Correlation
abstract
There are only a few multiple target families of Costas and sonar arrays with perfect correlation property. In this paper using the Welch Costas array and some results from design theory we construct perfect auto and cross-correlation families of sonar and extended Costas arrays
Oscar Moreno, Reza Omrani, Svetislav V. Maric
ISIT3
2000 A new family of frequency-hop codes
abstract
We give an algebraic construction for a new family of frequency-hop codes. The construction is based on properties of finite fields: it is shown that for each field GF(p/sup m/), there exists a large number of codes of length p/sup m/. The codes are also shown to possess the best possible simultaneous two-dimensional autocorrelation and cross-correlation properties. Moreover, they include a family of codes: with a code length of a power of 2, which are ideally suitable for applications in digital communication systems.
Oscar Moreno, Svetislav V. Maric
IEEE Trans. Commun.2
1999 Variable rate adaptive modulation for DS-CDMA
abstract
An adaptive coding scheme is introduced for a discrete sequence code-division multiple-access system. The system uses noncoherent M-ary orthogonal modulation with RAKE receiver and power control. Both a fast fading channel and a combined fast fading, shadowing and power control channel are considered. Analytical bounds and simulations are done to evaluate the performance of the system. It is found that there is significant improvement in the average throughput and the bit-error-rate performance in the adaptive coding scheme. The amount of improvement drops with the increase of diversity branches used. More importantly, it is found that adaptive coding scheme is relatively robust to shadowing, while fix-rate codes are ineffective in the shadowing environment. Finally, adaptive coding scheme is found to be robust to mobile speed, feedback delay, and finite interleaving depth.
Vincent K. N. Lau, Svetislav V. Maric
IEEE Trans. Commun.2
1998 The Capacities of Frequency-Hopped Code-Division Multiple-Access Channels
abstract
This correspondence investigates and compares the capacities of two types of frequency-hopped code-division multiple-access (FH-CDMA) communications systems; namely, multilevel on-off keying (OOK) and MFSK, in particular BFSK. In our multiuser channel model, we assume a random hopping pattern is used for each transmitter-receiver pair, and that the ith receiver is only interested in the message transmitted by ith transmitter. The degradation in AWGN and nonselective Rayleigh fading environments of both types of FH systems is also investigated and compared.
Jin G. Goh, Svetislav V. Maric
IEEE Trans. Inf. Theory2
1997 Variable Rate Adaptive Channel Coding for Coherent and Non-coherent Raleigh Fading Channel
Vincent K. N. Lau, Svetislav V. Maric
IMACC2
1995 Threshold based admission policies for multi-rate services in the DECT system
Svetislav V. Maric, Aleksandar Kolarov
PIMRC1
1995 Construction and performance analysis of a new family of optical orthogonal codes for CDMA fiber-optic networks
abstract
A construction of a new family of optical orthogonal codes (OOCs) for use in code division multiple access (CDMA) fiber-optic networks is given. Previous families of OOCs are reviewed and basic requirements for successful implementation of the fiber-optic CDMA system given. The new code construction is based on Costas (1970) arrays and the codes are proved to be (/spl omega/(2p-3), /spl omega/, 1, 1), p a prime and /spl omega/*Q/spl les/p-1, where Q is the maximum number of users, OOCs. The probability of error (using the Gaussian approximation) in the multiuser system as a performance measure is calculated and compared with that of existing OOCs. The size of the code family is compared against the Johnson bound.>
Svetislav V. Maric, Mark D. Hahm, Edward L. Titlebaum
IEEE Trans. Commun.1
1993 A new family of optical code sequences for use in spread-spectrum fiber-optic local area networks
abstract
The problem of the algebraic construction of a particular family of optical codes for use in code-division multiple-access (CDMA) fiber-optic local area networks (LANs) is treated. The conditions that the code families have to satisfy when used in such systems are reviewed. The new codes are called quadratic congruence codes, and the construction of the corresponding sequences is based on the number-theoretic concept of quadratic congruences. It is shown that p-1 codes exist for every odd prime p and can serve as many as p-1 different users in the CDMA fiber-optic system. The codes belong to the family of optical orthogonal codes, their auto- and cross-correlation properties are established, and their performance is compared to that of the previous optical codes. Examples of the codes and examples of their auto- and cross-correlation functions are given.>
Svetislav V. Maric, Zoran Kostic, Edward L. Titlebaum
IEEE Trans. Commun.1
1992 A class of frequency hop codes with nearly ideal characteristics for use in multiple-access spread-spectrum communications and radar and sonar systems
abstract
The problem of constructing frequency hop codes for use in multiuser communication systems such as multiple-access spread-spectrum communications and multiuser radar and sonar systems is addressed. Previous frequency hopping techniques are reviewed. The construction of a new family of frequency hopping codes called hyperbolic frequency hop codes is given. The concepts of multiple-access spread-spectrum communication systems and multiuser radar and sonar systems are reviewed, and it is shown that the hyperbolic frequency hop codes possess nearly ideal characteristics for use in both types of system. Specifically, in multiple-access communications the codes achieve minimum error probability, while in radar and sonar systems the codes have at most two hits in their auto- and cross-ambiguity function. Examples of address assignment for multiple-access communications systems and radar and sonar auto- and cross-ambiguity functions are also given.>
Svetislav V. Maric, Edward L. Titlebaum
IEEE Trans. Commun.1
1990 Multiuser sonar properties for Costas array frequency hop coded signals
abstract
The cross-ambiguity properties of Costas-array frequency-hop coded signals for use in wideband multiuser sonar systems are established. In order to prevent system crosstalk, cross-ambiguity function for the signals should be minimized. The conditions under which Costas arrays achieve the minimum value of their cross-ambiguity functions are provided. The upper bound on the maximum number of hits in the cross-ambiguity function for Welch-Costas arrays is given, and it is shown that the maximum number of hits depends on the form of the prime over which the arrays are constructed.>
Edward L. Titlebaum, Svetislav V. Maric
ICASSP2