In this letter, we propose a simple but accurate calculation method, that is, an approximate closed-form equation of average bit error rate in DPSK/OFDM systems with post-detection diversity reception over both time- and frequency-selective Rayleigh fading channels. The validity of the proposed method is verified by the fact that BER performances given by the derived equation coincide with those by Monte Carlo simulation.

This paper applies iterative multiuser detection employing a new channel estimation scheme to multicarrier interleave-division multiple access (MC-IDMA), called OFDM-IDMA, which is expected to offer improved spectral efficiency in mobile communications. The MC-IDMA transmitter uses both a low-rate channel code and an individual chip interleaver for each user. The MC-IDMA receiver, which this paper focuses upon, repeats the iterative multiuser detection and soft decision-directed channel estimation (SDCE) by exploiting log-likelihood ratios (LLRs) of the coded bits which the maximum a posteriori (MAP)-based channel decoders for all users provide. SDCE estimates channel impulse responses of all users by the least-mean-square (LMS) algorithm, which aims to minimize the mean squared error between the received signal and its replica. This paper investigates the performance of MC-IDMA employing SDCE and compares it with those of three MC-CDMA techniques. Computer simulations demonstrate that MC-IDMA employing SDCE outperforms time-spread MC-CDMA and frequency-spread MC-CDMA, and that it can achieve almost the same bit error rate performance as chip-interleaved MC-CDMA while requiring lower complexity.

We analyze the carrier dynamics in MOSFETs under low-voltage operation. For this purpose the displacement (charging/discharging) current, induced during switching operations is studied experimentally and theoretically for a 90 nm CMOS technology. It is found that the experimental transient characteristics can only be well reproduced in the circuit simulation of low voltage applications by considering the carrier-transit delay in the compact MOSFET model. Long carrier transit delay under the low voltage switching-on operation results in long duration of the displacement current flow. On the other hand, the switching-off characteristics are independent of the bias condition.

Single-carrier (SC) multiple access is a promising uplink multiple access technique because of its low peak-to-average power ratio (PAPR) property and high frequency diversity gain that is achievable through simple one-tap frequency-domain equalization (FDE) in a strong frequency-selective channel. The multiple access capability can be obtained by combining either frequency division multiple access (FDMA) or code division multiple access (CDMA) with SC transmission. In this article, we review the recent research on the SC multiple access techniques with one-tap FDE. After introducing the principle of joint FDE/antenna diversity combining, we review various SC multiple access techniques with one-tap FDE, i.e., SC-FDMA, SC-CDMA, block spread CDMA, and delay-time/CDMA.

This paper investigates the uplink throughput performance and the interference power to other cells using an Evolved UTRA (E-UTRA) laboratory and field experimental system. In E-UTRA uplink, the near-far problem is not an issue since the orthgonality among the users within the target cell is maintained. Therefore, the fractional transmission power control (TPC), in which the target level of TPC is adjusted according to the path loss level, can be adopted. Thus, it is expected the high cell throughput and the large coverage area by combining fractional TPC, adaptive modulation and channel coding (AMC), and variable resource block (RB) allocation. The indoor and field experimental results show that the peak throughput of approximately 45 Mbps is achieved by allocating a wider bandwidth and setting higher target level for the UE located near the cell site while keeping the adjacent cell interference level almost the constant. We also showed that the system capacity can be improved by 50% in simple cell model by applying the AMC and the fractional TPC.

The paper demonstrates a novel two-peak negative differential resistance (NDR) circuit combining Si-based metal-oxide-semiconductor field-effect-transistor (MOS) and SiGe-based heterojunction bipolar transistor (HBT). Compared to the resonant-tunneling diode, MOS-HBT-NDR has two major advantages in our circuit design. One is that the fabrication of this MOS-HBT-NDR-based application can be fully implemented by the standard BiCMOS process. Another is that the peak current can be effectively adjusted by the controlled voltage. The peak-to-valley current ratio is about 4136 and 9.4 at the first and second peak respectively. It is very useful for circuit designers to consider the NDR-based applications.

Quantum circuits for elementary arithmetic operations are important not only for implementing Shor's factoring algorithm on a quantum computer but also for understanding the computational power of small quantum circuits, such as linear-size or logarithmic-depth quantum circuits. This paper surveys some recent approaches to constructing efficient quantum circuits for elementary arithmetic operations and their applications to Shor's factoring algorithm. It covers addition, comparison, and the quantum Fourier transform used for addition.

