The history of forward error correction in optical communications is reviewed. The various types of FEC are classified as belonging to three generations. The first generation FEC represents the first to be successful in submarine systems, when the use of RS(255, 239) became widespread as ITU-T G.975, and also as G.709 for terrestrial systems. As WDM systems matured, a quest began for a stronger second generation FEC. Several types of concatenated code were proposed for this, and were installed in commercial systems. The advent of third-generation FEC opened up new vistas for the next generation of optical communication systems. Thanks to soft decision decoding and block turbo codes, a net coding gain of 10.1 dB has been demonstrated experimentally. That brought us a number of positive impacts on existing systems. Each new generation of FEC was compared in terms of the ultimate coding gain. The Shannon limit was discussed for hard or soft decision decoding. Several functionalities employing the FEC framing were introduced, such as overall wrapping by the FEC frame enabling the asynchronous multiplexing of different clients' data. Fast polarization scrambling with FEC was effective in mitigating polarization mode dispersion, and the error monitor function proved useful for the adaptive equalization of both chromatic dispersion and PMD.

When an application code is downloaded from an unknown server to the mobile device, it is important to authenticate the code. Usually, code execution is overlapped with downloading to reduce transfer/invocation delay. In this letter, we present an efficient code authentication scheme that permits overlapping of execution and downloading when the sequence of code execution is determined during the execution time. The proposed scheme is based on authentication trees. Compared with the tree chaining scheme, the proposed scheme has lower communication overhead and shorter average verification delay. Also, the computation cost of the proposed scheme on the receiver is much smaller than that of the tree chaining scheme.

In this paper, we present the condition for the effective wire addition in Look-Up-Table-based (LUT-based) field programmable gate array (FPGA) circuits, and an optimization procedure utilizing the effective wire addition. Each wire has different characteristics, such as delay and power dissipation. Therefore, the replacement of one critical wire for the circuit performance with many non-critical ones, i.e., many-addition-for-one-removal (m-for-1) is sufficiently useful. However, the conventional logic optimization methods based on sets of pairs of functions to be distinguished (SPFDs) for LUT-based FPGA circuits do not make use of the m-for-1 manipulation, and perform only simple replacement and removal, i.e., the one-addition-for-one-removal (1-for-1) manipulation and the no-addition-for-one-removal (0-for-1) manipulation, respectively. Since each LUT can realize an arbitrary internal function with respect to a specified number of input variables, there is no sufficient condition at the logic design level for simple wire addition. Moreover, in general, simple addition of a wire has no effects for removal of another wire, and it is important to derive the condition for non-simple and effective wire addition. We found the SPFD-based condition that wire addition is likely to make another wire redundant or replaceable, and developed an optimization procedure utilizing this effective wire addition. According to the experimental results, when we focused on the delay reduction of LUT-based FPGA circuits, our method reduced the delay by 24.2% from the initial circuits, while the conventional SPFD-based logic optimization and the enhanced global rewiring reduced it by 14.2% and 18.0%, respectively. Thus, our method presented in this paper is sufficiently practical, and is expected to improve the circuit performance.

This paper presents an analytical model for the electromagnetic radiation in multi-microstrip lines covering the frequency range from 30 MHz to 1 GHz. The radiated emissions of multi-microstrip structure can be divided into the summation of radiated emissions of multi-individual microstrip structures. It is done by modelling the imperfect ground effect of the PCBs. Here we present a circuit model based on traditional transmission lines (TMLs) model. For more accurate analysis of the imperfect ground effect in multi-microstrip lines, we will divide the equivalent circuit model into N sections, based on transverse electromagnetic (TEM) assumption, to estimate the electromagnetic interference (EMI) of multi-microstrip lines. The quantitative value of induced current distribution along the ground return path depends on the physical size, geometry and length of ground trace. Measured data are presented to confirm the results of numerical analysis and the computer simulations with a software package based on the Finite Element Method. A knowledge of EMI source mechanism and their relationship to layout geometries is necessary to determine the essential features that must be modelled to estimate emissions in PCBs design.

This paper discusses the least-squares linear filtering and fixed-lag smoothing problems of discrete-time signals from uncertain observations when the random interruptions in the observation process are modelled by a sequence of not necessarily independent Bernoulli variables. It is assumed that the observations are perturbed by white noise and the autocovariance function of the signal is factorizable. Using an innovation approach we obtain the filtering and fixed-lag smoothing recursive algorithms, which do not require the knowledge of the state-space model generating the signal. Besides the observed values, they use only the matrix functions defining the factorizable autocovariance function of the signal, the noise autocovariance function, the marginal probabilities and the (2,2)-element of the conditional probability matrices of the Bernoulli variables. The algorithms are applied to estimate a scalar signal which may be transmitted through one of two channels.

