The search functionality is under construction.

Author Search Result

[Author] Hui QIN(3hit)

1-3hit
  • A Realization of Multiple-Output Functions by a Look-Up Table Ring

    Hui QIN  Tsutomu SASAO  Munehiro MATSUURA  Shinobu NAGAYAMA  Kazuyuki NAKAMURA  Yukihiro IGUCHI  

     
    PAPER-Logic Synthesis

      Vol:
    E87-A No:12
      Page(s):
    3141-3150

    A look-up table (LUT) cascade is a new type of a programmable logic device (PLD) that provides an alternative way to realize multiple-output functions. An LUT ring is an emulator for an LUT cascade. Compared with an LUT cascade, the LUT ring is more flexible. In this paper we discuss the realization of multiple-output functions with the LUT ring. Unlike an FPGA realization of a logic function, accurate prediction of the delay time is easy in an LUT ring realization. A prototype of an LUT ring has been custom-designed with 0.35 µm CMOS technology. Simulation results show that the LUT ring is 80 to 241 times faster than software programs on an SH-1, and 36 to 93 times faster than software programs on a PentiumIII when the frequencies for the LUT ring and the MPUs are the same, but is slightly slower than commercial FPGAs.

  • Adaptive Selective Retransmission Algorithm for Video Communications in Congested Networks

    Bin SONG  Hao QIN  Xuelu PENG  Yanhui QIN  

     
    LETTER-Multimedia Systems for Communications

      Vol:
    E94-B No:6
      Page(s):
    1788-1791

    An adaptive selective retransmission algorithm for video communications based on packet importance value is proposed. The algorithm can adaptively select the retransmission threshold in realtime and efficiently manage the retransmission process in heavy loaded networks while guaranteeing acceptable video quality at the receiver.

  • A Design of AES Encryption Circuit with 128-bit Keys Using Look-Up Table Ring on FPGA

    Hui QIN  Tsutomu SASAO  Yukihiro IGUCHI  

     
    PAPER-Computer Components

      Vol:
    E89-D No:3
      Page(s):
    1139-1147

    This paper addresses a pipelined partial rolling (PPR) architecture for the AES encryption. The key technique is the PPR architecture. With the proposed architecture on the Altera Stratix FPGA, two PPR implementations achieve 6.45 Gbps throughput and 12.78 Gbps throughput, respectively. Compared with the unrolling implementation that achieves a throughput of 22.75 Gbps on the same FPGA, the two PPR implementations improve the memory efficiency (i.e., throughput divided by the size of memory for core) by 13.4% and 12.3%, respectively, and reduce the amount of the memory by 75% and 50%, respectively. Also, the PPR implementation has a up to 9.83% higher memory efficiency than the fastest previous FPGA implementation known to date. In terms of resource efficiency (i.e., throughput divided by the equivalent logic element or slice), one PPR implementation offers almost the same as the rolling implementation, and the other PPR implementation offers a medium value between the rolling implementation and the unrolling implementation that has the highest resource efficiency. However, the two PPR implementations can be implemented on the minimum-sized Stratix FPGA while the unrolling implementation cannot. The PPR architecture fills the gap between unrolling and rolling architectures and is suitable for small and medium-sized FPGAs.