Odd-even merging circuit, Computer Engineering

Assignment Help:

Odd-Even Merging Circuit

Let's firstly understand the idea of merging two sorted sequences using an odd-even merging circuit. The functioning of a merging circuit is as given below:

 1)  Let there be 2 sorted sequences A= (a1, a2, a3, a4......... am) and B= (b1, b2, b3, b4......... bm) that are needed to be merged. 

2)  With help of a merging circuit (m/2, m/2) merge the odd indexed numbers of two sub sequences it implies that (a1, a3, a5......... am-1) and (b1, b3, b5......... bm-1) and so resulting in sorted sequence (c1, c2, c3......... cm).

3) Afterwards, with the help of a merging circuit (m/2, m/2) merge the even indexed numbers of the two sub sequences it implies that (a2, a4, a6......... am) and (b2, b4, b6......... bm) and so resulting in sorted sequence (d1, d2, d3......... dm).

4)  The last output sequence O= (o1, o2, o3......... o2m) is attained in the given below manner: o1 = a1 and o2m = bm .In broad the formula is as following: o2i = min (ai+1, bi) and o2I+1 = max(ai+1,bi ) for i=1,2,3,4..........m-1. 

Now let's take an illustration for merging the 2 sorted sequences of length 4 it implies that A= (a1, a2, a3, a4) and B= (b1, b2, b3, b4). Assume numbers of sequence are A= (4, 6, 9, 10) And B= (2, 7, 8, 12). The circuit of merging the two provided sequences is explained in Figure.

1690_Odd-Even Merging Circuit.png

Figure: Merging Circuit


Related Discussions:- Odd-even merging circuit

Node at the highest level in the structure, Node at the highest level in th...

Node at the highest level in the structure is known as?? Root.

Explain the fundamentals of c programming, Explain the Fundamentals of C Pr...

Explain the Fundamentals of C Programming? The C is a general purpose structured programming language. The C was developed and first implemented by the Dennis Ritchie at Bell L

Explain in detail about operating system, Explain in detail about Operating...

Explain in detail about Operating Systems (OS) Operating system (OS) is a program which after being initially loaded into computer by a boot program, manages all the other appl

Data validation and data transfer, Data Validation condition: The following...

Data Validation condition: The following condition stated below must be met for a data to be valid as is shown in the figure 3a below. 1. The data on the SDA line must remain stabl

Explain that lost acknowledgement in packet retransmission, Explain that th...

Explain that the lost acknowledgement does not necessarily enforce retransmission of the packet . To guarantee reliable transfer, protocols utilize positive acknowledgement al

Explain non-pre-emptive algorithms, Explain non-pre-emptive algorithms?   ...

Explain non-pre-emptive algorithms?   Non preemptive algorithms: In this algorithm a job is provided to CPU for execution as long as the job is non-completed the CPU cannot

Polishing game, Byteland county is very famous for luminous jewels. Luminou...

Byteland county is very famous for luminous jewels. Luminous jewels are used in making beautiful necklaces. A necklace consists of various luminous jewels of particular colour. Nec

How reassembling of ip fragments is advantageous, Reassembling of IP fragme...

Reassembling of IP fragments at the ultimate destination is advantageous. Give reasons. Needing the ultimate destination to reassemble the fragments has two major advantages. F

What are the four necessary condition of deadlock prevention, What are the ...

What are the four necessary conditions of deadlock prevention? Four essential conditions for deadlock prevention are: 1.  Removing  the  mutual  exclusion  condition  implie

Write Your Message!

Captcha
Free Assignment Quote

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!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd