Design a cache for the huffman decoder

Assignment Help Computer Engineering

Reference no: EM131759813

Fundamentals of Computer Systems Project - Huffman Decoder with Cache

1. Specification

Your objective is to design a cache for the Huffman Decoder from P3. The tree is encoded exactly as in the previous assignment. The only change here is that the TREE ROM is now a SLOW TREE ROM. It accepts addresses via a latency insensitive channel and, ten cycles later, provides the corresponding data.

Interface The HUFFDEC module has four latency insensitive interfaces:

X is one bit wide and streams encoded bits from the test harness to HUFFDEC,
CHAR is 8 bits wide and streams decoded characters out of HUFFDEC to the test harness,
ADDR is 8 bits wide and streams addresses from HUFFDEC to SLOW TREE ROM,
DATA is 17 bits wide and streams read data from SLOW TREE ROM to HUFFDEC.

Baseline Design The baseline design is provided in the scaffolding. It functions with the SLOW TREE ROM, but makes no attempts at caching the data extracted from the slow memory.

2. Test Harness

The test harness is identical to that of P5, except that latency mode has been removed. Note the original interface to HUFFDEC. Your submission must match this exactly.

3. Workloads

Huffman codes are based on character frequency, using short codewords for frequent characters and longer codewords for infrequent characters. The trees we will use are not laid out in memory with any eye towards locality. Each workload consists of a tree and set of characters, with the characters following a uniform random distribution. The workload provided in the scaffolding includes the same tree as in P3 and a sequence of 100 characters to decode.

Attachment:- Assignment File.rar

Reference no: EM131759813

Questions Cloud

Determine the optimal two-part pricing strategy : You are the manager of a monopoly. A typical consumer's inverse demand function for your product is P =220-40Q and your cost function is C(Q) = 20Q.

Desire to be death - run away from a life situation : Desire to be death - Run away from a life situation, which would be impossible for the perpetrator to handle

Indicate what type of price discrimination : Indicate what type of price discrimination are the firms applying in the following examples:

Consumer comes to experience satisfaction-dissatisfaction : Describe the process by which the consumer comes to experience satisfaction or dissatisfaction. Illustrate each result with an experience of your own.

Design a cache for the huffman decoder : CSEE 3827: Fundamentals of Computer Systems Project - Huffman Decoder with Cache. Your objective is to design a cache for the Huffman Decoder from P3

Confidence level for the population mean : If the population standard deviation s = 25, what is the required minimum sample size to construct a 95% confidence level for the population mean

Compute the uncollectible account expense : Compute the uncollectible account expense, and make the appropriate journal entry, for the current year assuming the uncollectible account expense.

Protect natural monopolies : Governments tend to create as well as protect natural monopolies when two or more firms cannot provide a good or service

Explain supporting evidence from the given film : Provide and explain supporting evidence from the film: dialogue, visual effects, plot, formal choices, action, etc. Consider the film a text.

Reviews

len1759813

12/11/2017 2:29:09 AM

Detailed Question: Assignment layout has been provided in Logisim and can email the given scaffolding. To be scored, your submission must: match the original name and appearance of HUFFDEC, use only builtin Memory compoents to hold state (no buiding your own flip-flops), not exceed 2048 bits of total state in HUFFDEC, halt without error (e.g., oscillations or undefined wire values), and be uploaded in a single circ file via courseworks.

len1759813

12/11/2017 2:29:04 AM

We will first perform a functional check. This will require decoding ten characters using the tree provided in the scaffolding. If a submission fails either of the following two tests, we will proceed no further, and it will receive a zero. Submissions that pass this check will be assessed for function and performance on sequences of 1000 characters. We compute an average speedup across five different input sets and trees. Each of these five tests will use a different Huffman code and tree. All values are measured in perf mode.

Write a Review

Required(*) Message

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

Submit Assignment

User Account

All Pages