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.

Roberto Padovani

dblp:94/5705 · DBLP profile ↗
← Back
11ranked-venue papers
4as first author
0since 2021 · last 2020
—ORCID · none

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

Computer networks · 6 · 2 first-authorSystems, architecture and hardware · 1Theory of computation · 1 · 1 first-authorApplied, 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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Storage systems · 100%
Computer networks
3 papers
Physical-layer communications · 81% Vehicular, aerial and satellite networks · 19%

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

TopicWeightPapersLastEvidence papers
Storage systems
distributed storage
0.412019
Liquid Cloud Storage · ACM Trans. Storage 2019
Storage systems › storage reliability
erasure coding
0.412019
Liquid Cloud Storage · ACM Trans. Storage 2019
Storage systems
storage reliability
0.412019
Liquid Cloud Storage · ACM Trans. Storage 2019
Storage systems
object storage
0.112019
Liquid Cloud Storage · ACM Trans. Storage 2019
Physical-layer communications › multiple access › CDMA systems
CDMA capacity
0.011990
Increased Capacity Using CDMA for Mobile Satellite Communication · IEEE J. Sel. Areas Commun. 1990
Vehicular, aerial and satellite networks
mobile satellite communications
0.011990
Increased Capacity Using CDMA for Mobile Satellite Communication · IEEE J. Sel. Areas Commun. 1990
Physical-layer communications
multiple access
0.011990
Increased Capacity Using CDMA for Mobile Satellite Communication · IEEE J. Sel. Areas Commun. 1990
Physical-layer communications
spread spectrum and CDMA
0.011990
Increased Capacity Using CDMA for Mobile Satellite Communication · IEEE J. Sel. Areas Commun. 1990
Information theory › signal processing
spectral estimation
0.021984
Spectral Analysis of Digital Messages Through Finite-Memory Transformations · IEEE Trans. Commun. 1984
Spectral Analysis of Functions of Markov Chains with Applications · IEEE Trans. Commun. 1983
Physical-layer communications
modulation
0.011986
Coded Phase/Frequency Modulation · IEEE Trans. Commun. 1986
Physical-layer communications › modulation
quadrature frequency/phase modulation
0.011986
Coded Phase/Frequency Modulation · IEEE Trans. Commun. 1986
Coding theory › error-correcting codes
coded modulation
0.011986
Coded Phase/Frequency Modulation · IEEE Trans. Commun. 1986
Coding theory › error-correcting codes › coded modulation
trellis-coded modulation
0.011986
Coded Phase/Frequency Modulation · IEEE Trans. Commun. 1986
Information theory › communication channels › channel models › binary-input channel
binary symmetric channel
0.011984
Poor error correction codes are poor error detection codes · IEEE Trans. Inf. Theory 1984
Coding theory
channel coding
0.011984
Poor error correction codes are poor error detection codes · IEEE Trans. Inf. Theory 1984
Coding theory › error-correcting codes
error detection
0.011984
Poor error correction codes are poor error detection codes · IEEE Trans. Inf. Theory 1984
Coding theory › error-correcting codes › coding bounds › minimum distance bounds
gilbert-varshamov bound
0.011984
Poor error correction codes are poor error detection codes · IEEE Trans. Inf. Theory 1984
Coding theory › error-correcting codes › block codes
group codes
0.011984
Poor error correction codes are poor error detection codes · IEEE Trans. Inf. Theory 1984
Information theory › signal processing › spectral estimation
power spectral density
0.011984
Spectral Analysis of Digital Messages Through Finite-Memory Transformations · IEEE Trans. Commun. 1984
Coding theory › error-correcting codes › convolutional codes › convolutional code decoding
viterbi decoding
0.011986
Coded Phase/Frequency Modulation · IEEE Trans. Commun. 1986
Information theory › probability theory › stochastic processes › markov processes
markov chain models
0.011984
Spectral Analysis of Digital Messages Through Finite-Memory Transformations · IEEE Trans. Commun. 1984

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

