Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Implement a LFSR.cpp file that includes the header file below. Reference : http://bits.usc.edu/cs103/coursework/lfsr/ //Header File #ifndef LFSR_H #define LFSR_H class LFSR { private: Queue q;

Implement a LFSR.cpp file that includes the header file below.

Reference : http://bits.usc.edu/cs103/coursework/lfsr/

//Header File

#ifndef LFSR_H #define LFSR_H

class LFSR { private: Queue q; // Queue object

int t1, t2; // Tap index values - two integers (peek offsets from front of queue)

bool XOR(int a, int b); // XOR(...) // Exclusive OR function // a | b | a XOR b // ---------------- // 0 | 0 | 0 // 0 | 1 | 1 // 1 | 0 | 1 // 1 | 1 | 0

public: LFSR(string seed, int tap1, int tap2); // LFSR(...) // Initializes t1 and t2 to tap1 and tap2, respectively // and parses seed string to loading queue with starting values void NextState(); // NextState() // Iterator method computes and queues next pseudo-random number in sequence // Algorithm // (1) temp = Peek(tap1) XOR Peek(tap2) // (2) Dequeue // (3) Enqueue(temp)

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image_2

Step: 3

blur-text-image_3

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Repairing And Querying Databases Under Aggregate Constraints

Authors: Sergio Flesca ,Filippo Furfaro ,Francesco Parisi

2011th Edition

146141640X, 978-1461416401

More Books

Students also viewed these Databases questions