10,319 research outputs found
Cycle time optimization by timing driven placement with simultaneous netlist transformations
We present new concepts to integrate logic synthesis and physical design. Our methodology uses general Boolean transformations as known from technology-independent synthesis, and a recursive bi-partitioning placement algorithm. In each partitioning step, the precision of the layout data increases. This allows effective guidance of the logic synthesis operations for cycle time optimization. An additional advantage of our approach is that no complicated layout corrections are needed when the netlist is changed
How Does Our Visual System Achieve Shift and Size Invariance?
The question of shift and size invariance in the primate
visual system is discussed. After a short review of the relevant neurobiology and psychophysics, a more detailed analysis of computational models is given. The two main types of networks considered are the dynamic routing circuit model and invariant feature networks, such as the neocognitron. Some specific open questions in context of these models are raised and possible solutions discussed
Optimization in Telecommunication Networks
Network design and network synthesis have been the classical optimization problems intelecommunication for a long time. In the recent past, there have been many technologicaldevelopments such as digitization of information, optical networks, internet, and wirelessnetworks. These developments have led to a series of new optimization problems. Thismanuscript gives an overview of the developments in solving both classical and moderntelecom optimization problems.We start with a short historical overview of the technological developments. Then,the classical (still actual) network design and synthesis problems are described with anemphasis on the latest developments on modelling and solving them. Classical results suchas Menger’s disjoint paths theorem, and Ford-Fulkerson’s max-flow-min-cut theorem, butalso Gomory-Hu trees and the Okamura-Seymour cut-condition, will be related to themodels described. Finally, we describe recent optimization problems such as routing andwavelength assignment, and grooming in optical networks.operations research and management science;
Architectures for a quantum random access memory
A random access memory, or RAM, is a device that, when interrogated, returns
the content of a memory location in a memory array. A quantum RAM, or qRAM,
allows one to access superpositions of memory sites, which may contain either
quantum or classical information. RAMs and qRAMs with n-bit addresses can
access 2^n memory sites. Any design for a RAM or qRAM then requires O(2^n)
two-bit logic gates. At first sight this requirement might seem to make large
scale quantum versions of such devices impractical, due to the difficulty of
constructing and operating coherent devices with large numbers of quantum logic
gates. Here we analyze two different RAM architectures (the conventional fanout
and the "bucket brigade") and propose some proof-of-principle implementations
which show that in principle only O(n) two-qubit physical interactions need
take place during each qRAM call. That is, although a qRAM needs O(2^n) quantum
logic gates, only O(n) need to be activated during a memory call. The resulting
decrease in resources could give rise to the construction of large qRAMs that
could operate without the need for extensive quantum error correction.Comment: 10 pages, 7 figures. Updated version includes the answers to the
Refere
Quantum network coding for quantum repeaters
This paper considers quantum network coding, which is a recent technique that
enables quantum information to be sent on complex networks at higher rates than
by using straightforward routing strategies. Kobayashi et al. have recently
showed the potential of this technique by demonstrating how any classical
network coding protocol gives rise to a quantum network coding protocol. They
nevertheless primarily focused on an abstract model, in which quantum resource
such as quantum registers can be freely introduced at each node. In this work,
we present a protocol for quantum network coding under weaker (and more
practical) assumptions: our new protocol works even for quantum networks where
adjacent nodes initially share one EPR-pair but cannot add any quantum
registers or send any quantum information. A typically example of networks
satisfying this assumption is {\emph{quantum repeater networks}}, which are
promising candidates for the implementation of large scale quantum networks.
Our results thus show, for the first time, that quantum network coding
techniques can increase the transmission rate in such quantum networks as well.Comment: 9 pages, 11figure
OPTIMAL AREA AND PERFORMANCE MAPPING OF K-LUT BASED FPGAS
FPGA circuits are increasingly used in many fields: for rapid prototyping of new products (including fast ASIC implementation), for logic emulation, for producing a small number of a device, or if a device should be reconfigurable in use (reconfigurable computing). Determining if an arbitrary, given wide, function can be implemented by a programmable logic block, unfortunately, it is generally, a very difficult problem. This problem is called the Boolean matching problem. This paper introduces a new implemented algorithm able to map, both for area and performance, combinational networks using k-LUT based FPGAs.k-LUT based FPGAs, combinational circuits, performance-driven mapping.
A Robust Quantum Random Access Memory
A "bucket brigade" architecture for a quantum random memory of memory
cells needs times of quantum manipulation on control circuit nodes
per memory call. Here we propose a scheme, in which only average times
manipulation is required to accomplish a memory call. This scheme may
significantly decrease the time spent on a memory call and the average overall
error rate per memory call. A physical implementation scheme for storing an
arbitrary state in a selected memory cell followed by reading it out is
discussed.Comment: 5 pages, 3 figure
- …