Results 101 to 110 of about 2,854 (228)

An EMG Keyboard for Forearm Amputees

Applied Bionics and Biomechanics, 2003
A high-efficiency, easy-to-use input device is not only important for data entry but also for human-computer interaction. To date, there has been little research on input devices with many degrees of freedom (DOF) that can be used by the handicapped ...
Wenwei Yu, Ryu Kato, Fukuda Fabio, Hiroshi Yokoi, Yukinori Kakazu   +4 more
doaj   +1 more source

KOMPRESI GAMBAR MENGGUNAKAN ALGORITMA HUFFMAN

, 2003
Compressing an image consists of transform and quantization process, having the character of lossy and lossless. The compression can be undertaken by discrete cosine transform (DCT), quantization, Run Length Encoding (RLE) and
Julianti, Dian
core  

Analisis Perbandingan Algoritma Tunstall Code dan Adaptive Huffman Coding pada Pengkompresian File

, 2020
Ukuran dari sebuah data merupakan permasalahan yang sangat penting dalam proses pertukanan file. File terbagi atas file teks, gambar, video, dan audio. Tiap file memerlukan ruang penyimpanan agar dapat disimpan dan diakses dalam sebuah perangkat.
Nasution, Hanafi Azhari
core  

Combined Coding And Modulation Employing Multi Phase Shift Keying Modulation, Huffman Codes And Array Codes

, 2016
In this paper a technique for combining Huffman code, array code and phase modulation is proposed with a  view to reduce redundancy, provide error control and simultaneously optimise on channel bandwidth.
Soyjaudah, KMS, Hosany, MA
core   +1 more source

Pembuatan Program Kompresi dengan Metode Huffman Coding

, 2012
A common compression method is Huffman coding. This method replace data component with a code called Huffman code. The code found from binary tree traversal. The code is stored in file as harder of life.
Tjhe, Jap Wie
core  

Optimizing 4-ary Huffman Trees and Normalizing Binary Code Structures to Minimize Redundancy and Level Reduction

Since the present data expansion and increase are occurring at an increasingly rapid pace, the solution of adding storage space is not sustainable in the long run.
Hidayat, Tonny, Kuswanto, Jeki, Kurniawan , Hendra, Mustopa , Ali   +3 more
core   +2 more sources

Maximal codeword lengths in Huffman codes

, 2000
In this paper, we consider the following question about Huffman coding, which is an important technique for compressing data from a discrete source. If p is the smallest source probability, how long, in terms of p, can the longest Huffman codeword be? We
Abu-Mostafa, Y. S., Abu-Mostafa, Y.S., McEliece, R. J., McEliece, R.J.   +3 more
core   +1 more source

Joint Source-Channel Coding Using Variable-Length Error-Correcting Codes

Journal of Engineering and Sustainable Development, 2010
This paper explores the performance of both source coding and error-correction in a single coding step. Such joint source-channel coding is done here using codewords of varying lengths that have particular distance properties with each other, which ...
Maher K. M. AlAzawi, Suha Kassim Hadi
doaj  

Kompresi data denan algoritma huffman [PDF]

, 2003
Kompresi data adalah sebuah cara untuk memperkecil ukuran data sehingga dapat mempersingkat waktu pengiriman serta untuk menghemat penggunaan media penyimpanan. Kompresi data dapat dilakukan dengan berbagai macam aigoritma.
Kurniawan , Nanang
core  

Tradeoff Between Speed and Memory Requirements for Decoding of Prefix-Free Codes

Algorithms
For the decoding of prefix-free codes such as Huffman code, we present a tradeoff between the decoding speed and memory requirements that results in an adapted decoding algorithm.
Jörg Keller, Christina Kahle
doaj   +1 more source