Synergistic Roll‐to‐Roll Transfer and Doping of CVD‐Graphene Using Parylene for Ambient‐Stable and Ultra‐Lightweight Photovoltaics

A roll‐to‐roll (R2R) transfer technique is employed to improve the electrical properties of transferred graphene on flexible substrates using parylene as an interfacial layer. A layer of parylene is deposited on graphene/copper (Cu) foils grown by chemical vapor deposition and are laminated onto ethylene vinyl acetate (EVA)/poly(ethylene terephthalate). Then, the samples are delaminated from the Cu using an electrochemical transfer process, resulting in flexible and conductive substrates with sheet resistances of below 300 Ω sq^?1, which is significantly better (fourfold) than the sample transferred by R2R without parylene (1200 Ω sq^?1). The characterization results indicate that parylene C and D dope graphene due to the presence of chlorine atoms in their structure, resulting in higher carrier density and thus lower sheet resistance. Density functional theory calculations reveal that the binding energy between parylene and graphene is stronger than that of EVA and graphene, which may lead to less tear in graphene during the R2R transfer. Finally, organic solar cells are fabricated on the ultrathin and flexible parylene/graphene substrates and an ultra‐lightweight device is achieved with a power conversion efficiency of 5.86%. Additionally, the device shows a high power per weight of 6.46 W g^?1 with superior air stability.     

A New Criteria Decision Applied on the Primary Synchronization in the DS-WCDMA Interface of the UMTS System

In DS-WCDMA mobile systems such the UMTS, asynchronous cell site operation,assigning different long spreading code to each cell, yields the advantageof flexible system deployment. We can design an indoor system basedon an outdoor one. However, in general, much longer search time isrequired in asynchronous operation than in synchronous. This paperproposes three techniques to take decisions about synchronizationbased on observation of correlated signals. Classical decision criterialike maximum and threshold criterion are presented. A new decisioncriteria that we call Threshold&Max combined decision criteriais analyzed. The results of this new introduced technique is comparedwith the classical ones.     

A Novel UWB Pulse Shape Modulation System

In this paper novel modified Hermite polynomial functions for use in impulse radio (ultra-wideband) communications are proposed. With these functions pulse shapes which are orthogonal and have nearly constant pulse width regardless of the pulse order are generated. These properties hold under the effects of differentiation. An M-ary communication system is constructed using these pulse shapes. A Matlab model for generating the pulses is designed and the effect of timing jitter on the performance of the system is investigated by computer simulation.     

ADYTIA: Adaptive and Dynamic TCP Interface Architecture for heterogeneous networks

Due to the widespread popularity and usage of Internet of things (IoT)‐enabled devices, there is an exponential increase in the data traffic generated from these IoT devices. Most of these devices communicate with each other using heterogeneous links having constraints such as latency, throughput, and interference from concurrent transmissions. This results in an extra burden on the underlying communication infrastructure to manage the traffic within these constraints between source and destination. However, most of the existing applications use different Transmission Control Protocol (TCP) variants for traffic management between these devices and are dependent on the stage of the sender, irrespective of the application types and link characteristics. Each operating system (OS) has different TCP variant for all applications, irrespective of path characteristics. Hence, a single TCP variant cannot select the best suitable link, which results in degradation in throughput compared to the existing default. Moreover, it cannot use the full capacity of the available link for different applications and network links, especially in heterogeneous network such as IoT. To cope up with these challenges, in this paper, we propose an Adaptive and Dynamic TCP Interface Architecture (ADYTIA). ADYTIA allows the usage of different TCP variants based on application and link characteristics, irrespective of the physical links of the entire path. It allows the usage of different TCP variants based on their design principle across heterogeneous technologies, platforms, and applications. ADYTIA is implemented on NS‐2 and Linux kernel for real testbed experiments. Its ability to select the best suitable TCP variant results in 20% to 80% improvement in throughput compared with the existing default and single TCP variant on Linux and Windows.     

A time-domain noise-coupling technique for continuous-time sigma-delta modulators

In this paper, a time-domain noise-coupling technique based on the pulse width modulation is proposed. The time-domain quantization error is digitally extracted and shaped by an asynchronous digital filter. This digitally filtered quantization error is applied to the quantizer input to increase the modulator’s noise-shaping order. By using this technique in continuous-time sigma-delta modulators, the modulator’s shaping property is significantly enhanced. Comparative analytical calculations and simulation results are presented to estimate the performance of modulators employing the proposed quantizer. System-level simulation results reveal a (L + 2)th order noise-shaping capability of the proposed modulator while it employs only L analog integrators. The effects of main circuit non-idealities in the modulator’s performance are analytically investigated and confirmed by the simulation results.     

Efficient and practical resource block allocation for LTE-based D2D network via graph coloring

