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

Ido Bettesh

dblp:265/2349 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 2006
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-authorTheory 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.

Computer networks
1 paper
Network optimization and economics · 67% Cellular and mobile networks · 33%
Theoretical computer science
1 paper
Information theory · 50% Mathematical optimization · 50%

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

TopicWeightPapersLastEvidence papers
Network optimization and economics › delay minimization
delay-optimal control
0.112006
Optimal Power and Rate Control for Minimal Average Delay: The Single-User Case · IEEE Trans. Inf. Theory 2006
Cellular and mobile networks › power control
power and rate control
0.112006
Optimal Power and Rate Control for Minimal Average Delay: The Single-User Case · IEEE Trans. Inf. Theory 2006
Network optimization and economics
resource allocation
0.112006
Optimal Power and Rate Control for Minimal Average Delay: The Single-User Case · IEEE Trans. Inf. Theory 2006
Information theory
channel capacity
0.012006
Optimal Power and Rate Control for Minimal Average Delay: The Single-User Case · IEEE Trans. Inf. Theory 2006
Mathematical optimization › continuous optimization › convex optimization
water-filling
0.012006
Optimal Power and Rate Control for Minimal Average Delay: The Single-User Case · IEEE Trans. Inf. Theory 2006

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

dynamic programming · 0.1asymptotic analysis · 0.1
YearPublicationVenuePosition
2006 Optimal Power and Rate Control for Minimal Average Delay: The Single-User Case
abstract
Contemporary wireless systems combine aspects of network theory such as scheduling, throughput, and delay as well as information theory aspects such as capacity, coding, and power control. Design of such systems requires joint optimization of both network and physical layers. In this paper, we analyze a single-user communication system composed of a transmitter preceded by a queue used for retransmissions, Gaussian block-fading channel, and a receiver. The system average delay is optimized by using combined power/rate control under average power constraints. Dynamic programming is used for calculating the optimized policies using numerical analysis as well as analytic analysis for asymptotically large buffer size. Asymptotic results are obtained for all combinations of fixed or variable power and rate controls. The most important result extends the "water-filling" result for systems with average delay constraint
Ido Bettesh, Shlomo Shamai
IEEE Trans. Inf. Theory1
1998 A low delay algorithm for the multiple access channel with Rayleigh fading
abstract
A new algorithm is proposed for the multiple access channel with flat Rayleigh fading in a single cell. It is assumed the fading values are known to both the receiver and transmitter. Unlike previous algorithms, this algorithm considers the throughput under constraints of outage and delay. This is done by combining the advantages of TDMA (low delay, small outage) with the advantages of the optimized throughput algorithm. In the proposed algorithm only one user transmits at any moment making successive decoding and/or rate splitting unnecessary. A single parameter controls the similarity of the algorithm to TDMA vs. the similarity to the optimized throughput algorithm. The algorithm's performance is a continuous function of the parameter i.e., if the algorithm is more TDMA like, its performance (throughput, delay, outage) are also similar to TDMA and vice versa.
Ido Bettesh, Shlomo Shamai
PIMRC1
1994 Wavelet coding using pruned trees and vector quantization
abstract
We present here a novel coding approach in the wavelet transform domain, based on a pruned tree structure of the transformed signal. The approach is based on the observation that on one hand a large portion of the wavelet transform samples may be nullified without significant loss of reconstruction quality, and on the other hand samples with relatively high energy tend to concentrate around local transients of the source signal. A pruned tree is built in which each node consists of a cluster of samples of the same scale which are centered at a local transient. The branches of the tree connect nodes of adjacent scales. The tree structure is coded by a simple binary code. A vector quantizer is used to code each node. Compression ratios of 1:25 on a gray-level images are achieved with good quality.
Ido Bettesh, I. Florentin
ICPR (3)1