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

Joseph H. Othmer

dblp:118/2939 · also Joe Othmer · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
0since 2021 · last 1999
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 2Systems, architecture and hardware · 1Computer networks · 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
2 papers
Embedded and real-time systems · 49% Parallel and multicore computing · 49% Integrated circuit design · 3%
Computer graphics and multimedia
1 paper
Image and video coding · 100%
Software engineering, system software, and programming languages
1 paper
Compilers and program optimization · 100%

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

TopicWeightPapersLastEvidence papers
Parallel and multicore computing
parallel programming runtimes
0.011999
Software Environment for a Multiprocessor DSP · DAC 1999
Compilers and program optimization
parallelizing compiler
0.011999
Software Environment for a Multiprocessor DSP · DAC 1999
Image and video coding › predictive coding
differential pulse code modulation
0.011987
VLSI Implementation of a DPCM Compression Algorithm for Digital TV · IEEE Trans. Commun. 1987
Image and video coding
predictive coding
0.011987
VLSI Implementation of a DPCM Compression Algorithm for Digital TV · IEEE Trans. Commun. 1987
Image and video coding
VLSI implementation
0.011987
VLSI Implementation of a DPCM Compression Algorithm for Digital TV · IEEE Trans. Commun. 1987

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

preemptive dynamic scheduling · 0.0TTL logic implementation · 0.0
YearPublicationVenuePosition
1999 Software Environment for a Multiprocessor DSP
abstract
In this paper, we describe the software environment for Daytona, a single-chip, bus-based, shared-memory, multiprocessor DSP.The software environment is designed around a layered architecture.Tools at the lower layer are designed to deliver maximum performance and include a compiler, debugger, simulator, and profiler.Tools at the higher layer focus on improving the programmability of the system and include a run-time kernel and parallelizing tools.The run-time kernel includes a low-overhead, preemptive, dynamic scheduler with multiprocessor support that guarantees real-time performance to admitted tasks.1.
Asawaree Kalavade, Joseph H. Othmer, Bryan D. Ackland, Kanwar Jit Singh
DAC2
1991 Digital HDTV compression using parallel motion-compensated transform coders
abstract
The authors suggest a parallel processing structure using the proposed international standard for visual telephony (CCITT P*64 kbs standard) as processing elements, to compress digital high definition television (HDTV) pictures. The basic idea is to partition an HDTV picture, in space or in frequency, into smaller sub-pictures and then compress each sub-picture using a CCITT P*64 kbs coder. This seems to be a cost-effective solution to the HDTV hardware. Since each sub-picture is processed by an independent coder, without coordination these coded sub-pictures may have unequal picture quality. To maintain a uniform quality HDTV picture, the following two issues are studied: sub-channel control strategy (bits allocated to each sub-picture); and quantization and buffer control strategy for individual sub-picture coders. Algorithms to resolve these problems and their computer simulations are presented.>
Hsueh-Ming Hang, Riccardo Leonardi, Barry G. Haskell, Robert L. Schmidt, Hemant Bheda, Joseph H. Othmer
IEEE Trans. Circuits Syst. Video Technol.6
1990 Digital HDTV compression at 44 Mbps using parallel motion-compensated transform coders
abstract
High Definition Television (HDTV) promises to offer wide-screen, much better quality pictures as compared to the today’s television. However, without compression a digital HDTV channel may cost up to one Gbits/sec transmission bandwidth. We suggest a parallel processing structure using the proposed international standard for visual telephony (CCITT Px64 kbs standard) as processing elements, to compress the digital HDTV pictures. The basic idea is to partition an HDTV picture into smaller sub-pictures and then compress each sub-picture using a CCITT Px64kbs coder, which is cost-effective, by today’s technology, only on small size pictures. Since each sub-picture is processed by an independent coder, without coordination these coded sub-pictures may have unequal picture quality. To maintain a uniform quality HDTV picture, the following two issues are studied: (l) sub-channel control strategy (bits allocated to each sub-picture), and (2) quantization and buffer control strategy for individual sub-picture coder. Algorithms to resolve the above problems and their computer simulations are presented.
Hsueh-Ming Hang, Riccardo Leonardi, Barry G. Haskell, Robert L. Schmidt, Hemant Bheda, Joseph H. Othmer
VCIP6
1987 VLSI Implementation of a DPCM Compression Algorithm for Digital TV
abstract
Future video services in the loop plant may be based on digital transmission through optical fibers. A small and inexpensive codec is required for a variety of services based on digital television. We have demonstrated a compression algorithm for transmission of NTSC color television over a DS3 channel (44.736 Mbits/s). This predictive coding algorithm has been implemented using circuits built with conventional TTL logic. The resulting picture is visually unimpaired, but may not have network quality. The major portion of the compression or reconstruction circuit has also been implemented in one CMOS VLSI chip. Compression is accomplished using this chip with two small ROM chips. Reconstruction is done with the same VLSI chip and one ROM chip.
R. Brainard, Joseph H. Othmer
IEEE Trans. Commun.2