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

Juhani Oksman

dblp:95/4893 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
0since 2021 · last 1997
—ORCID · none

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

Computer networks · 2

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
1 paper
Coding theory · 100%
Computer networks
2 papers
Physical-layer communications · 42% Wireless networking · 33% Internet of things and sensor networks · 25%

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

TopicWeightPapersLastEvidence papers
Coding theory › sequences › sequence design › low-correlation sequence
GMW sequences
0.011997
On Algorithms Searching for Quasi-Optimal Subfamilies of GMW Sequences Suitable for CDMA Applications · INFOCOM 1997
Coding theory › sequences › sequence design
spreading sequences
0.011997
On Algorithms Searching for Quasi-Optimal Subfamilies of GMW Sequences Suitable for CDMA Applications · INFOCOM 1997
Physical-layer communications
code-division multiple access
0.021997
The Receiver and Transmitter Code Sensing Protocol and its Application in Distributed CDMA Networks · INFOCOM 1991
On Algorithms Searching for Quasi-Optimal Subfamilies of GMW Sequences Suitable for CDMA Applications · INFOCOM 1997
Internet of things and sensor networks › RFID systems
anti-collision protocol
0.011991
The Receiver and Transmitter Code Sensing Protocol and its Application in Distributed CDMA Networks · INFOCOM 1991
Wireless networking
medium access control
0.011991
The Receiver and Transmitter Code Sensing Protocol and its Application in Distributed CDMA Networks · INFOCOM 1991

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

peak-deleting algorithms · 0.0cross-correlation criterion · 0.0performance upper bound analysis · 0.0effective code utilization · 0.0
YearPublicationVenuePosition
1997 On Algorithms Searching for Quasi-Optimal Subfamilies of GMW Sequences Suitable for CDMA Applications
abstract
This paper studies several algorithms for constructing quasi-optimal GMW subfamilies in terms of minimized bit error rate under co-channel interference. The results show that performance of resultant sub-families is very sensitive to the algorithms applied and sub-family sizes. A new criterion based on combinational (even plus odd) maximum cross-correlation is introduced for code selection and the resultant highest-peak-deleting and most-peak-deleting algorithms are effective to construct the GMW quasi-optimal sub-families.
Xiao Hua Chen, Juhani Oksman
INFOCOM3
1996 Searching for quasi-optimal subfamilies of m-sequences for CDMA systems
abstract
This paper studies several algorithms for constructing quasi-optimal m-sequence subfamilies in terms of minimized BER under co-channel interference. The results show that the performance of resultant sub-families is sensitive to the sub-family sizes and the algorithms employed. A new criterion based on combinational (even plus odd) maximum cross-correlation for the code selection is introduced, based on which both highest-peak-deleting and most-peak-deleting algorithms are effective to construct the quasi-optimal subfamilies.
X. H. Chen, Juhani Oksman
PIMRC3
1996 Correlation statistics convolution algorithm for spreading code dependent BER and capacity analysis of finite asynchronous CDMA systems
abstract
Some CDMA systems serve a finite number of simultaneously active users. Thus, its performance is spreading code dependent and Gaussian approximation is not appropriate to evaluate its performance. To choose proper spreading codes for a finite CDMA system, both peak cross-correlation and squared-sum of cross-correlations should be considered. An algorithm based on multiple variable Bernoulli process is introduced to evaluate the BER due to co-channel interference. The algorithm is useful for spreading code dependent capacity analysis, regardless of the CDMA system size and operation. The results show that small Kasami and Gold (1968) like codes offer a high capacity in a finite CDMA system.
Xiao Hua Chen, Juhani Oksman
PIMRC3
1992 MSKRC quadrature-overlapped modulation and its performance analysis
abstract
A bandwidth efficient quadrature-overlapped modulation, MSK raised cosine (MSKRC) modulation, is introduced. Its power spectral density (PSD) is the product of PSDs of MSK and quadrature overlapping raised cosine (QORC) signals. The PSD main lobe of the MSKRC signal is the same as that of the MSK signal but the PSD sidelobes of the MSKRC signal diminish approximately as fast as 1/f/sup 10/, much faster than those of OQPSK, MSK and QORC signals (with 1/f/sup 2/, 1/f/sup 4/ and 1/f/sup 6/, respectively). The intersymbol interference (ISI) performance for the MSKRC modulation system is analyzed. The analysis reveals that the MSKRC signal produces a lower ISI level than other reported modulated signals.>
Xiao Hua Chen, Juhani Oksman
PIMRC2
1991 The Receiver and Transmitter Code Sensing Protocol and its Application in Distributed CDMA Networks
abstract
A new collision-avoiding protocol, the receiver-and-transmitter (R&T) code-sensing protocol, is formulated and its performance upper bounds are numerically analyzed. The results reveal that a high throughput and a stable performance of a distributed code-division multiple-access (CDMA) packet radio network can be achieved by broadcasting both transmitter and receiver codes into the shared CDMA channel to avoid possible packet conflicts. To measure the efficiency of the orthogonal codes used, the effective code utilization (ECU), defined as the ratio between the throughput and code consumption, is introduced and evaluated. The evaluation shows that the R&T code-sensing protocol has an ideal ECU.>
Xiao Hua Chen, Juhani Oksman
INFOCOM2