This letter derives a new exact and general closed-form expression involving a two-dimensional joint Gaussian Q-function for the symbol error rate (SER) of M-ary Phase Shift Keying (MPSK) under an additive white Gaussian noise (AWGN) channel. By using two rotations of coordinates the correlation coefficient between two Gaussian random vectors is provided, then with the derived correlation coefficient that characterizes the two-dimensional joint Gaussian Q-function, a new expression for the SER of MPSK is presented. The derived new SER expression offers a convenient method to evaluate the performances of MPSK for various cases of practical interest.

Holey Fiber (HF) technology has progressed rapidly in recent years and has resulted in the development of a wide range of optical fibers with unique and highly useful optical properties including endlessly single-mode guidance, and high optical nonlinearity. In this paper the state-of-the-art HF technology for all-optical signal processing devices is reviewed from a perspective of possible application for telecommunications.

High-resolution spectrum estimation techniques have been extensively studied in recent publications. Knowledge of the noise variance is vital for spectrum estimation from noise-corrupted observations. This paper presents the use of noise compensation and data extrapolation for spectrum estimation. We assume that the observed data sequence can be represented by a set of autoregressive parameters. A recently proposed iterative algorithm is then used for noise variance estimation while autoregressive parameters are used for data extrapolation. We also present analytical results to show the exponential decay characteristics of the extrapolated samples and the frequency domain smoothing effect of data extrapolation. Some statistical results are also derived. The proposed noise-compensated data extrapolation approach is applied to both the autoregressive and FFT-based spectrum estimation methods. Finally, simulation results show the superiority of the method in terms of bias reduction and resolution improvement for sinusoids buried in noise.

A waveguide crossed-slot linear array with a matching element is accurately analyzed and designed by the method of moments using numerical-eigenmode basis functions developed by the authors. The rounded ends of crossed-slots are accurately modeled in the analysis. The initial values of the slot parameters determined by a model with assumption of periodicity of field are modified and refined by the full-wave finite-array analysis for uniform excitation and small axial ratio. As an example, an 8-element linear array is designed at 11.85 GHz, which radiates a circularly polarized wave at a beam-tilting angle of 50 degrees. The radiation pattern, the frequency characteristics of the reflection and the axial ratio are compared between the analysis and the measurement and they agree very well. The calculated and measured axial ratio at the beam direction are 0.1 dB and 1.7 dB, respectively. This method provides a basic and powerful design tool for slotted waveguide arrays.

Projection-based model reductions become a necessity for efficient interconnect modeling and simulations. In order to choose the order of the reduced system that can really reflect the essential dynamics of the original interconnect, the residual error of the transfer function can be considered as a stopping criteria to terminate the Arnoldi iteration process. Analytical expressions of this residual error are derived in detail. Furthermore, it can be found that the approximate transfer function can also be expressed as the original interconnect model with some additive perturbations. The perturbation matrix only involves resultant vectors at the previous step of the Arnoldi algorithm. These error information will provide a guideline for the order selection scheme used in the Krylov subspace model-order algorithm.

We briefly survey recent developments in the thin film synthesis and junction fabrication of MgB2 toward superconducting electronics. The most serious problem in the thin film synthesis of MgB2 is the high vapor pressure required for phase stability. This problem makes in-situ film growth difficult. However, there has been substantial progress in thin film technology for MgB2 in the past three years. The low-temperature thin-film process in a UHV chamber can produce high-quality MgB2 films with Tc 35 K. Furthermore, technology to produce single-crystal epitaxial MgB2 films has recently been developed by using hybrid physical-chemical vapor deposition. With regard to Josephson junctions, various types of junctions have been fabricated, all of which indicate that MgB2 has potential for superconducting devices that operate at 20-30 K, the temperature reached by current commercial cryocoolers.

The complete subtree (CS) method is widely accepted for the broadcast encryption. A new method for assigning keys in the CS method is proposed in this paper. The essential idea behind the proposed method is to use two trapdoor permutations. Using the trapdoor information, the key management center computes and assigns a key to each terminal so that the terminal can derive all information necessary in the CS method. A terminal has to keep just one key, while log2 N + 1 keys were needed in the original CS method where N is the number of all terminals. The permutations to be used need to satisfy a certain property which is similar to but slightly different from the claw-free property. The needed property, named strongly semi-claw-free property, is formalized in terms of probabilistic polynomial time algorithm, and its relation to the claw-free property is discussed. It is also shown that if the used permutations fulfill the strongly semi-claw-free property, then the proposed method is secure against attacks of malicious users.

Since the interference is quite related to the performance of CDMA cellular systems, it is necessary to estimate Other-Cell-Interference Factor (OCIF). Here, starting from OCIF calculation for an aeronautical communication system, we investigate the forward link performance of data packet transmission in which the capacity, throughput and delay of the system are measured. To the numerical results, one can see that the performance of the aeronautical communication system is worse than that for terrestrial cellular systems and also depends logarithmically on both the cell radius and height.

The complete subtree (CS) method is one of the most well-known broadcast encryptions which do not enforce the receivers to keep "online." This paper is to reduce the size of secret information which must be stored in a terminal of the method. In the original CS method, the size of the secret information increases as the number of terminals increases. It is shown in this paper that, by making use of a one-way trapdoor permutation, we can make the size constant regardless of the number of terminals. The security of the proposed scheme is investigated, and detailed comparison with other similar schemes is presented. The proposed scheme is suitable for practical implementations of the CS method.

