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

Daniel Luthi

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

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

Systems, architecture and hardware · 1Computer networks · 1Graphics, computer vision, multimedia, augmented reality and games · 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
Physical-layer communications · 100%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications
synchronization
0.012000
Invariancies in punctured convolutional codes-their effect on Viterbi synchronization · IEEE Trans. Commun. 2000
Coding theory
channel coding
0.012000
Invariancies in punctured convolutional codes-their effect on Viterbi synchronization · IEEE Trans. Commun. 2000
Coding theory › error-correcting codes
convolutional codes
0.012000
Invariancies in punctured convolutional codes-their effect on Viterbi synchronization · IEEE Trans. Commun. 2000
Coding theory › error-correcting codes › convolutional codes
punctured convolutional codes
0.012000
Invariancies in punctured convolutional codes-their effect on Viterbi synchronization · IEEE Trans. Commun. 2000

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

invariance analysis · 0.1generator matrix decomposition · 0.1affine transformation · 0.1
YearPublicationVenuePosition
2000 Invariancies in punctured convolutional codes-their effect on Viterbi synchronization
abstract
This paper studies the invariance of a given punctured convolutional code to an affine class of symbol transformations known to commonly occur in digital transceiver systems. A set of conditions to test the invariance of a code to these transformations has been derived, followed by two proposed methods to compensate for an invariant transformation. The viability of these methods has been examined by doing an invariant factor decomposition on the equivalent code generator matrix (obtained from the original code generator matrix and the given transform). The knowledge of the transformation and the nature of its occurrence greatly determines which method of compensation could be used. This study has much use in not only enabling a code designer to evaluate the invariance of an affine transformation to a given code, but also on the other hand to make the appropriate choice of code generators, puncturing schemes, and bit-to-constellation symbol mapping; so as to allow a channel coding scheme to be either sensitive or invariant to a given transformation, depending upon design objectives.
Advait M. Mogre, Dariush Dabiri, Daniel Luthi
IEEE Trans. Commun.3
1992 A high-performance full-motion video compression chip set
abstract
A seven-chip set which performs the functions associated with video and image compression algorithms, and CCITT H.261 in particular, has been designed, fabricated, and is fully functional. The major functions performed by the devices include motion estimation, DCT and IDCT, forward and inverse quantization, Huffman coding and decoding, BCH error correction, and loop filtering. The chips that perform the predictive and transform coding section of the algorithm operate with pixel rates up to 40 MHz. Array-based technologies of 1.5 and 1.0 mu m CMOS were used extensively to achieve a 28 man-month design time. Each die is less than 10 mm on a side.>
Peter A. Ruetz, Po Tong, Douglas Bailey, Daniel Luthi, Peng H. Ang
IEEE Trans. Circuits Syst. Video Technol.4
1988 Design of a 20 MHz 64-tap transversal filter
abstract
The authors describe the architecture and design of a high-speed CMOS VLSI filter processor. The internal architecture of the design is pipelined to achieve a sustained 20-MHz data throughput rate. This translates into an effective computational rate of 1.2 billion multiplications (and a similar number of additions) per second. The chip is reconfigurable for one- and two-dimensional filtering, the total device count is 240000 transistors, and the die size is 1.4 cm*1.4 cm. Tap design, data-flow organization, and clock distribution are discussed.>
Chip C. Stearns, Daniel Luthi, Peter A. Ruetz, Peng H. Ang
ICCD2