Assignment Method - Explore the Science & Experts | ideXlab

Scan Science and Technology

Contact Leading Edge Experts & Companies

Assignment Method

The Experts below are selected from a list of 9423 Experts worldwide ranked by ideXlab platform

A. Slusarczyk – 1st expert on this subject based on the ideXlab platform

  • EUROMICRO – A new state Assignment Method targeting FPGA implementations
    Proceedings of the 26th Euromicro Conference. EUROMICRO 2000. Informatics: Inventing the Future, 2000
    Co-Authors: L. Jozwiak, A. Slusarczyk

    Abstract:

    State Assignment is one of the most important problems in hardware implementation of finite state machines. It influences to a high degree all quality aspects of the final hardware implementation. FPGAs are commonly used for implementation of systems produced in small- to medium-size series or requiring a relatively high speed and/or (re)programmability. With both speed and logic capacity rapidly growing, FPGAs evolved very quickly to highly-flexible technology of choice for major manufacturers. Unfortunately, the progress in synthesis Methods and EDA tools for FPGA implementations does not keep up with the revolutionary development of the FPGA hardware platform. The characteristic features of the technology invalidate the traditionally used criteria, heuristics and synthesis Methods. The development of new FPGA-targeted (near) optimal state Assignment Methods is therefore of primary practical importance. In this paper we propose a new state Assignment Method for FPGA implementations. It consists in optimization of the information flows in the resulting circuit. This results in binary functions with compact input supports, circuit composed of reasonably independent and highly coherent parts, and minimized (long) interconnections between the parts. The proposed Method produces therefore compact and fast circuits in FPGA technology. Our tool that implements the Method, compared to state-of-the-art encoding tools, consistently produces high quality results.

  • A new state Assignment Method targeting FPGA implementations
    Proceedings of the 26th Euromicro Conference. EUROMICRO 2000. Informatics: Inventing the Future, 2000
    Co-Authors: L. Jozwiak, A. Slusarczyk

    Abstract:

    State Assignment is one of the most important problems in hardware implementation of finite state machines. It influences to a high degree all quality aspects of the final hardware implementation. FPGAs are commonly used for implementation of systems produced in small- to medium-size series or requiring a relatively high speed and/or (re)programmability. With both speed and logic capacity rapidly growing, FPGAs evolved very quickly to highly-flexible technology of choice for major manufacturers. Unfortunately, the progress in synthesis Methods and EDA tools for FPGA implementations does not keep up with the revolutionary development of the FPGA hardware platform. The characteristic features of the technology invalidate the traditionally used criteria, heuristics and synthesis Methods. The development of new FPGA-targeted (near) optimal state Assignment Methods is therefore of primary practical importance. In this paper we propose a new state Assignment Method for FPGA implementations. It consists in optimization of the information flows in the resulting circuit. This results in binary functions with compact input supports, circuit composed of reasonably independent and highly coherent parts, and minimized (long) interconnections between the parts. The proposed Method produces therefore compact and fast circuits in FPGA technology. Our tool that implements the Method, compared to state-of-the-art encoding tools, consistently produces high quality results.

Y. Akaiwa – 2nd expert on this subject based on the ideXlab platform

  • A distributed dynamic channel Assignment Method for integrated circuit-switched-voice and packet-data cellular systems
    IEEE 54th Vehicular Technology Conference. VTC Fall 2001. Proceedings (Cat. No.01CH37211), 2001
    Co-Authors: H. Fujii, J. Ishida, Y. Akaiwa

    Abstract:

    Integrated voice and data transmission enhances the efficiency of channel usage. When it is applied to a multi-cell system, we need a channel Assignment Method that decreases interference between cells. Voice calls require real time transmission with higher priority over data calls. We investigate a Method that decreases the interference between cells by transmitting data packets with priority for the silent periods of circuit-switched-voice communication. Computer simulation results show characteristics such as interference rates, blocking rates, forced terminating rates, and hand-off rates are improved with this Method.

  • A dynamic channel Assignment Method for voice packet transmission cellular system
    1999 IEEE 49th Vehicular Technology Conference (Cat. No.99CH36363), 1999
    Co-Authors: T. Uehara, T. Seto, Y. Akaiwa

    Abstract:

    PRMA (packet reservation multiple access), a packet multiple access scheme with reservation, is well-known for its high spectrum efficiency in the time-domain owing to the statistical multiplexing effect. In order to apply packet transmission to the cellular spectrum where spectrum efficiency in the space-domain is important, this paper proposes a distributed dynamic channel Assignment Method where reuse partitioning is established by using one slot exclusively used for reservation and assigning packet transmission slots by the base station. Furthermore, several techniques are introduced to improve the performance. Computer simulation results show that the packet dropping probability is greatly decreased by the proposed Method.

Gang Chen – 3rd expert on this subject based on the ideXlab platform

  • A Dynamic Traffic Assignment Method Based on Connected Transportation System
    IEEE Access, 2019
    Co-Authors: Li Zhang, Bin Yu, Gang Chen

    Abstract:

    This paper proposed a dynamic traffic Assignment Method based on the connected transportation system to express the time-varied traffic flows caused by uncertain traffic demand and supply in the real traffic network accurately. In dynamic traffic Assignment, because of the cumulative volumes of successive time intervals, a route-based traffic Assignment algorithm is used for dynamic traffic Assignment in this paper. Besides, a novel shortest path algorithm based actual and artificial link is proposed for the time-expanded network that consists of two kinds of arcs: the actual arc and the artificial one. Then, a simple example is used to illustrate the performance of the proposed Method. The computational results show that the novel shortest path algorithm based actual and artificial link could be applied in the time-expanded networks with two types of arcs, and the route-based Assignment Method could achieve optimal balance solutions under different demand modes.