Derivation of a low multiplicative complexity algorithm for multiplying hyperbolic octonions

Similar documents
1 Introduction to Modulo 7 Arithmetic

(2) If we multiplied a row of B by λ, then the value is also multiplied by λ(here lambda could be 0). namely

The Z transform techniques

APPLICATIONS OF THE LAPLACE-MELLIN INTEGRAL TRANSFORM TO DIFFERNTIAL EQUATIONS

Math 61 : Discrete Structures Final Exam Instructor: Ciprian Manolescu. You have 180 minutes.

Weighted graphs -- reminder. Data Structures LECTURE 15. Shortest paths algorithms. Example: weighted graph. Two basic properties of shortest paths

12. Traffic engineering

Similarity Search. The Binary Branch Distance. Nikolaus Augsten.

Jonathan Turner Exam 2-10/28/03

b. How many ternary words of length 23 with eight 0 s, nine 1 s and six 2 s?

CSE 373: AVL trees. Warmup: Warmup. Interlude: Exploring the balance invariant. AVL Trees: Invariants. AVL tree invariants review

ECE COMBINATIONAL BUILDING BLOCKS - INVEST 13 DECODERS AND ENCODERS

Module graph.py. 1 Introduction. 2 Graph basics. 3 Module graph.py. 3.1 Objects. CS 231 Naomi Nishimura

HIGHER ORDER DIFFERENTIAL EQUATIONS

S i m p l i f y i n g A l g e b r a SIMPLIFYING ALGEBRA.

Chapter 16. 1) is a particular point on the graph of the function. 1. y, where x y 1

Fundamental Algorithms for System Modeling, Analysis, and Optimization

COMP108 Algorithmic Foundations

CIVL 8/ D Boundary Value Problems - Rectangular Elements 1/7

, each of which is a tree, and whose roots r 1. , respectively, are children of r. Data Structures & File Management

CS September 2018

Binomials and Pascal s Triangle

Using the Printable Sticker Function. Using the Edit Screen. Computer. Tablet. ScanNCutCanvas

(a) v 1. v a. v i. v s. (b)

CS 541 Algorithms and Programs. Exam 2 Solutions. Jonathan Turner 11/8/01

Formal Concept Analysis

EE1000 Project 4 Digital Volt Meter

CSE303 - Introduction to the Theory of Computing Sample Solutions for Exercises on Finite Automata

Characteristics of beam-electron cloud interaction

A 4-state solution to the Firing Squad Synchronization Problem based on hybrid rule 60 and 102 cellular automata

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}

Why the Junction Tree Algorithm? The Junction Tree Algorithm. Clique Potential Representation. Overview. Chris Williams 1.

Tutorial 2 Euler Lagrange ( ) ( ) In one sentence: d dx

(1) Then we could wave our hands over this and it would become:

TOPIC 5: INTEGRATION

Instructions for Section 1

Garnir Polynomial and their Properties

# 1 ' 10 ' 100. Decimal point = 4 hundred. = 6 tens (or sixty) = 5 ones (or five) = 2 tenths. = 7 hundredths.

CBSE 2015 FOREIGN EXAMINATION

Page 1. Question 19.1b Electric Charge II Question 19.2a Conductors I. ConcepTest Clicker Questions Chapter 19. Physics, 4 th Edition James S.

Graph Isomorphism. Graphs - II. Cayley s Formula. Planar Graphs. Outline. Is K 5 planar? The number of labeled trees on n nodes is n n-2

OpenMx Matrices and Operators

QUESTIONS BEGIN HERE!

INTEGRALS. Chapter 7. d dx. 7.1 Overview Let d dx F (x) = f (x). Then, we write f ( x)

Algorithmic and NP-Completeness Aspects of a Total Lict Domination Number of a Graph

The Cost Optimal Solution of the Multi-Constrained Multicast Routing Problem

a b v a v b v c v = a d + bd +c d +ae r = p + a 0 s = r + b 0 4 ac + ad + bc + bd + e 5 = a + b = q 0 c + qc 0 + qc (a) s v (b)

DEVELOPING COMPUTER PROGRAM FOR COMPUTING EIGENPAIRS OF 2 2 MATRICES AND 3 3 UPPER TRIANGULAR MATRICES USING THE SIMPLE ALGORITHM

Constructive Geometric Constraint Solving

