A 24-channel implantable neural recording based on time and frequency-division multiplexing

This paper presents a novel approach to encapsulate prerecorded neural signals in implantable neural recording microsystems. We have increased the number of channels and the reconstructed neural signal quality in the receiver by combining time-division-multiplexing (TDM) and frequency-division-multiplexing (FDM) method. Reducing the number of channels in each TDM module is the fundamental advantage of this method that leads to reduced crosstalk noise. We evaluate some possible configurations and propose an optimized system that has less power dissipation and area occupation than other configurations. A 24-channel implantable neural recording based on the optimized system is designed in both system and circuit level. In this system, first, channels are divided into three 8-channel groups then after multiplexing in the time domain, they are combined together by FDM method. Finally, a frequency modulator wirelessly transmits neural signals to an external setup. In addition, we adjust local carrier frequencies and the bandwidth of TDM to synchronize detection without transmitting pilot carrier. To justify the system operation, using 0.18 μm CMOS technology, we design the system in circuit level. The designed circuit consumes a power of 1.39 mW at a supply voltage of 1.8 V. This leads to a power consumption of 58 μW per channel.     

Two new low-power Full Adders based on majority-not gates

Two novel low-power 1-bit Full Adder cells are proposed in this paper. Both of them are based on majority-not gates, which are designed with new methods in each cell. The first cell is only composed of input capacitors and CMOS inverters, and the second one also takes advantage of a high-performance CMOS bridge circuit. These kinds of designs enjoy low power consumption, a high degree of regularity, and simplicity. Low power consumption is targeted in implementation of our designs. Eight state-of-the-art 1-bit Full Adders and two proposed Full Adders are simulated using 0.18 μm CMOS technology at many supply voltages. Simulation results demonstrate improvement in terms of power consumption and power-delay product (PDP).     

Energy efficiency optimization of one-way and two-way DF relaying considering circuit power

In this paper, the energy efficiency (EE) of a decode and forward (DF) relay system is studied, where two sources communicate through a half-duplex relay node in one-way and two-way relaying strategies. Both the circuitry power and the transmission power of all nodes are taken into consideration. In addition, three different coding schemes for two-way DF relaying strategy with two phases and two-way DF relaying with three phases are considered. The aim is to maximize the EE of the system for a constant spectral efficiency (SE). For this purpose, the transmission time and the transmission power of each node are optimized. Simulations are used to compare the EE–SE curve of different DF strategies with one-way and two-way amplify and forward (AF) strategies and direct transmission (DT), to find the best energy efficient strategy in different SE conditions. Analytical and simulation results demonstrate that in low SE conditions, DF relaying strategies are more energy efficient compared to that of AF strategies and DT. However, in high SE conditions, the EE of two-way AF relaying and DT strategy outperform some of the DF relaying strategies. In simulations, the impact of different circuitry power and different channel conditions on the EE–SE curves are also investigated.     

On the necessary and sufficient requirement of a CIOQ switch to emulate an Output Queued switch

There has been much interest to emulate the behavior of Output Queued switches. The early result of such attempts was reported by Prabhakar and McKeown using the CIOQ switches with speedup factor of 4. Subsequently, Stoica and Zhang and independently Chuang et al. showed that a speedup of 2 in conjunction with their scheduling schemes would be sufficient for CIOQ switches to emulate Output Queued switches.Additionally, Chuang et al. showed that in “Average Sense” a speedup of 2?1/N is necessary and sufficient for CIOQ to emulate Output Queued switch behavior.Our paper reports that in the “Strict Sense” a speedup of 2 is both necessary and sufficient. We show this requirement using examples for 2x2 and 3x3 switches. Then, with a constructed traffic pattern, it is proved that in the “Strict Sense” a speedup of 2 is necessary to emulate the behavior of an Output Queued switch for any switch size N.Combining this result with the previous scheduling schemes, we conclude that in the “Strict Sense”, a speedup of 2 is the necessary and sufficient condition to emulate the behavior of an Output Queued switch, using a CIOQ switch.Additionally, easing the assumptions and allowing the packet segmentation, it is shown that the speedup requirement to emulate the behavior of an Output Queued switch can be reduced to values even smaller than 2?1/N. For this case a lower bound of 3/2 and an upper bound of 2 is proved.     

MDP-Based Network Selection Scheme by Genetic Algorithm and Simulated Annealing for Vertical-Handover in Heterogeneous Wireless Networks

The hybrid algorithm for real-time vertical handover using different objective functions has been presented to find the optimal network to connect with a good quality of service in accordance with the user’s preferences. Markov processes are widely used in performance modelling of wireless and mobile communication systems. We address the problem of optimal wireless network selection during vertical handover, based on the received information, by embedding the decision problem in a Markov decision process (MDP) with genetic algorithm (GA), we use GA to find a set of optimal decisions that ensures the best trade-off between QoS based on their priority level. Then, we emerge improved genetic algorithm (IGA) with simulated annealing (SA) as leading methods for search and optimization problems in heterogeneous wireless networks. We formulate the vertical handoff decision problem as a MDP, with the objectives of maximizing the expected total reward and minimizing average number of handoffs. A reward function is constructed to assess the QoS during each connection, and the AHP method are applied in an iterative way, by which we can work out a stationary deterministic handoff decision policy. As it is, the characteristics of the current mobile devices recommend using fast and efficient algorithms to provide solutions near to real-time. These constraints have moved us to develop intelligent algorithm that avoid the slow and massive computations. This paper compares the formulation and results of five recent optimization algorithms: artificial bee colony, GA, differential evolution, particle swarm optimization and hybrid of (GA–SA). Simulation results indicated that choosing the SA rules would minimize the cost function, and also that, the IGA–SA algorithm could decrease the number of unnecessary handovers, and thereby prevent the ‘Ping-Pong’ effect.     

