Handover Management in Highly Dense Femtocellular Networks

For dense femtocells, intelligent integrated femtocell/macrocell network architecture, a neighbor cell list with a minimum number of femtocells, effective call admission control (CAC), and handover processes with proper signaling are the open research issues. An appropriate traffic model for the integrated femtocell/macrocell network is also not yet developed. In this paper, we present the major issue of mobility management for the integrated femtocell/macrocell network. We propose a novel algorithm to create a neighbor cell list with a minimum, but appropriate, number of cells for handover. We also propose detailed handover procedures and a novel traffic model for the integrated femtocell/macrocell network. The proposed CAC effectively handles various calls. The numerical and simulation results show the importance of the integrated femtocell/macrocell network and the performance improvement of the proposed schemes. Our proposed schemes for dense femtocells will be very effective for those in research and industry to implement

A new meta-module for efficient reconfiguration of hinged-units modular robots

We present a robust and compact meta-module for edge-hinged modular robot units such as M-TRAN, SuperBot, SMORES, UBot, PolyBot and CKBot, as well as for central-point-hinged ones such as Molecubes and Roombots. Thanks to the rotational degrees of freedom of these units, the novel meta-module is able to expand and contract, as to double/halve its length in each dimension. Moreover, for a large class of edge-hinged robots the proposed meta-module also performs the scrunch/relax and transfer operations required by any tunneling-based reconfiguration strategy, such as those designed for Crystalline and Telecube robots. These results make it possible to apply efficient geometric reconfiguration algorithms to this type of robots. We prove the size of this new meta-module to be optimal. Its robustness and performance substantially improve over previous results.Peer ReviewedPostprint (author's final draft

Variational neural network ansatz for steady states in open quantum systems

We present a general variational approach to determine the steady state of open quantum lattice systems via a neural network approach. The steady-state density matrix of the lattice system is constructed via a purified neural network ansatz in an extended Hilbert space with ancillary degrees of freedom. The variational minimization of cost functions associated to the master equation can be performed using a Markov chain Monte Carlo sampling. As a first application and proof-of-principle, we apply the method to the dissipative quantum transverse Ising model.Comment: 6 pages, 4 figures, 54 references, 5 pages of Supplemental Information

Baseband analog front-end and digital back-end for reconfigurable multi-standard terminals

Multimedia applications are driving wireless network operators to add high-speed data services such as Edge (E-GPRS), WCDMA (UMTS) and WLAN (IEEE 802.11a,b,g) to the existing GSM network. This creates the need for multi-mode cellular handsets that support a wide range of communication standards, each with a different RF frequency, signal bandwidth, modulation scheme etc. This in turn generates several design challenges for the analog and digital building blocks of the physical layer. In addition to the above-mentioned protocols, mobile devices often include Bluetooth, GPS, FM-radio and TV services that can work concurrently with data and voice communication. Multi-mode, multi-band, and multi-standard mobile terminals must satisfy all these different requirements. Sharing and/or switching transceiver building blocks in these handsets is mandatory in order to extend battery life and/or reduce cost. Only adaptive circuits that are able to reconfigure themselves within the handover time can meet the design requirements of a single receiver or transmitter covering all the different standards while ensuring seamless inter-interoperability. This paper presents analog and digital base-band circuits that are able to support GSM (with Edge), WCDMA (UMTS), WLAN and Bluetooth using reconfigurable building blocks. The blocks can trade off power consumption for performance on the fly, depending on the standard to be supported and the required QoS (Quality of Service) leve

A Vision-based Scheme for Kinematic Model Construction of Re-configurable Modular Robots

Re-configurable modular robotic (RMR) systems are advantageous for their reconfigurability and versatility. A new modular robot can be built for a specific task by using modules as building blocks. However, constructing a kinematic model for a newly conceived robot requires significant work. Due to the finite size of module-types, models of all module-types can be built individually and stored in a database beforehand. With this priori knowledge, the model construction process can be automated by detecting the modules and their corresponding interconnections. Previous literature proposed theoretical frameworks for constructing kinematic models of modular robots, assuming that such information was known a priori. While well-devised mechanisms and built-in sensors can be employed to detect these parameters automatically, they significantly complicate the module design and thus are expensive. In this paper, we propose a vision-based method to identify kinematic chains and automatically construct robot models for modular robots. Each module is affixed with augmented reality (AR) tags that are encoded with unique IDs. An image of a modular robot is taken and the detected modules are recognized by querying a database that maintains all module information. The poses of detected modules are used to compute: (i) the connection between modules and (ii) joint angles of joint-modules. Finally, the robot serial-link chain is identified and the kinematic model constructed and visualized. Our experimental results validate the effectiveness of our approach. While implementation with only our RMR is shown, our method can be applied to other RMRs where self-identification is not possible

Pixie: A heterogeneous Virtual Coarse-Grained Reconfigurable Array for high performance image processing applications

Coarse-Grained Reconfigurable Arrays (CGRAs) enable ease of programmability and result in low development costs. They enable the ease of use specifically in reconfigurable computing applications. The smaller cost of compilation and reduced reconfiguration overhead enables them to become attractive platforms for accelerating high-performance computing applications such as image processing. The CGRAs are ASICs and therefore, expensive to produce. However, Field Programmable Gate Arrays (FPGAs) are relatively cheaper for low volume products but they are not so easily programmable. We combine best of both worlds by implementing a Virtual Coarse-Grained Reconfigurable Array (VCGRA) on FPGA. VCGRAs are a trade off between FPGA with large routing overheads and ASICs. In this perspective we present a novel heterogeneous Virtual Coarse-Grained Reconfigurable Array (VCGRA) called "Pixie" which is suitable for implementing high performance image processing applications. The proposed VCGRA contains generic processing elements and virtual channels that are described using the Hardware Description Language VHDL. Both elements have been optimized by using the parameterized configuration tool flow and result in a resource reduction of 24% for each processing elements and 82% for each virtual channels respectively.Comment: Presented at 3rd International Workshop on Overlay Architectures for FPGAs (OLAF 2017) arXiv:1704.0880

Change Sensor Topology When Needed: How to Efficiently Use System Resources in Control and Estimation Over Wireless Networks

New control paradigms are needed for large networks of wireless sensors and actuators in order to efficiently utilize system resources. In this paper we consider when feedback control loops are formed locally to detect, monitor, and counteract disturbances that hit a plant at random instances in time and space. A sensor node that detects a disturbance dynamically forms a local multi-hop tree of sensors and fuse the data into a state estimate. It is shown that the optimal estimator over a sensor tree is given by a Kalman filter of certain structure. The tree is optimized such that the overall transmission energy is minimized but guarantees a specified level of estimation accuracy. A sensor network reconfiguration algorithm is presented that leads to a suboptimal solution and has low computational complexity. A linear control law based on the state estimate is applied and it is argued that it leads to a closed-loop control system that minimizes a quadratic cost function. The sensor network reconfiguration and the feedback control law are illustrated on an example

Electronic structure and the glass transition in pnictide and chalcogenide semiconductor alloys. Part II: The intrinsic electronic midgap states

We propose a structural model that treats in a unified fashion both the atomic motions and electronic excitations in quenched melts of pnictide and chalcogenide semiconductors. In Part I (submitted to J. Chem. Phys.), we argued these quenched melts represent aperiodic $pp\sigma$-networks that are highly stable and, at the same time, structurally degenerate. These networks are characterized by a continuous range of coordination. Here we present a systematic way to classify these types of coordination in terms of discrete coordination defects in a parent structure defined on a simple cubic lattice. We identify the lowest energy coordination defects with the intrinsic midgap electronic states in semiconductor glasses, which were argued earlier to cause many of the unique optoelectronic anomalies in these materials. In addition, these coordination defects are mobile and correspond to the transition state configurations during the activated transport above the glass transition. The presence of the coordination defects may account for the puzzling discrepancy between the kinetic and thermodynamic fragility in chalcogenides. Finally, the proposed model recovers as limiting cases several popular types of bonding patterns proposed earlier, including: valence-alternation pairs, hypervalent configurations, and homopolar bonds in heteropolar compounds.Comment: 17 pages, 15 figures, revised version, final version to appear in J. Chem. Phy