๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An efficient technique for detecting catastrophic convolutional codes

โœ Scribed by Y.Z. Boutros; G.P. Fiani; E.S. Looka

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
477 KB
Volume
46
Category
Article
ISSN
0013-7944

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An efficient decoding technique for Huff
An efficient decoding technique for Huffman codes
โœ Rezaul Alam Chowdhury; M. Kaykobad; Irwin King ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 56 KB

We present a new data structure for Huffman coding in which in addition to sending symbols in order of their appearance in the Huffman tree one needs to send codes of all circular leaf nodes (nodes with two adjacent external nodes), the number of which is always bounded above by half the number of s

An Efficient Randomized Algorithm for De
An Efficient Randomized Algorithm for Detecting Circles
โœ Teh-Chuan Chen; Kuo-Liang Chung ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 444 KB

Detecting circles from a digital image is very important in shape recognition. In this paper, an efficient randomized algorithm (RCD) for detecting circles is presented, which is not based on the Hough transform (HT). Instead of using an accumulator for saving the information of the related paramete

An efficient heuristic for code partitio
An efficient heuristic for code partitioning
โœ Moez Ayed; Jean-Luc Gaudiot ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 326 KB

In this paper, we propose a heuristic for code partitioning for distributed memory multiprocessors (DMMs). Our method is data-ยฏow based where all levels of parallelism can potentially be exploited. Given a weighted directed acyclic graph (DAG) representation of the program, our partitioning algorith