Topology synthesis of the Multi-Tapped Meander Delay Line using Monte Carlo method

Pomarnacki, Raimondas; Gurskas, Antanas; Urbanavičius, Vytautas

doi:10.5755/j01.eee.18.8.2608

Use this URL to cite this publication: https://hdl.handle.net/20.500.14911/137534

Topology synthesis of the Multi-Tapped Meander Delay Line using Monte Carlo method

Details

Publication Type (CRIS)

Straipsnis Web of Science duomenų bazėje / Article in Web of Science database (S1a)

Publication Type (eLABa)

Straipsnis Web of Science DB / Web of Science DB article (S1)

Author(s)

Author	Affiliation
Pomarnacki, Raimondas	Elektroninių sistemų katedra / Department of Electronic Systems (0549)
Gurskas, Antanas	Elektroninių sistemų katedra / Department of Electronic Systems (0549)
Urbanavičius, Vytautas	Elektroninių sistemų katedra / Department of Electronic Systems (0549)

Title

Topology synthesis of the Multi-Tapped Meander Delay Line using Monte Carlo method

[en]

R. Pomarnacki, A. Gurskas, V. Urbanavicius

Is part of

Elektronika ir elektrotechnika

Published In

Year	Volume	Issue	Start Page	End Page
2012	18	8	41	44

Publisher

Kaunas : KTU

Publisher (trusted)

KTU

Referenced in Database(s)(DBs)

Science Citation Index Expanded (Web of Science)

INSPEC

VINITI

Extent

p. 41-44

URI

URI	Access Rights
https://hdl.handle.net/20.500.14911/137534
https://doi.org/10.5755/j01.eee.18.8.2608	Viso teksto dokumentas (atviroji prieiga) / Full Text Document (Open Access)

DOI

10.5755/j01.eee.18.8.2608

Cited references

Science / Art Area

Technologijos mokslai / Technological sciences (T)

Field of Science / Art

Elektros ir elektronikos inžinerija / Electrical and electronic engineering (T001)

Keywords (en)

Abstract (en)

The algorithm for synthesis of the multi-tapped meander delay line (MTMDL) topology is proposed in this article. The algorithm is based on search of construction parameters of the MTMDL according to Monte Carlo method. Proposed algorithm was realized as software and tested on 14 nodes computer cluster. Experimental synthesis of lines has shown adequacy of the suggested algorithm. It has been shown that increasing number of nodes in the cluster, synthesis is executing faster and parallel part of the algorithm approaches to 90 percent of total algorithm. It is revealed that the maximal efficiency of the algorithm is achieved when the number of cluster nodes reaches the number of all issued synthesis processes.