Date of Award
Fall 2004
Document Type
Thesis
Degree Name
Master of Science (MS)
Department
Electrical & Computer Engineering
Program/Concentration
Electrical Engineering
Committee Director
James F. Leathrum, Jr.
Committee Member
Lee A. Belfore II
Committee Member
Min Song
Call Number for Print
Special Collections LD4331.E55 S56 2004
Abstract
Instructions are the building blocks of computer programs. They are composed of opcodes, which uniquely identify each instruction, and the operands or data. In most architectures, the instruction length is a set multiple of the word size. The size and number of operands vary by instruction. Due to programmer usage, program need, or compiler design, opcodes do not occur with a constant distribution. Likely, some opcodes occur very frequently, whereas others occur very infrequently or not at all. If the length of an opcode were representative of its frequency, compression in program size might be achieved.
This thesis is an attempt to perform Huffman compression of instructions with the goal of achieving reasonable opcode compression, without overcomplicating the architecture. The Motorola 68HCI I was used as a baseline for the design, but the same methods can be applied to like microcontrollers and embedded systems.
Rights
In Copyright. URI: http://rightsstatements.org/vocab/InC/1.0/ This Item is protected by copyright and/or related rights. You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s).
DOI
10.25777/gtt1-bg58
Recommended Citation
Shreve, Jason B..
"Huffman Approach to Opcode Compression"
(2004). Master of Science (MS), Thesis, Electrical & Computer Engineering, Old Dominion University, DOI: 10.25777/gtt1-bg58
https://digitalcommons.odu.edu/ece_etds/531
Included in
Computer Engineering Commons, Computer Sciences Commons, Electrical and Computer Engineering Commons