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

Tomas Novosad

dblp:141/2797 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2003
—ORCID · none

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

Theory of computation · 1 · 1 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.

Theoretical computer science
1 paper
Information theory · 50% Coding theory · 50%

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

TopicWeightPapersLastEvidence papers
Information theory › network information theory › multiuser communication
code-division multiple access
0.011993
A new family of quadriphase sequences for CDMA · IEEE Trans. Inf. Theory 1993
Coding theory › sequences › sequence design › polyphase sequences
quaternary sequence
0.011993
A new family of quadriphase sequences for CDMA · IEEE Trans. Inf. Theory 1993
Coding theory › sequences
sequence design
0.011993
A new family of quadriphase sequences for CDMA · IEEE Trans. Inf. Theory 1993
Information theory › signal processing › modulation
spread spectrum
0.011993
A new family of quadriphase sequences for CDMA · IEEE Trans. Inf. Theory 1993

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

welch lower bound · 0.0correlation analysis · 0.0
YearPublicationVenuePosition
2003 Maximizing WCDMA network packet traffic performance: multi-parameter optimization by gradient descent minimization of a cost function
abstract
WCDMA networks have many parameters which determine their performance. Ensuring a desired quality of service means a proper choice of network and cell parameters. One approach to choosing these parameters automatically is to minimise a cost function with respect to these parameters. The minimum of the cost function corresponds to an optimal network performance. The choice of cost function, in the simplest ease can be some combination of key performance indicators (KPTs) of the network. Here a cost function is described which can be used to simultaneously optimize 5 network parameters, to maximize the uplink and downlink packet data traffic. A stochastic, second order gradient method is described that can be used to simultaneously perform the optimization of the cost function. The cost function and gradient algorithm are implemented on an advanced WCDMA radio network simulator. Significant increases, in the packet throughput in a dynamically optimized scenario are found, relative to the same scenario with a typical but constant parameter set.
John A. Flanagan, Tomas Novosad
PIMRC2
2001 Verification of WCDMA radio network planning prediction methods with fully dynamic network simulator
abstract
The WCDMA based cellular systems offer variability of packet and circuit switched services and therefore are more complicated to plan and control than today's networks. For an operator, it is essential to utilise all possible resources to improve the capacity and quality of service of the radio network. To guarantee the optimum performance, the operator must have means to visualise the offered services and their quality in the radio network-planning phase. The proposed static prediction method is compared with dynamic analysis results. Based on this comparison it is demonstrated that the static prediction method is accurate enough for the radio network planning process. Example results of active set size, dominance and transmit power distributions from both simulators are presented.
Jaana Laiho, Achim Wacker, Tomas Novosad, Ari Hämäläinen
VTC Fall3
1993 A new family of quadriphase sequences for CDMA
abstract
The construction of a family of quadriphase sequences that are suitable for code-division multiple-access spread spectrum (CMA/SS) communication is described. For a given parameter n, where n=2(mod 4), the period of the sequence is 2/sup n/-1 chips. The set of sequences asymptotically achieves Welch's lower bound on simultaneous cross-correlation and autocorrelation magnitudes, all of them being bounded by a value 2/sup n/2/+1. The cardinality of this family of sequencies is 2/sup n/2/.>
Tomas Novosad
IEEE Trans. Inf. Theory1