Given a sparse linear system, A x = b, we can solve the equivalent system P A PT y = P b, x = PT y, where P is a permutation matrix. It has been known that, for example, when P is the RCMK (Reverse Cuthill-Mckee) ordering permutation, the convergence rate of the Krylov subspace method combined with the ILU-type preconditioner is often enhanced, especially if the matrix A is highly nonsymmetric. In this paper we offer a reordering heuristic for accelerating the solution of large sparse linear systems by the Krylov subspace methods with the ILUT preconditioner. It is the LRB (Line Red/Black) ordering based on the well-known 2-point Red-Black ordering. We show that for some model-like PDE (partial differential equation)s the LRB ordered FDM (Finite Difference Method)/FEM (Finite Element Method) discretization matrices require much less fill-ins in the ILUT factorizations than those of the Natural ordering and the RCMK ordering and hence, produces a more accurate preconditioner, if a high level of fill-in is used. It implies that the LRB ordering could outperform the other two orderings combined with the ILUT preconditioned Krylov subspace method if the level of fill-in is high enough. We compare the performance of our heuristic with that of the RCMK (Reverse Cuthill-McKee) ordering. Our test matrices are obtained from various standard discretizations of two-dimensional and three-dimensional model-like PDEs on structured grids by the FDM or the FEM. We claim that for the resulting matrices the performance of our reordering strategy for the Krylov subspace method combined with the ILUT preconditioner is superior to that of RCMK ordering, when the proper number of fill-in was used for the ILUT. Also, while the RCMK ordering is known to have little advantage over the Natural ordering in the case of symmetric matrices, the LRB ordering still can improve the convergence rate, even if the matrices are symmetric.

Frequency-domain equalization (FDE) based on the minimum mean square error (MMSE) criterion can provide a better bit error rate (BER) performance than rake combining. To further improve the BER performance, cyclic delay transmit diversity (CDTD) can be used. CDTD simultaneously transmits the same signal from different antennas after adding different cyclic delays to increase the number of equivalent propagation paths. Although a joint use of CDTD and MMSE-FDE for direct sequence code division multiple access (DS-CDMA) achieves larger frequency diversity gain, the BER performance improvement is limited by the residual inter-chip interference (ICI) after FDE. In this paper, we propose joint FDE and despreading for DS-CDMA using CDTD. Equalization and despreading are simultaneously performed in the frequency-domain to suppress the residual ICI after FDE. A theoretical conditional BER analysis is presented for the given channel condition. The BER analysis is confirmed by computer simulation.

Interconnection networks play a crucial role in the performance of massively parallel computers. Hierarchical interconnection networks provide high performance at low cost by exploring the locality that exists in the communication patterns of massively parallel computers. A Tori connected Torus Network (TTN) is a 2D-torus network of multiple basic modules, in which the basic modules are 2D-torus networks that are hierarchically interconnected for higher-level networks. This paper addresses the architectural details of the TTN and explores aspects such as node degree, network diameter, cost, average distance, arc connectivity, bisection width, and wiring complexity. We also present a deadlock-free routing algorithm for the TTN using four virtual channels and evaluate the network's dynamic communication performance using the proposed routing algorithm under uniform and various non-uniform traffic patterns. We evaluate the dynamic communication performance of TTN, TESH, MH3DT, mesh, and torus networks by computer simulation. It is shown that the TTN possesses several attractive features, including constant node degree, small diameter, low cost, small average distance, moderate (neither too low, nor too high) bisection width, and high throughput and very low zero load latency, which provide better dynamic communication performance than that of other conventional and hierarchical networks.

Considering rapid increase of recent highly organized and sophisticated malwares, practical solutions for the countermeasures against malwares especially related to zero-day attacks should be effectively developed in an urgent manner. Several research activities have been already carried out focusing on statistic calculation of network events by means of global network sensors (so-called macroscopic approach) as well as on direct malware analysis such as code analysis (so-called microscopic approach). However, in the current research activities, it is not clear at all how to inter-correlate between network behaviors obtained from macroscopic approach and malware behaviors obtained from microscopic approach. In this paper, in one side, network behaviors observed from darknet are strictly analyzed to produce scan profiles, and in the other side, malware behaviors obtained from honeypots are correctly analyzed so as to produce a set of profiles containing malware characteristics. To this end, inter-relationship between above two types of profiles is practically discussed and studied so that frequently observed malwares behaviors can be finally identified in view of scan-malware chain.

We fabricated a high-speed wavelength tunable arrayed-waveguide grating (AWG) and an AWG integrated with optical switches using (Pb,La)(Zr,Ti)O3-(PLZT). PLZT has a high electro-optic (EO) coefficient, which means these devices have considerable potential for use in reconfigurable optical add drop multiplexers (ROADMs). The PLZT waveguides in this work have a rib waveguide structure with an effective relative index difference (Δ) of 0.65%. Both AWGs have 8 channels with a frequency spacing of 500 GHz. The fabricated wavelength tunable AWGs allows us to freely shift the output at a particular wavelength to an arbitrary port by applying voltages to 3 mm long electrodes formed on each of the waveguides. We confirmed that the maximum tuning range with driving voltage of 22 V was approximately 32 nm at 1.55 µm. With the integrated 8-ch PLZT waveguide switch array, we could also select the output port by setting the drive voltage applied to the switch array. 2 2 directional coupler switches were used for the switch array. The two devices exhibited insertion losses of 17 dB and 19 dB, adjacent crosstalk of -18.5 dB and -19.7 dB, and a maximum extinction ratio of 19.6 dB and 12.6 dB, respectively. The tuning speed of both devices was 15 ns and their physical sizes were 9.0 23.0 mm and 8.0 29.5 mm, respectively.

