Design of Digital Computers

Gschwind, Hans W.

doi:10.1007/978-3-662-38101-4

Cited by 31 publications

(5 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In other words, equivalent-circuit constructions can help to gain a deeper understanding of nanocomputing circuits, which operate on different principles than today's electronic devices. One can view field-coupled nanomagnets as a nanoscale reintroduction of the ferrite-ring magnetic computers [10][11][12], where the electric interconnection circuits (coils, rectifiers, etc.) are substituted by the magnetic stray field of the magnets.…”

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

Activity in field‐coupled nanomagnet arrays

Csaba¹,

Porod²,

Lugli³

et al. 2007

Circuit Theory & Apps

View full text Add to dashboard Cite

SUMMARYMagnetic-field coupling emerges as a new possibility for nanoscale device integration. This paper investigates power flow between field-coupled single-domain nanomagnets. Using an equivalent-circuit formulation, we demonstrate that nanomagnet circuits can perform power gain in an entirely magnetic way, i.e. they can direct power from an external magnetic pumping field into a magnetic signal path. It was recently shown that networks of coupled nanomagnets can realize Boolean logic operations. This, combined with our finding that they also are active devices, promises the possibility of building complex all-magnetic digital and analog circuits. We also outline an analogy between the operating principles of field-coupled nanomagnet circuits and previous work on magnetic amplifiers.

show abstract

Section: Discussionmentioning

confidence: 99%

“…On the macroscale, magnetic amplifiers [8,9] and ferrite-ring logic devices [10][11][12] operate by processing and propagating signals via the magnetic fields of ferromagnetic cores. Spin waves were recently suggested as media for novel logic devices and on-chip interconnections [13].…”

Section: Introductionmentioning

confidence: 99%

Activity in field‐coupled nanomagnet arrays

Csaba¹,

Porod²,

Lugli³

et al. 2007

Circuit Theory & Apps

View full text Add to dashboard Cite

show abstract

“…This is just c N in (22) for N = 2 n , for any combination of N elements which uses each row and column exactly once, e.g. a pandiagonal, or one of Mayoral's more general orthogonal complement square sums [9], but obviously never a row or column.…”

Section: Proof Of the Pandiagonality Non-magic Propertymentioning

confidence: 99%

A new class of pandiagonal squares

Loly¹,

Steeds²

2005

International Journal of Mathematical Education in Science and

View full text Add to dashboard Cite

An interesting class of purely pandiagonal, i.e. non-magic, whole number (integer) squares of orders (row/column dimension) of the powers of two which are related to Gray codes and square Karnaugh maps has been identi…ed. Treated as matrices these squares possess just two nonzero eigenvalues. The construction of these squares has been automated by writing Maple r code, which also performs tests on the results. A rather more trivial set of pandiagonal non-magic squares consisting of the monotonically ordered sequence of integers existing for all orders has also been found.

show abstract

“…Fiue24Repeetto f ntutos instruction, Il, using the so-called implied or implicit addressing [GsMc75] where the data to be loaded is contained in the memory location next to the one storing instruction IV i.e., the address of the operand is derived by implication. The edge from node R 2 to OUT represents the transfer of the address of the operand from the program counter (R 2 ), (which is incremented by I by this time and points to the word next to the one storing instruction Ii), to the main memory address register, and the edge from IN to R I represents the data transfer from the main memory to register R I .…”

Section: Letmentioning

confidence: 99%

“…It is labeled I because the stack pointer must be incremented only after the data is pushed so that it * fpoints to the location on the stack where next data can be pushed. * Figure 2.5(c) shows how to represent a register load instruction 13 using direct addressing [GsMc75]. As shown in 1 I -Load register R from the main memory using immediate addressing.…”

mentioning

confidence: 99%