Last time: introduced our first computational model the DFA.

COMPLEXITY OF COUNTING PLANAR TILINGS BY TWO BARS

COHORT MBA. Exponential function. MATH review (part2) by Lucian Mitroiu. The LOG and EXP functions. Properties: e e. lim.

Outline. Binary Tree

a b c cat CAT A B C Aa Bb Cc cat cat Lesson 1 (Part 1) Verbal lesson: Capital Letters Make The Same Sound Lesson 1 (Part 1) continued...

1 Finite Automata and Regular Expressions

Walk Like a Mathematician Learning Task:

Seven-Segment Display Driver

UNCORRECTED SAMPLE PAGES 4-1. Naming fractions KEY IDEAS. 1 Each shape represents ONE whole. a i ii. b i ii

CS 461, Lecture 17. Today s Outline. Example Run

Planar Upward Drawings

CSC Design and Analysis of Algorithms. Example: Change-Making Problem

Winter 2016 COMP-250: Introduction to Computer Science. Lecture 23, April 5, 2016

INFLUENCE OF ANTICLIMBING DEVICE ON THE VARIATION OF LOADS ON WHEELS IN DIESEL ELECTRIC 4000 HP

A Study of the Solutions of the Lotka Volterra. Prey Predator System Using Perturbation. Technique

CSE 373: More on graphs; DFS and BFS. Michael Lee Wednesday, Feb 14, 2018

Section 3: Antiderivatives of Formulas

Integration Continued. Integration by Parts Solving Definite Integrals: Area Under a Curve Improper Integrals

Linear Algebra Introduction

Library Support. Netlist Conditioning. Observe Point Assessment. Vector Generation/Simulation. Vector Compression. Vector Writing

Minimum Spanning Trees

Exam 1 Solution. CS 542 Advanced Data Structures and Algorithms 2/14/2013

Lecture contents. Bloch theorem k-vector Brillouin zone Almost free-electron model Bands Effective mass Holes. NNSE 508 EM Lecture #9

More Foundations. Undirected Graphs. Degree. A Theorem. Graphs, Products, & Relations

STRIPLINES. A stripline is a planar type transmission line which is well suited for microwave integrated circuitry and photolithographic fabrication.

Designing A Concrete Arch Bridge

A Simple Code Generator. Code generation Algorithm. Register and Address Descriptors. Example 3/31/2008. Code Generation

A general N-dimensional vector consists of N values. They can be arranged as a column or a row and can be real or complex.

Paths. Connectivity. Euler and Hamilton Paths. Planar graphs.

Matrices SCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics (c) 1. Definition of a Matrix

( ) Geometric Operations and Morphing. Geometric Transformation. Forward v.s. Inverse Mapping. I (x,y ) Image Processing - Lesson 4 IDC-CG 1

Polygons POLYGONS.

On Gaussian Distribution

Engineering Differential Equations Practice Final Exam Solutions Fall 2011

The Plan. Honey, I Shrunk the Data. Why Compress. Data Compression Concepts. Braille Example. Braille. x y xˆ

MASTER CLASS PROGRAM UNIT 4 SPECIALIST MATHEMATICS SEMESTER TWO 2014 WEEK 11 WRITTEN EXAMINATION 1 SOLUTIONS

10/30/12. Today. CS/ENGRD 2110 Object- Oriented Programming and Data Structures Fall 2012 Doug James. DFS algorithm. Reachability Algorithms

Section 10.4 Connectivity (up to paths and isomorphism, not including)

16.unified Introduction to Computers and Programming. SOLUTIONS to Examination 4/30/04 9:05am - 10:00am

INTRODUCTION TO AUTOMATIC CONTROLS INDEX LAPLACE TRANSFORMS

Decimals DECIMALS.

Module 2 Motion Instructions

Solutions for HW11. Exercise 34. (a) Use the recurrence relation t(g) = t(g e) + t(g/e) to count the number of spanning trees of v 1

The Shortest Path Problem Graph Algorithms - 3

A Low Noise and Reliable CMOS I/O Buffer for Mixed Low Voltage Applications

minimize c'x subject to subject to subject to

12/3/12. Outline. Part 10. Graphs. Circuits. Euler paths/circuits. Euler s bridge problem (Bridges of Konigsberg Problem)

COMSACO INC. NORFOLK, VA 23502

