Fast two-pick n2n round-robin arbiter circuit

Name: Fast two-pick n2n round-robin arbiter circuit
Author: Uğurdağ, Hasan Fatih, Temizkan, Fatih, Baskirt, O., Yuce, B.

İsim	Fast two-pick n2n round-robin arbiter circuit
Yazar	Uğurdağ, Hasan Fatih, Temizkan, Fatih, Baskirt, O., Yuce, B.
Basım Tarihi:	2012-06
Basım Yeri	- IEEE
Konu	Asynchronous circuits, Logic design
Tür	Süreli Yayın
Dil	İngilizce
Dijital	Evet
Yazma	Hayır
Kütüphane:	Özyeğin Üniversitesi
Demirbaş Numarası	0013-5194
Kayıt Numarası	4119adeb-1d44-4047-9238-31f522dbc8a6
Lokasyon	Electrical & Electronics Engineering
Tarih	2012-06
Notlar	Due to copyright restrictions, the access to the full text of this article is only available via subscription.
Örnek Metin	A regular (one-pick) round-robin arbiter circuit picks one active requester (if any) out of n requesters. A two-pick round-robin arbiter selects up to two requesters. An n2n two-pick round-robin arbiter indicates the picked requests with (at most) two-hot n-bit output. A round-robin arbiter is fair to its requesters and does this by repeatedly moving its highest priority pointer to the position immediately next to the second requester picked. Presented is the circuit architecture and VLSI implementation of a new scalable two-pick round-robin arbiter with low latency, which is compared with previous work based on logic synthesis results.
DOI	10.1049/el.2012.0307
Cilt	48

Kaynağa git Özyeğin Üniversitesi

Aramaya Dön

Özyeğin Üniversitesi

Kaynağa git

Fast two-pick n2n round-robin arbiter circuit

Yazar Uğurdağ, Hasan Fatih, Temizkan, Fatih, Baskirt, O., Yuce, B.

Basım Tarihi 2012-06

Basım Yeri - IEEE

Konu Asynchronous circuits, Logic design

Tür Süreli Yayın

Dil İngilizce

Dijital Evet

Yazma Hayır

Kütüphane Özyeğin Üniversitesi

Demirbaş Numarası 0013-5194

Kayıt Numarası 4119adeb-1d44-4047-9238-31f522dbc8a6

Lokasyon Electrical & Electronics Engineering

Tarih 2012-06

Notlar Due to copyright restrictions, the access to the full text of this article is only available via subscription.

Örnek Metin A regular (one-pick) round-robin arbiter circuit picks one active requester (if any) out of n requesters. A two-pick round-robin arbiter selects up to two requesters. An n2n two-pick round-robin arbiter indicates the picked requests with (at most) two-hot n-bit output. A round-robin arbiter is fair to its requesters and does this by repeatedly moving its highest priority pointer to the position immediately next to the second requester picked. Presented is the circuit architecture and VLSI implementation of a new scalable two-pick round-robin arbiter with low latency, which is compared with previous work based on logic synthesis results.

DOI 10.1049/el.2012.0307

Cilt 48