The emergence of Web 2.0 technologies such as Ajax and Mashup has revealed the weakness of the same-origin policy [1], the current de facto standard for the Web browser security model. We propose a new browser security model to allow fine-grained access control in the client-side Web applications for secure mashup and user-generated contents. We propose a browser security model that is based on information-flow-based access control (IBAC) to overcome the dynamic nature of the client-side Web applications and to accurately determine the privilege of scripts in the event-driven programming model.

Pairing-based cryptography provides us many novel cryptographic applications such as ID-based cryptosystems and efficient broadcast encryptions. The security problems in ubiquitous sensor networks have been discussed in many papers, and pairing-based cryptography is a crucial technique to solve them. Due to the limited resources in the current sensor node, it is challenged to optimize the implementation of pairings on sensor nodes. In this paper we present an efficient implementation of pairing over MICAz, which is widely used as a sensor node for ubiquitous sensor network. We improved the speed of ηT pairing by using a new efficient multiplication specialized for ATmega128L, called the block comb method and several optimization techniques to save the number of data load/store operations. The timing of ηT pairing over GF(2239) achieves about 1.93 sec, which is the fastest implementation of pairing over MICAz to the best of our knowledge. From our dramatic improvement, we now have much high possibility to make pairing-based cryptography for ubiquitous sensor networks practical.

Ant colony optimization (ACO) algorithms are a recently developed, population-based approach which has been successfully applied to optimization problems. However, in the ACO algorithms it is difficult to adjust the balance between intensification and diversification and thus the performance is not always very well. In this work, we propose an improved ACO algorithm in which some of ants can evolve by performing genetic operation, and the balance between intensification and diversification can be adjusted by numbers of ants which perform genetic operation. The proposed algorithm is tested by simulating the Traveling Salesman Problem (TSP). Experimental studies show that the proposed ACO algorithm with genetic operation has superior performance when compared to other existing ACO algorithms.

This letter investigates a subchannel and power allocation (SPA) algorithm which maximizes the throughput of a user under the constraints of total transmit power and fair subchannel occupation among relay nodes. The proposed algorithm reduces computational complexity from exponential to linear in the number of subchannels at the expense of a small performance loss.

Recently, various types of 3-D nonvolatile memory (NVM) devices have been researched to improve the integration density [1]-[3]. The NVM device of pillar structure can be considered as one of the candidates [4],[5]. When this is applied to a NAND flash memory array, bottom end of the device channel is connected to the bulk silicon. In this case, the current in vertical direction varies depending on the thickness of silicon channel. When the channel is thick, the difference of saturation current levels between on/off states of individual device is more obvious. On the other hand, when the channel is thin, the on/off current increases simultaneously whereas the saturation currents do not differ very much. The reason is that the channel potential barrier seen by drain electrons is lowered by read voltage on the opposite sidewall control gate. This phenomenon that can occur in 3-D structure devices due to proximity can be called gate-induced barrier lowering (GIBL). In this work, the dependence of GIBL on silicon channel thickness is investigated, which will be the criteria in the implementation of reliable ultra-small NVM devices.

In digital communication systems employing binary phase-shift keying and non-data-aided carrier phase recovery, a 180 carrier phase ambiguity is inevitable. Here, we propose a simple modification to the standard regular repeat-accumulate (RA) code structure by exploiting the differential encoding inherent to the inner encoder of RA codes resulting in codes that are 180 rotationally invariant. The proposed code structure exhibit performance virtually identical to that of standard regular RA codes with zero carrier phase offset under both zero and 180 carrier phase offsets with negligible additional hardware complexity.

We have studied the formation of Pd-nanodots on SiO2 from ultrathin Pd films being exposed to remote hydrogen plasma at room temperature, in which parameters such as the gas pressure and input power to generate H2 plasma and the Pd film thickness were selected to get some insights into surface migration of Pd atoms induced with atomic hydrogen irradiation and resultant agglomeration with cohesive action. The areal dot density was controlled in the range from 3.4 to 6.51011 cm - 2 while the dot size distribution was changed from 7 to 1.5 in average dot height with 40% variation in full-width at half maximum. We also fabricated MOS capacitors with a Pd-nanodots floating gate and confirmed the flat-band voltage shift in capacitance-voltage characteristic due to electron injection to and emission from the dots floating gate.

Fair allocation of bandwidth and maximization of channel utilization are two important issues when designing a contention-based wireless medium access control (MAC) protocol. However, fulfilling both design goals at the same time is very difficult. Considering the problem in the IEEE 802.11 wireless local area networks (WLANs), in this work we propose a method using a p-persistent enhanced DCF, called P-IEEE 802.11 DCF, to achieve weighted fairness and efficient channel utilization among multiple priority classes in a WLAN. Its key idea is that when the back-off timer of a node reaches zero, the transmission probability is properly controlled to reflect the relative weights among data traffic flows so as to maximize the aggregate throughput and to minimize the frame delay at the same time. In particular, we obtain the optimal transmission probability based on a theoretical analysis, and also provide an approximation to this probability. The derived optimal and approximation are all evaluated numerically and simulated with different scenarios. The results show that the proposed method can fulfill our design goals under different numbers of priority classes and different numbers of nodes.