Learn More
Branch prediction is critical to the instruction-level parallelism. Researchers have been focusing on branch direction algorithm for a long time and recent improvement on the prediction accuracy in literatures is achieved by increasing the complexity of algorithms and at the cost of enlarging the branch target buffers. Thus many of these high accuracy(More)
Three types of two-way two-dimensional finite automata and three-way two-dimensional finite automata are studied, including deterministic, nondeterministic and Las Vegas finite automata. By comparing the languages recognized by above automata, two results are obtained: (1) The power of two-way two-dimensional nondeterministic finite automata and three-way(More)
  • Wenbing Jin
  • 2008
This paper proposes a new data table decomposition algorithm to address problems in extracting rules from massive data tables, e.g. low effectiveness, low computing speed and long rule length. With rough set theory, in the perspective of improving classification correctness and sub data table purity, this paper brings up attribute selection measure, and(More)
In theory, branch predictors with more complicated algorithms and larger data structures provide more accurate predictions. Unfortunately, overly large structures and excessively complicated algorithms cannot be implemented because of their long access delay. To date, many strategies have been proposed to balance delay with accuracy, but none has completely(More)
For downlink adaptive controlling, feedback from the UE used can highly improve user data rate. The adaptive algorithm provides the gain of high peak rates (dual stream) when close to the cell and good cell edge performance (single stream). In this paper, firstly, it described CL loop MIMO adaptive switch for TD-LTE system, moreover, explained three UE(More)
  • 1