In this paper, we construct a practical framework for efficiently allocating long term evolution (LTE) resource blocks (RB) among the users in a device-to-device (D2D) network. For such network that presumably operates under the LTE cellular network, our aim is to improve the overall throughput of D2D connections using opportunistic or fairness-based approach. Taking the practical considerations into account, our proposed framework allows a number of connections to share a single RB whenever possible, thus utilizing the radio resources. To do so, our solution first identifies a superior set of the interference-free D2D reuse groups via graph modeling and graph coloring approach. In particular, we model a D2D network with a two-overlapping disk graph for which a suitable coloring algorithm is proposed and its performance bound is calculated. Once the reuse groups are known, our solution optimizes the RB allocation among these groups based on their reported channel condition as well as the scheduling criterion, whether it is fairness-based or opportunistic. Through numerical experiments, we show that our solution can significantly improve the throughput performance of a D2D network.     

Heteroatom Effect on Star‐Shaped Hole‐Transporting Materials for Perovskite Solar Cells

Three new star‐shaped hole‐transporting materials (HTMs) incorporating benzotripyrrole, benzotrifuran, and benzotriselenophene central cores endowed with three‐armed triphenylamine moieties ( BTP‐1 , BTF‐1 , and BTSe‐1 , respectively) are designed, synthesized, and implemented in perovskite solar cells (PSCs). The impact that the heteroatom‐containing central scaffold has on the electrochemical and photophysical properties, as well as on the photovoltaic performance, is systematically investigated and compared with their sulfur‐rich analogue ( BTT‐3 ). The new HTMs exhibit suitable highest‐occupied molecular orbitals (HOMO) levels regarding the valence band of the perovskite, which ensure efficient hole extraction at the perovskite/HTM interface. The molecular structures of BTF‐1 , BTT‐3 , and BTSe‐1 are fully elucidated by single‐crystal X‐ray crystallography as toluene solvates. The optimized (FAPbI₃)_0.85(MAPbBr₃)_0.15‐based perovskite solar cells employing the tailor‐made, chalcogenide‐based HTMs exhibit remarkable power conversion efficiencies up to 18.5%, which are comparable to the devices based on the benchmark spiro‐OMeTAD. PSCs with BTP‐1 exhibit a more limited power conversion efficiency of 15.5%, with noticeable hysteresis. This systematic study indicates that chalcogenide‐based derivatives are promising HTM candidates to compete efficiently with spiro‐OMeTAD.     

New methods for enhancing fine acquisition in dual folding algorithm of long pseudo noise codes

Long code Direct Sequence Spread Spectrum is a good choice for applications where security and antispoofing ability of a spread spectrum connection is concerned. Due to long period of spreading code, acquisition is a challenge for these systems because a trade‐off between detection probability and acquisition time must be made. For confronting this challenge, various algorithms were proposed in the literature but almost all of them focus on expediting the coarse acquisition. In this paper, we consider the efficient dual folding algorithm for coarse acquisition level and propose 3 methods for enhancing the fine acquisition level leading to faster execution of overall acquisition algorithm. The methods are based on estimations from coarse acquisition level that are not used in conventional algorithms for fine acquisition, ie, zero padding. Theoretical expressions of 2 main comparison criteria in acquisition algorithms, ie, detection probability and mean acquisition time, are derived for conventional zero padding and each of the proposed method. Besides, a coarse estimate of resource consumption is provided by the number of floating point operations for each algorithm to make a useful comparison. Considering these 3 parameters, in comparison, the proposed methods surpass zero padding in 1, 2, or all of the 3 aspects. Simulation agrees well with analytical results.     

Channel estimation based on learning automata for OFDM systems

The abundant benefits of Orthogonal Frequency‐Division Multiplexing and its high flexibility have resulted in its widespread applications in many telecommunication standards. One important parameter for improving wireless system's efficiency is the accurate estimation of channel state information. In the literatures, many techniques have been studied in order to estimate the channel state information. Nowadays, the techniques based on intelligent algorithms such as genetic algorithm and particle swarm optimization (PSO) have attracted attention of researchers. With a very low pilot overhead, these techniques are able to estimate the channel frequency response properly only using the received signals. Unfortunately, each of these techniques suffers a common weakness: they have a slow convergence rate. In this paper, a new intelligent and different method has been presented for channel estimation using learning automata, entitled LA estimator, where the learning automata are search agents, and each pair is responsible for searching 1 complex coefficient of the channel frequency response. This method can achieve an accurate channel estimation with a moderate computational complexity in comparison with GA and PSO estimators. Furthermore, with higher convergence rate, our proposed method is capable of providing the same performance as GA and PSO. For a 2‐path fast fading channel, simulation results demonstrate the robustness of our proposed scheme according to the bit error rate and the mean square error.     

Dependability analysis for characterizing Google cluster reliability

Cloud solutions are emerging as a new suitable way of transforming traditional IT data centers to highly available and reliable computing resources for hosting critical applications and data. However, software and hardware failures are a common problem in cloud datacenters that can lead to harmful damages. In this paper, we analyze the physical server failures in the Google cloud datacenter. We study the Google cluster properties to investigate the relationship among physical servers' failure rate and jobs failure events. The failure rate of Google cluster executed jobs and servers is taken into consideration during a 29‐day period. We present a reliability model for Google cluster physical machines using the continuous time Markov chains according to this observation. We attempt to analyze the obtained model through SHARPE software packages to improve the understanding of failure events in the Google cloud cluster. We also explore the cluster availability based on parameters like steady‐state availability, steady‐state unavailability, mean time to failure, and mean time to repair in the Google cluster.