A complex number consists of a real and imaginary component and is usually written in the form  where  and  are either integer or floating-point values and  (the imaginary value) . Sometimes in engineering, the letter  is used in place of  because  is used for other values.

Vector Processors and Data Level Parallelism

 

 

 

Introduction

 

A complex number consists of a real and imaginary component and is usually written in the form  where  and  are either integer or floating-point values and  (the imaginary value) . Sometimes in engineering, the letter  is used in place of  because  is used for other values.

 

Multiplying two complex numbers is done by applying the FOIL (Firsts, Outers, Inners and Lasts) method, similar to that of binomial multiplication.  For example, multiplying (a + bi)(c + di) is accomplished as follows:

 

Firsts:        a * c

Outers:      a * di

Inners:      bi * c

Lasts:        bi * di

 

This produces (a+bi)(c+di) = ac + adi + bci + bdi2. The terms are combined to produce the product back in the form a + bi. Keep in mind that i2 = -1.

 

An example using actual values:  (2.5 + 3i)(4.0 + 2i)

 

Firsts:        2.5 * 4.0

Outers:      2.5 * 2i

Inners:      3i * 4.0

Lasts:        3i * 2i

 

This produces 10 + 5i + 12i + 6i2 = 10 + 17i + 6(-1) = 4 + 17i.

 

Some contemporary programming languages natively support complex numbers (Python, MATLAB).  Newer revisions of some older languages (C, FORTRAN) have added support for complex numbers.  Some programming languages have no native support for complex numbers.

 

Assignment Definition

 

Consider the following high-level language code which multiplies two vectors that contain single-precision complex numbers:

 

 

 

 

 

Values a, b and c are vectors; _re is the real component element and _im is the imaginary component element in each vector.

 

  1. Convert this loop into pseudo RV64V assembly code using strip mining assuming the following architectural features:

 

Register s0 = loop counter & array index [i]

Vector registers:  v0 – v31

MVL (maximum vector length) = 64

Instructions:       vld (vector load)

vst (vector store)

vadd (vector add)

vsub (vector subtract)

vmul (vector multiply)

bne (branch if not equal)*

blt (branch if less than)*

j (unconditional jump)*

addi (integer add immediate)*

ori (logical or immediate)*

 

Note:  instructions with an asterisk indicate the instructions are used only for setting initial index value and increments, and for loop control.

 

  1. If the vector processor implements chaining with two lanes and has a single vector load/store unit, using the pseudo assembly code from question 1, show how convoys would be constructed to execute in the vector pipeline. How many chimes are required to execute the convoys?

 

  1. Assume in the vector processor, the functional units have the following startup overhead: load/store unit: 12 cycles, multiply unit: 7 cycles, and the add/subtract unit: 6 cycles.  How many clock cycles are required for each iteration of the loop, including startup overhead?

 

  1. How many iterations are required to complete processing the vectors?

Instruction Formats

 

vld (vector load):                         vld   vD, vec_ref

 

vst (vector store):                       vst   vD, vec_ref

 

vadd (vector add):                       vadd vD, vS1, vS2

 

vsub (vector subtract):                 vsub vD, vS1, vS2

 

vmul (vector multiply):                 vmul vD, vS1, vS2

 

bne (branch if not equal):             bne  x1, x2, target_label

 

blt (branch if less than):               blt  x1, x2, target_label

 

j (unconditional jump):                 j  target_label

 

addi (integer add immediate):       addi  xD, xS1, xS2

 

ori (logical or immediate):             ori  xD, xS1, const

 

 

Format Definitions

 

vD = destination vector register

vS1 = first source vector register

vS2 = second source vector register

vec_ref = vector reference (name)

x1 = first general purpose register for comparison

x2 = second general purpose register for comparison

xS1 = first source general purpose register

xS2 = second source general purpose register

target_label = label of the target instruction for branch

const = an integer constant

Calculate the price of your order

550 words
We'll send you the first draft for approval by September 11, 2018 at 10:52 AM
Total price:
$26
The price is based on these factors:
Academic level
Number of pages
Urgency
Basic features
  • Free title page and bibliography
  • Unlimited revisions
  • Plagiarism-free guarantee
  • Money-back guarantee
  • 24/7 support
On-demand options
  • Writer’s samples
  • Part-by-part delivery
  • Overnight delivery
  • Copies of used sources
  • Expert Proofreading
Paper format
  • 275 words per page
  • 12 pt Arial/Times New Roman
  • Double line spacing
  • Any citation style (APA, MLA, Chicago/Turabian, Harvard)

Our guarantees

Delivering a high-quality product at a reasonable price is not enough anymore.
That’s why we have developed 5 beneficial guarantees that will make your experience with our service enjoyable, easy, and safe.

Money-back guarantee

You have to be 100% sure of the quality of your product to give a money-back guarantee. This describes us perfectly. Make sure that this guarantee is totally transparent.

Read more

Zero-plagiarism guarantee

Each paper is composed from scratch, according to your instructions. It is then checked by our plagiarism-detection software. There is no gap where plagiarism could squeeze in.

Read more

Free-revision policy

Thanks to our free revisions, there is no way for you to be unsatisfied. We will work on your paper until you are completely happy with the result.

Read more

Privacy policy

Your email is safe, as we store it according to international data protection rules. Your bank details are secure, as we use only reliable payment systems.

Read more

Fair-cooperation guarantee

By sending us your money, you buy the service we provide. Check out our terms and conditions if you prefer business talks to be laid out in official language.

Read more
error: Content is protected !!