This paper proposes a scattered-pilot-OFDM reception scheme employing turbo inter-carrier interference (ICI) cancellation in the fast varying fading environments of mobile communications. In the OFDM transmission, the orthogonality among the subcarriers cannot hold due to large Doppler shift, and the OFDM signal suffers from severe degradation due to ICI. The proposed receiver carries out two modes: (i) a coherent detection (CD) mode, and (ii) a turbo ICI cancellation (TC) mode. Initially, the receiver performs the CD mode. When any decision errors are detected, it shifts from the CD mode to the TC one that carries out both the ICI cancellation and the channel estimation by using the decoder output (the log likelihood ratio). In addition, the iteration of the TC mode can improve the accuracy of the channel estimation and ICI cancellation ability. Computer simulations following specifications for the mobile reception mode in the digital terrestrial television broadcasting demonstrate that the receiver can effectively cancel ICI due to the fast varying fading, and that its average BER performance is much better than that of CD.

In this work we give an extension of Kauffman's NK-Landscapes to multiobjective MNK-Landscapes in order to study the effects of epistasis on the performance of multiobjective evolutionary algorithms (MOEAs). This paper focuses on the development of multiobjective random one-bit climbers (moRBCs). We incrementally build several moRBCs and analyze basic working principles of state of the art MOEAs on landscapes of increased epistatic complexity and number of objectives. We specially study the effects of Pareto dominance, non-dominance, and the use of memory and a population to influence the search. We choose an elitist non-dominated sorting multiobjective genetic algorithm (NSGA-II) as a representative of the latest generation of MOEAs and include its results for comparison. We detail the behavior of the climbers and show that population based moRBCs outperform NSGA-II for all values of M and K.

Extensive studies have been made of the public key cryptosystems based on multivariate polynomials over F2. However most of the proposed public key cryptosystems based on multivariate polynomials, are proved not secure. In this paper, we propose several types of new constructions of public key cryptosystems based on randomly generated singular simultaneous equations. One of the features of the proposed cryptosystems is that the sets of random singular simultaneous equations significantly enlarges the size of the transformation.

For fixed initial and destination states (i.e., markings), M0 and Md, there exist generally infinite firing count vectors in a Petri net. In this letter, it is shown that all fundamental particular solutions as well as all minimal T-invariants w.r.t. firing count vectors are needed to express an arbitrary firing count vector for the fixed M0 and Md. An algorithm for finding a special firing count vector which is expressed by using the only one specified fundamental particular solution is also given.

A new moment computation technique for general lumped R(L)C interconnect circuits with multiple resistor loops is proposed. Using the concept of tearing, a lumped R(L)C network can be partitioned into a spanning tree and several resistor links. The contributions of network moments from each tree and the corresponding links can be determined independently. By combining the conventional moment computation algorithms and the reduced ordered binary decision diagram (ROBDD), the proposed method can compute system moments efficiently. Experimental results have demonstrate that the proposed method can indeed obtain accurate moments and is more efficient than the conventional approach.

The Transduction Method is a powerful way to design logic circuits, utilizing already existing circuits. A set of permissible functions (SPF) plays an essential role in such circuit transformation/reduction, and is computed at each point (connection or gate output). Currently, two types of SPFs have been used: the maximum SPFs (MSPFs) and compatible SPFs (CSPFs). At each point, the MSPF is literally the set of all PF's, and CSPF is a subset of the MSPF. When CSPFs are calculated, priorities are first assigned to all gates in the circuit. Based on the priorities, it is decided which subset is to be selected as the CSPF. The quality of the results depends on the priorities. In this paper, the concept of super-sets of permissible functions (SSPFs) is introduced to reduce the effect of the priorities that CSPFs depend on. In order to loosen the dependency, each SSPF is computed to contain CSPFs which are candidates to be selected. The experimental results show that the SSPF-based Transduction Method has intermediate reduction capability and takes an intermediate computation time between the MSPF-based and CSPF-based ones. The capability and the time are considered as an acceptably good trade-off. In addition, without any transformations, since SSPFs are the maximum super-set, SSPFs are applicable for analyzing the maximum performance of the CSPF-based transformation, for comparison with the MSPF-based one. Theoretically, the number of connectable gate pairs detected by the MSPFs is 100%. According to the experimental results obtained using SSPFs, on average, 99% are detectable by SSPFs and 1% are detectable only by using the MSPFs. The results show that by using CSPFs, 72% of connectable gate pairs are detectable with any priority assignment and 99% (SSPFs capability) are detectable on average even when the best priorities are assigned. According to the experimental results of CSPF calculation with five priorities, 82% to 93% are practically detectable on average. This is the first quantitative analysis realized by SSPFs which compares the CSPF-based and MSPF-based Transduction Methods with respect to the coverage of PF's.