logo
    Reconfigurable mobile communications: compelling needs and technologies to support reconfigurable terminals
    4
    Citation
    2
    Reference
    10
    Related Paper
    Abstract:
    To date, research into reconfigurable mobile communications has predominantly focussed on the software radio concept, and specifically on the hardware technologies required to move physical layer processing into a programmable environment. Although an interesting and necessary challenge, this only represents a fraction of the overall support and technology required to realise the potential of the concept. Other necessary developments include network/terminal cooperation for seamless inter-standard handoff, QoS management, a secure software download mechanism, terminal software architecture supporting reconfiguration, configuration management, capability negotiation. Summarising results from early IST-TRUST (Transparently Reconfigurable Ubiquitous terminal) project deliverables, this paper describes the likely overall system environment, and the key technical challenges to be researched in TRUST for realising a reconfigurable terminal to meet the needs of users within that environment.
    Keywords:
    Control reconfiguration
    Optically differential reconfigurable gate arrays (ODRGAs) have been developed to achieve rapid reconfiguration and numerous reconfiguration contexts. Although fast reconfiguration experiments of a four-context ODRGA have been presented in earlier reports, the number of configuration contexts was insufficient for dynamic reconfiguration applications. Therefore, we have developed a more advanced nine-context ODRGA system. This paper presents fast 86.2 ns reconfiguration experiments using a nine-context ODRGA architecture and discusses plans for future work.
    Control reconfiguration
    This paper investigates the built-in spatial modules extended with reconfigurable character based on reconfiguration modules in the form of spatial kinematic pairs and associated links. Known that reconfiguration modules are to be served to develop reconfiguration leading to novel structure expansion, the key issue is to assemble reconfiguration modules and to derive a reconfiguration mechanism as a self-reconfigurable set. The module exerts its reconfiguration through changing the number of mobility or type of its built-in kinematic pair and changing its combined components. Its reconfiguration characteristics come from its decomposition, transformation, degeneration and combination. It is clear that reconfiguration module extension serves as an effective category to set up the relationship and transformation categories between these reconfiguration modules. More often, there exists multiple module group solutions for a higher dimensional module and this is the key for topology reconfiguration and variation. Spatial reconfiguration process uses reconfiguration principles which is consistent with displacement group operations. The essence of reconfiguration is the reconfiguration mechanism characteristic which convert a mechanism from fixed topology to variable topology analogous to evolutionary variation. In fact, these can be the effective and available constraint information as geometrical ways to reach the special configuration states and then produce reconfigurations with special geometric and parametric dimension design.
    Control reconfiguration
    This paper presents the divided principle of reconfigurable cells based on operations containing degree, according to the attributes of setups' table. Analysing the relation between configurations and reconfigurable cells,then transfering the research of the reconfiguration between one configuration and the other to the reconfiguration among reconfigurable cells.Studying on the program of the reconfiguration among reconfigurable cells,and describing it by computer programming language(C++).Modeling the reconfiguration cost between one configuration and the other ,which is based on analysing the policy of the reconfiguration among reconfigurable cells.Finally,a case is studied to demonstrate the validity of models and the policy.
    Control reconfiguration
    Table (database)
    Reconfigurable Computing
    Citations (0)
    Reconfiguration is considered in the context of image-processing applications. Dynamic switching is the basis of experiments into hardware reconfiguration described in the article. Implementation issues are detailed. Methods of analysing performance for the reconfigurable case are adumbrated. A discussion ensues on the practical problems of providing a usable system with reconfiguration provision. © 1998 John Wiley & Sons, Ltd.
    Control reconfiguration
    USable
    Reconfigurable hardware combines the flexibility of software and the efficiency of hardware. Thus, embedded systems can benefit from reconfiguration techniques. Many special aspects of dynamic and partial reconfiguration have been already analyzed. On the one hand reconfiguration is mostly used like a hot-plug mechanism. On the other hand approaches similar to the overlaying technique, known from the Pascal runtime library, can be used. The overlaying algorithm schedules different functions to the same hardware resource during runtime. In this paper, the overlaying concept is adapted to reconfiguration. The used reconfiguration model is presented and the costs are optimized and evaluated. The average reconfiguration time is minimized. These methods have been integrated into the design flow for reconfiguration. This approach is best suited for small FPGAs, which are crucial in embedded system design.
    Control reconfiguration
    Plug-in
    Design flow
    Pascal (unit)
    Citations (1)
    Long Term Evolution (LTE) suffers from 'Cell dragging effect' and 'Pilot pollution' problem which results in inefficient handover performance. While considering the Reference Signal Received Strength (RSRP) of the serving and target cells for making handover decision, the problem of 'Cell dragging effect' occurs. It is a condition where a user entered into the coverage of a target cell still not handed over from the serving cell since he sees better RSRP from serving cell. 'Pilot pollution' is a condition where the power transmitted from many different cells appears in a location but none is significantly better than others. This paper proposes an algorithm to address the issue of 'Cell dragging effect' and 'Pilot pollution'. It considers user equipment moving direction and dwell time of the target cells for implementing handover. The target cell is selected such that the considered factors are in favor to the corresponding target cell which in turn yields an efficient handover performance. A comparative analysis is done between 'conventional coverage based handover' and the 'Dwell Time and Predicted Mobility Based Handover Algorithm' (DPH). The simulation results show that the DPH scheme performs better than the traditional handover algorithm as it reduces the number of handovers.
    Dwell time
    Soft handover
    Some certain criteria will be required to evaluate the reconfiguration of a system or an individual as well as its reconfiguration value. In the paper a methodology on evaluating the reconfigurability has been proposed. It was intended for the paper to study quantitatively and qualitatively the feasibility of the system to reconfigurate. The reconfiguration distance has been put forward based on the information distance and its calculation model has been given. In the paper, reconfiguration distance was proposed to measure the reconfiguration value. This method can be used to determine the level of its reconfigurability, providing a basis for decision-makers. For the system's or individual's reconfiguration, the focus of this paper is the determination of indicators to measure the reconfiguration, i.e., costs of reconfiguration, and reconfiguration realizability used to describe the obstacles, costs needed to pay, and the degree to realize when reconfigurating the system or individual, which will further improve the reconfiguration theory. Only thus the truly meaningful reconfiguration can be achieved.
    Control reconfiguration
    Reconfigurability
    Realizability
    Value (mathematics)
    In this paper, we study multi-level dynamically reconfigurable architectures. These are extensions of standard reconfigurable architectures where ordinary reconfiguration operations correspond to the lowest reconfiguration level. On each higher reconfiguration level the reconfiguration capabilities of the reconfigurable resources that are available on the level directly below can be reconfigured. We show that the problem to find optimal reconfigurations with an arbitrary number of reconfiguration levels can be found in polynomial time for the switch cost model. The problem of finding the optimal number of reconfiguration levels is shown to be solvable in polynomial time on homogeneous multi-level architectures but it becomes NP-hard for heterogeneous multi-level architectures. Moreover, we present experimental results for some example problems on a simple test architecture.
    Control reconfiguration
    Reconfigurable Computing
    Citations (1)
    Current run-time reconfigurable systems present high reconfiguration times. This is a high overhead which deeply reduce these systems' performance, and it is critical when the application has tight performance requirements. Multi-level reconfiguration (MLR) model is a good strategy to reduce the size of configuration bitstreams, reducing reconfiguration times. In this paper, a two-level reconfigurable architecture was used to quantitatively analyze these benefits of MLR. This was performed with an image operator architecture, which allows reconfiguration in two architectural levels. The results showed high reductions of reconfiguration overhead compared to current reconfiguration models and to execution times.
    Control reconfiguration
    Operator (biology)
    Citations (0)