5/9/13. Part 10. Graphs. Outline. Circuits. Introduction Terminology Implementing Graphs

ECE 407 Computer Aided Design for Electronic Systems. Circuit Modeling and Basic Graph Concepts/Algorithms. Instructor: Maria K. Michael.

Transcription:

rivtion of low multiplitiv omplit lgorithm for multipling hproli otonion lkndr Criow Glin Criow Jrołw Knpińki ult of Computr Sin nd nformtion Thnologi Żołnirk - Szzin olnd {triov gtriov jknpinki}@wi.zut.du.pl tl. 9 9 trt. prnt n ffiint lgorithm to multipl two hproli ountrompl otonion. Th dirt multiplition of two hproli otonion rquir rl multiplition nd rl ddition. or fftiv olution till do not it. how how to omput produt of th hproli otonion with rl multiplition nd 9 rl ddition. uring nthi of th diud lgorithm w u th ft tht produt of two hproli otonion m rprntd mtri vtor produt. Th mtri multiplind tht prtiipt in th produt lulting h uniqu truturl proprti tht llow prforming it dvntgou ftoriztion. Nml thi ftoriztion ld to ignifint rduing of th omputtionl omplit of hproli otonion multiplition. Kword: hproli otonion multiplition of hprompl numr ft lgorithm.. ntrodution Th dvlopmnt of thor nd prti of dt proing wll nit of olving mor nd mor ompl prolm of thortil nd pplid omputr in rquir uing dvnd mthmtil mthod nd formlim. t prnt hprompl numr [] r ing inrd pplition in vriou fild of digitl ignl nd img proing [-] omputr grphi nd mhin viion [ ] tlommunition [- ] nd in puli k rptogrph []. mong othr rithmtil oprtion in th hprompl lgr multiplition i th mot tim onuming on. Th ron for thi i u th uul multiplition of th numr rquir N N rl ddition nd N rl multiplition. t i to tht th inring of dimnion of hprnumr inr th omputtionl omplit of it multiplition. Thrfor rduing th omputtionl omplit of th multiplition of hprompl numr i n importnt thortil nd prtil tk. ffiint lgorithm for th multiplition of vriou hprompl numr lrd it [-]. No uh lgorithm for th multiplition of th hproli otonion hv n propod. n thi ppr n ffiint lgorithm for thi purpo i uggtd.. rliminr mrk hproli otonion n dfind follow [ ]: o ˆ whr { i } i... r rl numr r qutrnion imginr unit i ountrimginr unit nd th of hproli otonion r dfind follow: []. Th of hproli otonion hv multiplition rul in Tl :

