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
37047287
A SoPC Architecture of MIMO Sphere Decoder for Mobile Communications
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.
6189075
NodeRank: A New Structure Based Approach to Information Filtering
121152
Dynamic programming algorithms for restriction map comparison
For most sequence comparison problems there is a corresponding map comparison algorithm. While map data may appear to be incompatible with dynamic programming, we show in this paper that the rigor and efficiency of dynamic programming algorithms carry over to the map comparison algorithms. We present algorithms for restriction map comparison that deal with two types of map errors: (i) closely spaced sites for different enzymes can be ordered incorrectly, and (ii) closely spaced sites for the same enzyme can be mapped as a single site. The new algorithms are a natural extension of a previous map comparison model. Dynamic programming algorithms for computing optimal global and local alignments under the new model are described. The new algorithms take about the same order of time as previous map comparison algorithms. Programs implementing some of the new algorithms are used to find similar regions within the Escherichia coli restriction map of Kohara et al.
7754676
FDUQA on TREC2003 QA task
It is the fourth time that we take part in the QA track. Our system, FDUQA, is based on our previous system (Wu et al, 2002). FDUQA includes an offline part and an online part. We make great efforts on the online part while leaving the offline part unchanged. We have tried many natural language processing techniques, and incorporated many sources of world knowledge, including Web. A novel Query formulation technique has also been put forward. In addition, we’ve tried another attempt on answer extraction in this year’s task. In the second section, we will describe the architecture of our QA system; and give a detailed description on the Query formulation for Web search in the third section; while in the fourth section, we will introduce our new attempt on answer extraction; and we will present our performance in the last section.
42418095
An Improved ALOHA Algorithm for RFID Tag Identification
One of problems that we faced for Radio frequency identification (RFID) systems is that the collision between tags which lowers the efficiency of the RFID systems. One of the popular anti-collision algorithms is ALOHA-type algorithms, which are simple and have good performance when the number of tags to be read is reasonable small. In this paper, an enhanced dynamic framed slotted ALOHA algorithm for RFID is extended to a more general close form, hence reference [9] becomes only one special case described in our paper. The improved ALOHA algorithm for RFID tag identifications has much larger capacity to handle the cases when the tag numbers increasing largely while every frame keeping the optimum system efficiency 35.5%. Simulation results show that the proposed algorithm improves the efficiency nicely in comparison with the conventional algorithms keeping >80% as the previous paper shown.