Analog to digital converter for high density neural signal recording front-end in 90 nm

High-fidelity recording of neural signals requires varying levels of signal gain to capture low-amplitude single-unit activity in the presence of high-amplitude population activity. A floating-point approach has been used to widen the dynamic range of analog-to-digital converters (ADC) designed for this application. In this paper we present an ADC, designed for multi-channel, portable neural signal recording systems. To achieve low power consumption, small die area and wide dynamic range, an ADC based on a time-based algorithm, combined with a floating-point pipelined structure has been designed and simulated. A conventional variable-gain amplifier (VGA) stage has been eliminated in favor of a reference-current in a time-based ADC architecture. The 12-b pipelined time-based floating-point ADC has been designed with a 7-b mantissa and an exponent that provides an additional 5 bits of dynamic range. The mantissa is determined by a uniform 7-b pipelined time-based analog to digital converter. The ADC chip was designed and simulated in a 90 nm CMOS process, which occupies an active area of 360 μm × 550 μm, and consumes 7.8 μW at 1.2 V in full-scale conversion.     

IGBDD: Intelligent Grid Based Data Dissemination Protocol for Mobile Sink in Wireless Sensor Networks

Lifetime and energy efficiency are important factors in the design of wireless sensor network. A critical issue during data collection is the formation of energy holes near the sink. Sensors which are located near the sink have to participate in relaying data on behalf of other sensors and thus their energy will be depleted very quickly. Mobile sink movement yields the significant performance gained by decreasing the amount of energy consumption. In this paper, we propose an Intelligent Grid Based Data Disseminating protocol for mobile sink in wireless sensor networks. We have utilized a virtual grid as the protocol’s substructure. In our proposed method, cell heads (CHs) will be selected based on the locations of virtual cross points (CPs) and CPs selection is needless to transfer any required data between neighbor nodes. We have optimized CPs selection using linear programming technique in order to increase network lifetime. By selecting the CHs based on our proposed algorithm, data will be disseminated toward the sink. Our data dissemination protocol is simple and has low overhead to construct and maintain. Also, we have presented a new method for sink location update which leads to the least cost in data transfer. Simulation results illustrate that by utilizing hierarchical functionality and selecting appropriate CPs and consequently selecting CHs, energy consumption will be decreased in comparison with other presented methods which directly lead to network lifetime increment. Also by determining an optimal cell size, packet delivery rate will be improved noticeably.     

基于不同爆轰产物的格尼速度估算新方法（英）

A new method for prediction of Gurney velocity of explosives is introduced in which energy output is correlated with the heat of detonation, the number of moles of gaseous products of detonation per gram of explosive and the average molecular weight of gaseous products. It is assumed that the CHNO explosive reacts to form products composed of N2 , CO, H2O, CO2, H2,O2 and C（s） as determined by the oxygen balance of the unreacted compound. Good agreement is obtained between measured and calculated values of Gurney velocity as compared to previous correlations which assumed the reaction products to consist of N2 , H2O, CO2 and either C（s） or O2.     

An energy-aware distributed clustering protocol in wireless sensor networks using fuzzy logic

Clustering is an effective approach for organizing a network into a connected hierarchy, load balancing, and prolonging the network lifetime. On the other hand, fuzzy logic is capable of wisely blending different parameters. This paper proposes an energy-aware distributed dynamic clustering protocol (ECPF) which applies three techniques: (1) non-probabilistic cluster head (CH) elections, (2) fuzzy logic, and (3) on demand clustering. The remaining energy of the nodes is the primary parameter for electing tentative CHs via a non-probabilistic fashion. A non-probabilistic CH election is implemented by introducing a delay inversely proportional to the residual energy of each node. Therefore, tentative CHs are selected based on their remaining energy. In addition, fuzzy logic is employed to evaluate the fitness (cost) of a node in order to choose a final CH from the set of neighboring tentative CHs. On the other hand, every regular (non CH) node elects to connect to the CH with the least fuzzy cost in its neighborhood. Besides, in ECPF, CH elections are performed sporadically (in contrast to performing it every round). Simulation results demonstrate that our approach performs better than well known protocols (LEACH, HEED, and CHEF) in terms of extending network lifetime and saving energy.     

Glyphosate Adsorption from Water Using Hierarchically Porous Metal–Organic Frameworks

The selective removal of one ligand in mixed-ligand MOFs upon thermolysis provides a powerful strategy to introduce additional mesopores without affecting the overall MOF structure. By varying the initial ligand ratio, MOFs of the MIL-125-Ti family with two distinct hierarchical pore architectures are synthesized, resembling either large cavities or branching fractures. The performance of the resulting hierarchically porous MOFs is evaluated toward the adsorptive removal of glyphosate (N-(phosphonomethyl)glycine) from water, and the adsorption kinetics and mechanism are examined. Due to their strong affinity for phosphoric groups, the numerous Ti–OH groups resulting from the selective ligand removal act as natural anchor points for effective glyphosate uptake. The relationships between contact duration, glyphosate concentration, and adsorbent dosage are investigated, and the impact of these parameters on the effectiveness of glyphosate removal from contaminated water samples is examined. The introduction of additional mesopores has increased the adsorption capacities by nearly 3 times with record values exceeding 440.9 mg g⁻¹, which ranks these MOFs among the best-reported adsorbents.