Tl. ul for multiplition of hproli otonion um w wnt to omput th produt of two hproli otonion ˆ ˆ ˆ o o o : ˆ o ˆ o ˆ o Uing pn nd ppr mthod w n writ: ˆ o. Thn w hv: p. n tht th hoolook mthod of multiplition of two hproli otonion rquir rl multiplition nd rl ddition. n mtri nottion th ov rltion n writtn mor omptl : X Y whr Τ ]. [ X Τ ]. [ Y nd

Th dirt rliztion of rquir rl multiplition nd rl ddition too. hll prnt th lgorithm whih rdu rithmtil omplit to rl multiplition nd 9 rl ddition.. Snthi of rtionlizd lgorithm for multipling two hproli otonion t firt w multipl - th ith vnth nd ighth row of th mtri. Thn w intrhng th firt nd th fifth olumn of thi mtri nd ll th rulting mtri.. Thn w n writ X Y whr. Thi trnformtion i don in ordr to prnt modifid in thi mnnr mtri n lgri um of th lok-mmtri Toplitz-tp mtri nd om pr mtri i.. mtri ontining onl mll numr of nonzro lmnt. Now th mtri n rprntd n lgri um of mmtri Toplitz-tp mtri nd nothr mtri whih h mn zro lmnt :

Tking into ount propod dompoition th omputtionl produr for multiplition hproli otonion n rwrittn follow: X Σ Y whr ign dnot th dirt um of two mtri [] dig Σ. t i to tht h th following trutur:. t i il to vrif [-] tht th mtri with thi trutur n fftivl ftorizd: ] [

whr i th ordr dmrd mtri N i th ordr N idntit mtri nd ign dnot th Kronkr produt of two mtri rptivl []. Thn th omputtionl produr for multiplition of th hproli otonion t thi tp of th lgorithm dign n rprntd follow: X Σ Y whr. ig. how dt flow digrm of th rtionlizd lgorithm for omputtion of produt of hproli otonion. n thi ppr dt flow digrm r orintd from lft to right. Stright lin in th figur dnot th oprtion of dt trnfr. oint whr lin onvrg dnot ummtion. Th dhd lin indit th ign hng oprtion. dlirtl u th uul lin without rrow on purpo o not to luttr th pitur. Th rtngl indit th mtri vtor multiplition with th mtri inrid inid rtngl.

ig.. t flow digrm for rtionlizd hproli otonion multiplition lgorithm in ordn with th produr. Lt u now onidr th trutur of th mtri nd. irt w multipl - vr lmnt of th firt row of mtri nd ll th rulting mtri :. Th mtri n dompod n lgri um of mmtri Toplitz mtri nd nothr mtri whih h mn zro lmnt :

] [. Lt u rturn now to th trutur of th mtri. t to thn th mtri n lo rprntd n lgri um of mmtri Toplitz mtri nd nothr mtri whih h mn zro lmnt : C C C t i il to vrif [-] tht th mtri n ftorizd in th m w: ] [ C C

K C. L C Sutituting nd in w n writ: X Σ Σ Y 9 whr Σ. L K L K.

9

ig. how dt flow digrm of th rtionlizd lgorithm for multipling of two hproli otonion t th ond tg of nthi. Conidr now th mtri K nd L. n n th mtri lo hv "good" trutur lding to dr in th numr of rl multiplition during lultion of th hproli otonion produt. ] [ ] [ d d d d ] [ K f f f f ] [ L h g h g g h h g. ntrodu th following nottion: d d f f h g h g. nd. Uing th ov nottion nd omining prtil dompoition in ingl omputtionl produr w finll n writ following: X Σ Y whr.

ig. how dt flow digrm of th rtionlizd lgorithm for multipling of two hproli otonion t th finl tg of th lgorithm drivtion. Th irl in thi figur how th oprtion of multiplition vril or ontnt inrid inid irl. n tht th ordinr pproh to lultion of lmnt... } { k k rquir ddition. t i to tht th rltion for lultion of } { k ontin rptd lgri um. Thrfor th numr of ddition nr to lult th lmnt n rdud. So it i to vrif tht th lmnt } { k... k n lultd uing th following rtionlizd mtri vtor produr: S Τ ] [ S Τ ] [ dig.. ig. how dt flow digrm of th pro for lulting th vtor S lmnt.

K L ig.. t flow digrm for rtionlizd hproli otonion multiplition lgorithm in ordn with th produr 9.

ig.. t flow digrm for rtionlizd hproli otonion multiplition lgorithm in ordn with th produr.

ig.. t flow digrm driing th pro of lulting lmnt of th vtor S in ordn with th produr.. timtion of omputtionl omplit lult how mn rl multiplition luding multiplition powr of two nd rl ddition r rquird for rliztion of th propod lgorithm nd ompr it with th numr of oprtion rquird for dirt vlution of mtri-vtor produt in q.. Lt u look to th dt flow digrm in igur. t i to vrif tht ll th rl multiplition whih to prformd to omputing th produt of two hproli otonion r rlizd onl during multipling vtor of dt th qui-digonl mtri. t n rgud tht th multiplition of vtor th mtri rquir rl multiplition nd onl fw trivil multiplition th powr of two. ultiplition powr of two m implmntd uing onvntion rithmti hift oprtion whih hv impl rliztion nd hn m ngltd during omputtionl omplit timtion. So th numr of rl multiplition rquird uing th propod lgorithm i. Thu uing th propod lgorithm th numr of rl multiplition to lult th hproli otonion produt i ignifintl rdud. Now w lult th numr of ddition rquird in th implmnttion of th lgorithm. t i il to vrif tht th numr of rl ddition rquird uing our lgorithm i 9. Thrfor th totl numr of rithmti oprtion i till lightl l thn th totl numr of rithmti oprtion in th niv lgorithm.. Conluion n thi ppr w hv prntd n originl lgorithm tht llow u to omput th produt of two hproli otonion with rdud multiplitiv omplit. Th propod lgorithm v rl multiplition omprd to th hoolook lgorithm. Unfortuntl th numr of rl ddition in th propod lgorithm i omwht grtr thn in th dirt lgorithm ut th totl numr of rithmtil oprtion i till l. or pplition whr th ot of rl multiplition i grtr thn tht of rl ddition th nw lgorithm i gnrll mor ffiint thn dirt mthod.. frn. Kntor. nd Solodovnikov. prompl numr Springr-Vrlg Nw York. 99. ülow T. nd Sommr G. prompl ignl - novl tnion of th nlti ignl to th multidimnionl Trn. Sign. ro. vol. S-9 No. -.. lfmnn. On fmili of N -dimnionl hprompl lgr uitl for digitl ignl proing in ro. uropn Signl roing Conf. USCO lorn tl.

. lfmnn. Göklr. G. Sngwin S. J. nd ll T.. prompl lgr in digitl ignl proing: nfit nd rwk Tutoril. ro. US th uropn Signl roing Confrn USCO oznń olnd -.. Sngwin S. J. ihn N. L prompl nlti ignl: tnion of th nlti ignl onpt to ompl ignl ro. US th uropn Signl roing Confrn USCO oznń olnd -.. o C.. Sngwin S. J. nd ll T.. prompl orrltion thniqu for vtor img Trn. Signl roing vol. No 9-9.. Xi Sh. prompl Corrltion for ft ttion V : roding of th ntrntionl Confrn on hin Viion nd umn-mhin ntrf Computr Soit -.. Cldrnk. S. l-hhir N. nd iggvi S. Contrution nd nli of nw qutrnioni Sptim od for trnmit ntnn Communition in informtion nd tm vol. No. -. 9. lfior J.-C. nd k G. utrnioni ltti for p-tim oding roding of th nformtion Thor orkhop. ri rh - pril -.. Özgür rtuğ Communition ovr prompl Khlr nifold: pit of dul-polrizd multidimnionl-o hnnl. irl ronl Communition vol. No -.. lkin. Zkrolhoini. nd htn. TU: utrnionivrion of th NTUuli-K Crptotm Th SC nt'l Journl of nformtion Surit vol. No 9-. owll T.. Lfon J-C. Th omplit of th qutrnion produt T - -. 9. krov O. n lgorithm for th multiplition of two qutrnion Zh. Vhil. t. t. iz. vol. No. 9. imitrov V.S. Cooklv T.V. nd onvk.. On th multiplition of rdud iqutrnion nd pplition nfor. ro. Lttr vol. no -. 99. Ţriov. Ţriov G. pkt lgortmizn orgnizji ukłdu proorowgo do mnożni liz Cl. lktronik No -.. Criow. Criow G. lgorithm for multipling two otonion dioltroni nd Communition Stm. llrton r n. vol. No -.. Criow. Criow G. n lgorithm for ft multiplition of dnion nformtion roing Lttr.. Criow. Criow G. n lgorithm for multiplition of ir numr Journl of Thortil nd pplid Computr Sin vol. No. pp. -. 9. Criow. Criow G. n lgorithm for multiplition of trigintduonion Journl of Thortil nd pplid Computr Sin vol. No -.. Criow. Criow G. unifid pproh for dvloping rtionlizd lgorithm for hprompl numr multiplition ltri viw vol. 9 No -9.. Criow. Criow G. n lgorithm for ft multiplition of uli numr. dvn in pplid Clifford lgr vol. No -.. Crmod K. Cirulr nd hproli qutrnion otonion nd dnion ppl. th. Comput. -. 9. Tnihli. Knu.. mir S. nw pproh to Lorntz invrin in ltromgntim with hproli otonion Th uropn hil Journl lu :9 -.. St -. rd Y. tri Clulu nd Kronkr rodut: rtil pproh to Linr nd ultilinr lgr orld Sintifi ulihing Compn; dition rh. Ţriov. Strtgi rjonlizji olizń prz wznzniu iloznów mirzowo-wktorowh. tod nformtki Stoownj No -.. Ţriov А. lgortmizn pkt rjonlizji olizń w frowm prztwrzniu gnłów dwnitwo Zhodniopomorkigo Uniwrttu Thnologizngo.. Criow. Strtgi for th nthi of ft lgorithm for th omputtion of th mtri-vtor produt Journl of Signl roing Thor nd pplition vol. No. -9.