33420395
An Application-Specific Routing Protocol for Meshed Wireless Sensor Networks
16276152
Hardware/Software Co-Design Architecture for Lattice Decoding Algorithms
This paper presents hardware/software co-design architecture targeted on a single FPGA for two typical lattice decoding algorithms in MIMO system. Two levels of parallelisms are analyzed for an efficient implementation with the preprocessing part on embedded MicroBlaze soft processor and the decoder part on customized hardware. The system prototypes of the AV and VB decoders show that they support up to 34.2 Mbps and 3.15 Mbps data rate respectively on XUP Virtex-II pro developing board, which are 19 and 16 times faster than their respective implementations on a DSP
5303914
An FPGA-Based Accelerator for Multiphysics Modeling
7583168
Incremental Design Methodology for Multimillion-gate Fpgas
This paper presents an FPGA design methodology that can be used to shorten the FPGA design-and-debug cycle, especially as the gate counts increase to multimillions. Core-based incremental placement algorithms, in conjunction with fast interactive routing, are investigated to reduce the design processing time by distinguishing the changes between design iterations and reprocessing only the changed blocks without affecting the remaining part of the design. When combined with a background refinement thread, the incremental approach offers the instant gratification that designers expect, while preserving the fidelity attained through batch-oriented programs. An integrated FPGA design environment is then developed based on the incremental placer and its background refiner. The results show that the incremental design methodology is in orders of magnitude faster than the competing approaches such as the Xilinx M3 tools without sacrificing too much quality.
37047287
A SoPC Architecture of MIMO Sphere Decoder for Mobile Communications
15628775
An FPGA based Co-Design Architecture for MIMO Lattice Decoders
─ MIMO systems have attracted great attentions because of their huge capacity. The hardware implementation of MIMO decoder becomes a challenging task as the complexity of the MIMO systems increases. This paper presents hardware/software co-design architecture targeted on a single FPGA for two typical lattice decoding algorithms. Two levels of parallelisms are analyzed for an efficient implementation with the preprocessing part on embedded MicroBlaze soft processor and the decoder part on customized hardware. The system prototypes of the AV and VB decoders show that they support up to 34.2 Mbps and 3.15 Mbps data rate at 20dB SNR respectively on XUP Virtex-II pro developing board with an xc2vp30 FPGA, which are 19 and 16 times faster than their respective implementations on a DSP. The performance in terms of resource utilization and bit error rate are also compared between these two algorithms.
12332460
Investigating the Transport Communicating Rates of Wireless Networks over Fading Channels
The large wireless networks under fading, mobility, and delay constraints are further considered under more generic conditions comparison with previous investigating are discussed. The previous implicit restrictions are relaxed, together with more realistic assumptions, make the conclusions, the transport capacity of wireless networks over fading channels more useful for the relevant protocol designs for the wireless networks.
15090488
The Islands Approach to Nearest Neighbor Querying in Spatial Networks
Much research has recently been devoted to the data management foundations of location-based mobile services. In one important scenario, the service users are constrained to a transportation network. As a result, query processing in spatial road networks is of interest. We propose a versatile approach to k nearest neighbor computation in spatial networks, termed the Islands approach. By offering flexible yet simple means of balancing re-computation and pre-computation, this approach is able to manage the trade-off between query and update performance. The result is a single, efficient, and versatile approach to k nearest neighbor computation that obviates the need for using several k nearest neighbor approaches for supporting a single service scenario. The experimental comparison with the existing techniques uses real-world road network data and considers both I/O and CPU performance, for both queries and updates.
15675165
Maximum Common Subgraph: Upper Bound and Lower Bound Results
In bio informatics, the biological structure matching problems can be formulated as the problem of finding the maximum common subgraph. Among the many different variants of the maximum common subgraph problem, the maximum common induced subgraph of two graphs is of special interest. In this paper, first we derive the lower bound result for the exact algorithms of the maximum common induced subgraph of two graphs, based on the current research progress in the area of parameterized computation. Then we investigate the upper bound and design the approaches for addressing this problem. Basically, this problem can be reduced to find a maximum clique in the product graph of the two given graphs. In consideration of the upper bound result, the obtained lower bound result is asymptotically tight. We would like to point out that our lower bound result presented here is currently best-known
9602783
Discovery of interesting association rules from Livelink web log data
We present our experience in mining web usage patterns from a large collection of Livelink log data. Livelink is a web-based product of Open Text, which provides automatic management and retrieval of different types of information objects over an intranet or extranet. We report our experience in preprocessing raw log data and post-processing the mining results for finding interesting rules. In particular we compare and evaluate a number of rule interestingness measures and find that two of the measures that have not been used in association rule learning work very well.
30724966
Motivational System for Human-Robot Interaction
Human-Robot Interaction (HRI) has recently drawn increased attention. Robots can not only passively receive information but also actively emit actions. We present a motivational system for human-robot interaction. The motivational system signals the occurrence of salient sensory inputs, modulates the mapping from sensory inputs to action outputs, and evaluates candidate actions. No salient feature is predefined in the motivational system but instead novelty based on experience, which is applicable to any task. Novelty is defined as an innate drive. Reinforcer is integrated with novelty. Thus, the motivational system of a robot can be developed through interactions with trainers. We treat vision-based neck action selection as a behavior guided by the motivational system. The experimental results are consistent with the attention mechanism in human infants.