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

Itzhak Gurantz

dblp:92/4352 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 1993
—ORCID · none

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

Computer networks · 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
1 paper
Coding theory · 100%
Computer networks
1 paper
Vehicular, aerial and satellite networks · 77% Routing and switching · 23%
Computer graphics and multimedia
1 paper
Image and video coding · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › decoding › soft-decision decoding
APP decoding
0.011993
On the Application of Approximate APP Decoding to Digital Video Transmission · IEEE J. Sel. Areas Commun. 1993
Coding theory › error-correcting codes
block codes
0.011993
On the Application of Approximate APP Decoding to Digital Video Transmission · IEEE J. Sel. Areas Commun. 1993
Coding theory › error-correcting codes › decoding
soft-decision decoding
0.011993
On the Application of Approximate APP Decoding to Digital Video Transmission · IEEE J. Sel. Areas Commun. 1993
Vehicular, aerial and satellite networks › satellite networks
satellite network architecture
0.011987
Crosslink architectures for a multiple satellite system · Proc. IEEE 1987
Routing and switching › packet switching
packet-switched networks
0.011987
Crosslink architectures for a multiple satellite system · Proc. IEEE 1987

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

weight function approximation · 0.0feedback decoding · 0.0
YearPublicationVenuePosition
1993 On the Application of Approximate APP Decoding to Digital Video Transmission
abstract
For transmitting compressed digital video, the authors propose using threshold decodable block codes with large block length, and a posteriori probability (APP) soft decision decoding. A new approximation of the weight function associated with APP soft decision decoding of threshold decodable codes is presented. When the number of components in the parity equations is large, the new method gives excellent error performance, whereas there is a substantial degradation in the performance of the least reliable symbol approximation presented by Tanaka et al. (1980) and others. The effect of feedback on the performance of the APP decoder is also analyzed. It is shown that if the performance criterion is word error rate rather than bit error rate, feedback of previously decoded bits is essential to obtain all possible coding gain from the soft decision decoder. Finally, the performance of the proposed coding scheme is compared to the performance of a concatenated coding system with the same rate.>
Sreenivasa A. Raghavan, Yoav Hebron, Itzhak Gurantz
IEEE J. Sel. Areas Commun.3
1987 Crosslink architectures for a multiple satellite system
abstract
Several candidate crosslink communications architectures are described for a packet-switched, low-altitude, multiple satellite system (MSS). One architecture represents a frequency-division approach, in which a cellular concept is combined with dynamic time-domain allocation within a cell. A second architecture uses an unsynchronized space-time division approach consisting of directional antennas and random accessing. A third architecture uses toroiclal antennas with unsynchronized random accessing. The recommended architecture uses a synchronized space-time division approach, consisting of directional antennas and contention-based pair-wise scheduling. This architecture, called PRS (Pseudo-random Scheduling) is found to have significantly reduced power and bandwidth requirements relative to the other approaches.
Richard Binder, Stephen D. Huffman, Itzhak Gurantz, Peter A. Vena
Proc. IEEE3