Computation sharing programmable FIR filter for low-power and high-performance applications

This paper presents a programmable digital finite-impulse response (FIR) filter for high-performance and low-power applications. The architecture is based on a computation sharing multiplier (CSHM) which specifically targets computation re-use in vector-scalar products and can be effectively used in the low-complexity programmable FIR filter design. Efficient circuit-level techniques, namely a new carry-select adder and conditional capture flip-flop (CCFF), are also used to further improve power and performance. A 10-tap programmable FIR filter was implemented and fabricated in CMOS 0.25-/spl mu/m technology based on the proposed architectural and circuit-level techniques. The chip's core contains approximately 130 K transistors and occupies 9.93 mm/sup 2/ area.     

水下光声混合网络评价(英文)

The deployment of underwater networks allows researchers to collect explorative and monitoring data on underwater ecosystems.The acoustic medium has been widely adopted in current research and commercial uses,while the optical medium remains experimental only.According to our survey onthe properties of acoustic and optical communicationsand preliminary simulation results have shown significant trade-offs between bandwidth,propagation delay,power consumption,and effective communication range.We propose a hybrid solution that combines the use of acoustic and optical communication in order to overcome the bandwidth limitation of the acoustic channel by enabling optical communicationwith the help of acoustic-assisted alignment between optical transmitters and receivers.     

On fast evaluation of bivariate polynomials at equispaced arguments

The initial value problem arising in the recursive evaluation of a 2D polynomial at equispaced points is treated in detail; the results facilitate efficient implementation of Bose's recursive algorithm. The computational complexity is compared with that involved in a direct computation, and some general observations are made for an alternative scheme proposed by X. Nie and R. Unbehauen (1989)     

Multi slot-throughput tradeoff in an improved energy detector based faded cognitive radio network

In this paper, the impact of a multi slot based cooperative spectrum sensing (CSS) on the performance of a cognitive radio (CR) network has been investigated. Each CR user, equipped with an improved energy detector (IED), uses a number of mini slots of the sensing time to perform the spectrum sensing. Each CR uses OR logic to combine the sub local decisions generated in each mini slot to obtain a local decision at CR level. Local decisions are sent to fusion centre (FC) over reporting channel. The FC obtains a final decision about the presence of primary user (PU) by combining the local decisions using a fusion rule: Majority or Maximal Ratio Combining. The performance of the CSS is assessed in terms of detection probability and false alarm probability considering both the sensing and reporting channels are Rayleigh faded. Furthermore, the impact of a number of sensing slots and IED parameter on throughput of CR network is also evaluated under the proposed spectrum sensing scenario. Impacts of several sensing parameters such as sensing channel SNR and reporting channel SNR on the performance of CR network are also evaluated. Performances of two fusion rules under study are compared. Effect of sensing error and synchronisation error is indicated. Further the study is extended for independent but non identically distributed (i.n.i.d.) Rayleigh faded channels as well as for a multiple PU scenario also.     

Encrypted Network Traffic Classification and Resource Allocation with Deep Learning in Software Defined Network

Wireless Personal Communications - The climate has changed absolutely in every area in just a few years as digitized, making high-speed internet service a significant need in the future. Future...     

Location Update versus Paging Trade-Off in Cellular Networks: An Approach Based on Vector Quantization

In this paper, we propose two information-theoretic techniques for efficiently trading off the location update and paging costs associated with mobility management in wireless cellular networks. Previous approaches always attempt to accurately convey a mobile's movement sequence and hence cannot reduce the signaling cost below the entropy bound. Our proposed techniques, however, exploit the rate distortion theory to arbitrarily reduce the update cost at the expense of an increase in the corresponding paging overhead. To this end, we describe two location tracking algorithms based on spatial quantization and temporal quantization, which first quantize the movement sequence into a smaller set of codewords and then report a compressed representation of the codeword sequence. Although the spatial quantization algorithm clusters individual cells into registration areas, the more powerful temporal quantization algorithm groups sets of consecutive movement patterns. The quantizers themselves are adaptive and periodically reconfigure to accommodate changes in the mobile's movement pattern. Simulation study with synthetic and real movement traces for both single-system and multisystem cellular networks demonstrate that the proposed algorithms can reduce the mobile's update frequency to 3-4 updates/day with reasonable paging cost, low computational complexity, storage overhead, and codebook updates.     

UAV-assisted multi-hop D2D relaying for communication in large disaster area

An unmanned aerial vehicle (UAV)-assisted communication is a promising technique for enabling ground users in a non-functional area (NFA) or disaster area to communicate. All the base stations in the disaster area may be partially or fully damaged due to the natural calamity. Device-to-device (D2D) communication can be a viable solution for immediate connection between users in an NFA. We propose a UAV-assisted multi-hop D2D communication following a hybrid power-time switching (PTS) in this paper. Moreover, a D2D user of a cluster can communicate with another D2D user in a different cluster through UAVs. However, D2D users can harvest energy from their respective ad hoc energy stations and forward the information to the nearby D2D user following a hybrid PTS-based strategy. We propose a time frame for the same and show a node-based energy harvesting strategy. The expressions of outage probability, throughput, end-to-end energy consumption, and energy efficiency are developed for the Rician and Nakagami-m faded channel. The impact of several network parameters such as energy harvesting factor, energy harvesting efficiency, and fading parameter on the network performance is also indicated.     

Capacitances in double-barrier tunneling structures

Capacitances in a double-barrier tunneling structure are calculated for the specific sequential electron tunneling regime. Starting from Luryi's (1988) definition of quantum capacitance, the authors model the charge accumulation in the well during the tunneling process using the Fermi-Dirac distribution. Analytical formulas for the total capacitance and conductance are derived. A complete small-signal model is proposed that demonstrates the external capacitance and conductance of the structure and its frequency behavior. The authors show both theoretically and experimentally that the capacitance in a tunneling structure is both bias- and frequency-dependent     

RoBiN: Random Access using Border Routers in Cellular Networks

Introducing Machine-to-Machine (M2M) communications over traditional 4G cellular networks make the cellular random access channel more congested and collision-prone. In order to resolve this random access congestion, we propose RoBiN - Random access using Border router in M2M cellular Networks. RoBiN proposes an architectural modification of introducing small cells, called Border Routers (BR), in cellular networks, with complete frequency reuse capability. We formulate the aforementioned challenge in terms of collision probability and system capacity. Subsequently, we propose an efficient solution for M2M communications in cellular networks. Exhaustive mathematical analysis shows that RoBiN significantly improves the random access success probability, by 50 % over existing 4G cellular systems. Simulation results on typical 4G networks corroborate our mathematical analysis and demonstrate almost 15 dB increase in Signal-to-Interference-plus-Noise Ratio (SINR) and 3 times throughput improvements over legacy 4G cellular systems. Furthermore, RoBiN also achieves 50 %?80 % improvement in collision probability over existing time alignment matching work.