lazy repair · 0.4large code · 0.4flow storage organization · 0.4viterbi decoding · 0.0trellis coding · 0.0field test · 0.0computer simulation · 0.0closed-form spectral formulas · 0.0recursive algorithm · 0.0matrix methods · 0.0coding bounds · 0.0asymptotic analysis · 0.0
YearPublicationVenuePosition
2020 Meeting the Requirements of Industrial Production with a Versatile Multi-Sensor Platform Based on 5G Communication
abstract
To face the requirements of current and future industry and to push the digitalization of factories, an international consortium in the project 5G-SMART develops a versatile multi-sensor platform communicating via 5G. To achieve an adaptable and flexible system, the embedded device is designed in a modular approach, consisting of a local processing core, integrable field sensors and a 5G modem. This paper covers the concept and design of the elaborated versatile multi-sensor platform and therewith presents a system that overcomes the limitations of current sensor systems and enables an interconnected real-time monitoring for production industry.
Sarah S. Schmitt, Praveen Mohanram, Roberto Padovani, Niels König, Sven Jung, Robert H. Schmitt
PIMRC3
2019 Liquid Cloud Storage
abstract
A liquid system provides durable object storage based on spreading redundantly generated data across a network of hundreds to thousands of potentially unreliable storage nodes. A liquid system uses a combination of a large code , lazy repair , and flow storage organization . We show that a liquid system can be operated to enable flexible and essentially optimal combinations of storage durability, storage overhead, repair bandwidth usage, and access performance.
Michael Luby, Roberto Padovani, Tom Richardson 0001, Lorenz Minder, Pooja Aggarwal
ACM Trans. Storage2
2007 Downlink Macro-Diversity in Cellular Networks
abstract
In this paper, we study the potential benefit of base-station (BS) cooperation for downlink transmission in a modified Wyner-type multicell model. Besides the dirty-paper-coding (DPC) precoder, we also analyze several linear precoding schemes, including co-phasing, zero-forcing (ZF) and MMSE precoders. For the nonfading case, analytical sum rate expression is obtained for each scheme. In networks of a large number N of cells, a high signal-to-noise-ratio (SNR) asymptotic gap is shown between the sum rate performances of DPC and ZF precoders. Moreover, the MMSE precoder sum rate expression in large networks indicates different behaviors of MMSE precoder in different SNR regimes: in the SNR > N2regime, it coincides with the ZF precoder, while, in the SNR2regime, it coincides with the co-phasing precoder. For the Rayleigh fading case, Monte-Carlo simulations demonstrate the effectiveness of linear precoding schemes with the proposed user selection criterion.
Sheng Jing, David Tse, Joseph B. Soriaga, Jilei Hou, John E. Smee, Roberto Padovani
ISIT6
2007 Application of Closed Loop Resource Allocation for High Data Rate Packet Transmission
abstract
High data rate (HDR) CDMA systems are designed for cellular data distribution networks with maximized overall throughput and quality of service (QoS). Both figures of merit rely critically on the adoption of highly performant medium access control (MAC) algorithms, which are the focus of this paper. In particular, the closed loop resource allocation (CLRA) MAC algorithm for the reverse link of an HDR system is described. CLRA entails different properties and advantages that make it attractive for application in HDR or similar mobile Internet networks. First of all, CLRA is a macro control loop with distributed intelligence stimulated by busy tones issued by the base stations to inform terminals about their current load. Rate allocation is performed at terminals, whereby fairness is ensured by a stochastic rate assignment algorithm based on data queue states, rate history, and minimum rate guarantee. Network stability is guaranteed by controlled ramping driven by base stations busy tones. Further, a specific feature is introduced to account also for possible effects on base stations which are not in the rake active set; this feature is identified as candidate set protection. Finally, power headroom margins are used to minimize the occurrence of outage events. The analytical characterization of this MAC algorithm is derived using Markov chain modeling, and the results confirm the CLRA robustness, fairness and efficiency. The proposed algorithm is applicable to the 1xEV-DO system standardized by 3GPP2 within the cdma2000 family.
Giovanni Emanuele Corazza, Stefano Cioni, Roberto Padovani
IEEE Trans. Wirel. Commun.3
2002 Reverse link capacity and coverage improvement for CDMA cellular systems using polarization and spatial diversity
abstract
This paper explores the benefits of increased diversity order using spatially separated, polarized antennas at the base station receiver of a CDMA cellular system. Field tests are conducted in real mobile wireless environments. A conventional dual diversity receiver is compared with one that implements four-way diversity combining using spatially separated cross-polarized antennas. Several measured quantities are logged at the base station receiver and the mobile transmitter during a packet data connection at fixed data rate. Existing published results that explore polarization diversity focus on correlation measurements between received signal polarization components. The emphasis of the present study is to quantify reverse link capacity and coverage improvements for a CDMA cellular network as a result of exploiting polarization as an additional source of diversity at the base station receiver.
Levent Aydin, Eduardo S. Esteves, Roberto Padovani
ICC3
1994 CDMA digital cellular: field test results
abstract
This paper presents results from field tests of the CDMA system developed by Qualcomm, Incorporated. The CDMA system, now EIA/TIA digital standard IS-95, has undergone extensive field tests since its early inception. The latest series of technical tests was conducted in San Diego, California by Qualcomm in cooperation with several cellular carriers and equipment manufacturers during the month of August 1993. The goals of the tests were to provide an accurate measure of the capacity of the system, to validate the standard with compliant equipment, and finally to aid service providers in understanding the tradeoff of system parameters as large CDMA cellular networks begin to be deployed.>
Roberto Padovani, Brian K. Butler, Robert Boesel
VTC1
1990 Increased Capacity Using CDMA for Mobile Satellite Communication
abstract
The performance of a spread-spectrum CDMA (code-division multiple access) system in a mobile satellite environment is analyzed. Comparisons to single-channel-per-carrier FDMA systems are presented which show that the CDMA approach provides greater capacity. Results from computer simulations, laboratory tests, and field tests of a prototype modem are also presented. The tests results show excellent performance of the modem in the mobile environment and also the feasibility of the spread-spectrum approach to satellite mobile communications.>
Klein S. Gilhousen, Irwin Mark Jacobs, Roberto Padovani, Lindsay A. Weaver Jr.
IEEE J. Sel. Areas Commun.3
1986 Coded Phase/Frequency Modulation
abstract
Channel coding combined with expanded signal sets has been shown [1] to improve error performance over uncoded modulation without expanding the bandwidth of the transmitted signals. In this paper, new coded modulation formats defined over an expanded set of signals varying both in phase and frequency are presented. The new schemes combine FSK and PSK modulation and make use of trellis coding and Viterbi decoding to improve error performance over uncoded modulation. The free Euclidean distance is calculated for several classes of codes, and upper bounds and simulation results are also presented for some simple codes. The spectral characteristics of the proposed coded modulation formats are evaluated and compared to conventional two-dimensional modulation formats. Differential encoding and various extensions of the basic scheme are also discussed.
Roberto Padovani, Jack K. Wolf
IEEE Trans. Commun.1
1984 Spectral Analysis of Digital Messages Through Finite-Memory Transformations
abstract
The spectral analysis is performed for the stochastic sequence\{b_{n}\} = \{h(a_{n}, a_{n-1},\cdots, a_{n-M+1})\}, where\{a_{n}\}is an independent identically distributed digital sequence andhis an arbitrary complex function. The computation of the spectrum is based on a general matrix method for the spectral analysis of memoryless functions of Markov chains. The approach employs a recursive algorithm, whose computational time and storage requirements are sufficiently small for the algorithm to be implemented on a modern general purpose computer, even for moderately high values of both the size of the source alphabet and the parameterM. The method is also extended to the case in which the input sequence\{a_{n}\}is a stationary finite Markov chain.
Roberto Padovani, Gianfranco L. Pierobon
IEEE Trans. Commun.1
1984 Poor error correction codes are poor error detection codes
abstract
We show that binary group codes that do not satisfy the asymptotic Varshamov-Gilbert bound have an undesirable characteristic when used as error detection codes for transmission over the binary symmetric channel.
Roberto Padovani, Jack K. Wolf
IEEE Trans. Inf. Theory1
1983 Spectral Analysis of Functions of Markov Chains with Applications
abstract
This paper deals with the spectral analysis of digital processes obtained through memoryless functions of stationary Markov chains. Under the assumption that the Markov chain is ergodic, not necessarily acyclic, closed form formulas are derived for both the discrete part (spectral lines) and the continuous part of the spectral density. The results are applied at the output of a finite state sequential machine driven by a stationary Markov chain, which represents a general model of several situations of engineering interest. Finally, the theory is used to evaluate the spectrum of encoded and modulated digital signals.
Gianfranco Bilardi, Roberto Padovani, Gianfranco L. Pierobon
IEEE Trans. Commun.2