In many cryptographic applications, a large-order finite field is used as a definition field, and accordingly, many researches on a fast implementation of such a large-order extension field are reported. This paper proposes a definition field Fpm with its characteristic p a pseudo Mersenne number, the modular polynomial f(x) an irreducible all-one polynomial (AOP), and using a suitable basis. In this paper, we refer to this extension field as an all-one polynomial field (AOPF) and to its basis as pseudo polynomial basis (PPB). Among basic arithmetic operations in AOPF, a multiplication between non-zero elements and an inversion of a non-zero element are especially time-consuming. As a fast realization of the former, we propose cyclic vector multiplication algorithm (CVMA), which can be used for possible extension degree m and exploit a symmetric structure of multiplicands in order to reduce the number of operations. Accordingly, CVMA attains a 50% reduction of the number of scalar multiplications as compared to the usually adopted vector multiplication procedure. For fast realization of inversion, we use the Itoh-Tsujii algorithm (ITA) accompanied with Frobenius mapping (FM). Since this paper adopts the PPB, FM can be performed without any calculations. In addition to this feature, ITA over AOPF can be composed with self reciprocal vectors, and by using CVMA this fact can also save computation cost for inversion.

We investigate the statistical features of both random- and chaos-based FM timing signals to ascertain their applicability to digital circuits and systems. To achieve such a goal, we consider both the case of single- and two-phase logic and characterize the random variable representing, respectively, the time lag between two subsequent rising edges or between two consecutive zero-crossing points of the modulated timing signal. In particular, we determine its probability density and compute its mean value and variance for cases which are relevant for reducing Electromagnetic emissions. Finally, we address the possible problems of performance degradation in a digital system driven by a modulated timing signal and to cope with this we give some guidelines for the proper choice of the statistical properties of the modulating signals.

In this letter, we propose a robust IFDD scheme employing an interference canceller, which is used for mitigating interferences from the transmitting signal instead of complex filter bank to reduce the complexity, for the OFDM system using feedback information. According to simulation results, the proposed IFDD OFDM system does not show significant performance degradation but maintains the robustness against the fast time-varying multipath channel, while the TDD OFDM system estimating feedback information from receiving block makes serious performance degradation.

In this letter, we present a normalized least-mean-square algorithm of blind estimator for carrier frequency offset estimation of orthogonal frequency division multiplexing systems. In conjunction with the closed-loop estimate structure, the proposed efficient algorithm eliminates the inter-carrier interference for time varying carrier frequency offset. The proposed algorithm offers faster convergence speed and more accuracy to the carrier frequency offset estimate. Several computer simulation examples are presented for illustrating and effectiveness of the proposed algorithm.

With the aim of applying a MISS tunnel-diode cell to a high-density RAM, we studied its problems and developed three circuit technologies to solve them. The first, a standby-voltage control scheme, reduces standby currents and increases the signal current by 3.4 times compared to the conventional one. The second, a hierarchical bit-line structure, reduces the number of memory cells in a bit-line without increasing the number of sense amplifiers. The third, a twin-dummy-cell technique, generates a proper reference signal to discriminate read currents. These technologies enable a capacitorless MISS diode cell with an effective cell area of 6F 2 (F: minimum feature size) to be applied to a high-density RAM.

A reduced complexity multiple-input multiple-output (MIMO) equalizer with ordered successive interference cancellation (OSIC) is proposed for combating intersymbol interference (ISI) and cochannel interference (CCI) over frequency-selective multipath channels. It is developed as a reduced-rank realization of the conventional MMSE decision feedback equalizer (DFE). In particular, the MMSE weight vectors at each stage of OSIC are computed based on the generalized sidelobe canceller (GSC) technique and reduced-rank processing is incorporated by using the conjugate gradient (CG) algorithm for reduced complexity implementation. The CG algorithm leads to a best low-rank representation of the GSC blocking matrix via an iterative procedure, which in turn gives a reduced-rank equalizer weight vector achieving the best compromise between ISI and CCI suppression. With the dominating interference successfully cancelled at each stage of OSIC, the number of iterations required for the convergence of the CG algorithm decreases accordingly for the desired signal. Computer simulations demonstrate that the proposed reduced-rank MIMO DFE can achieve nearly the same performance as the full-rank MIMO MMSE DFE with an effective rank much lower than the dimension of the signal-plus-interference subspace.

A minimum feedback node set in a graph is a minimum node subset whose deletion makes the graph acyclic. Its detection in a dependency graph is important to recover from a deadlock configuration. A livelock configuration is also avoidable if a check point is set in each node in the minimum feedback node set. Hence, its detection is very important to establish dependable network systems. In this letter, we give a minimum feedback node set in a trivalent Cayley graph. Assuming that each word has n bits, for any node, we can judge if it is included in the set or not in constant time.

Interconnection networks usually suffer from Little's Law: low cost implies low performance and high performance is obtained high cost. However, hierarchical interconnection networks provide high performance at low cost by exploring the locality that exists in communication patterns of massively parallel computers. In this paper, we propose a new hierarchical interconnection network, called Hierarchical Torus Network (HTN). This network reduces the number of vertical links in 3D stacked implementation while maintaining good network features. This paper addresses the architectural details of the HTN, and explores aspects such as the network diameter, average distance, bisection width, peak number of vertical links, and VLSI layout area of the HTN as well as for several commonly used networks for parallel computers. It is shown that the HTN possesses several attractive features including small diameter, small average distance, small number of wires, a particularly small number of vertical links, and economic layout area.

In a question-answering (QA) task, "real" information retrieval, rather than document retrieval is required. Effective QA thus involves complicated and time-consuming processing, such as natural language processing and named-entity processing. To reduce the amount of processing needed, the quantity of documents in a database can be narrowed down during an initial stage of the answering procedure. This paper proposes a new evaluation measurement and compares the retrieval accuracy of initial-stage searching that uses "overall" document retrieval and "partial" passage retrieval with the TREC QA data set. The initial search and final result accuracy for various cutoff points defined according to the number of documents or words that are output is evaluated. A variety of experiments demonstrate that middle-length passage-retrieval is effective for QA, and short-length passage-retrieval could improve the accuracy of the final result for a specific question type.

A digital power amplifier is combined with an analog power amplifier via a new ripple feedback filter for high power audio amplifier. Both high fidelity and high efficiency are achieved owing to the proposed filter in combination with a dynamic control of switching frequency. A prototype having a rated power of 2 kW is built for live concert use and tested successfully.

In this letter, we present groupwise successive interference cancellation (GSIC) receiver with adaptive minimum mean squared error (MMSE) detection and extended GSIC (EGSIC) receiver with adaptive MMSE detection for dual-rate DS-CDMA system. The receivers are GSIC receiver and EGSIC receiver combined with adaptive MMSE detection which is introduced to make initial bit detection more reliable. Furthermore, a multi-user detection scheme is introduced to mitigate the effect of multiple access interference (MAI) between users in a group which is usually ignored in conventional GSIC receiver and EGSIC receiver. Specifically, parallel interference cancellation (PIC) is adopted as a multi-user detection scheme within a group. It is shown that performance of the GSIC receiver and EGSIC receiver is significantly improved by employing adaptive MMSE detection. It is also shown that the performance of the receivers can be improved further by using PIC within a group.

Digital watermarking systems are required to embed as much information as possible in a digital media without the perceptual distortion as well as to extract it correctly with high probabilities, even though the media is subjected to many kinds of operations. To this end, guided scrambling (GS) techniques, usually used for a recording channel, are applied to digital watermarking systems. A simple GS scheme can make the power of a watermark signal larger against the power of media noise under the condition of preserving the perceptual fidelity, resulting in smaller error probabilities of the retrieved watermark bits. In addition, watermarking systems based on the GS can have more robustness to some specified operations if the prior information on the operations is given to the embedder. JPEG compression is a good example of such an operation when still images are transmitted over the Internet. In order for watermark signals to be more tolerable to the known JPEG attack, the GS-based watermark embedder is informed of advance knowledge of the JPEG compression. Further, a configuration of the GS concatenated with turbo coding is introduced to lower the bit error rate more.

The objective of this study was to explore suitable spatial filters for inverse estimation of cortical potentials from the scalp electroencephalogram. The effect of incorporating noise covariance into inverse procedures was examined by computer simulations. The parametric projection filter, which allows inverse estimation with the presence of information on the noise covariance, was applied to an inhomogeneous three-concentric-sphere model under various noise conditions in order to estimate the cortical potentials from the scalp potentials. The present simulation results suggest that incorporation of information on the noise covariance allows better estimation of cortical potentials, than inverse solutions without knowledge about the noise covariance, when the correlation between the signal and noise is low. The method for determining the optimum regularization parameter, which can be applied for parametric inverse techniques, is also discussed.

This letter investigates the peak-to-average power ratio (PAR) reduction scheme employing a simple symbol transform in OFDM-CDMA systems. This approach is very simple because of no additional complexity and works with arbitrary numbers of subcarriers and without restriction on the allocation of spreading code, maintaining an original transmission efficiency. Simulation results show that the investigated scheme gives the PAR reduction gain of 2-3 dB compared to the original OFDM and OFDM-CDMA signals, and can provide the further PAR reduction by combing the partial transmit sequence (PTS) scheme, which is less complex compared to the ordinary PTS approach.

A new approach to correcting the array amplitude failure by a combination of B-spline techniques and genetic algorithms is proposed. Some array elements indicate the control knots for a B-spline curve by their nominal positions and amplitudes; others distribute the excitation amplitudes according to the sampling points on the curve. The inherent smoothness of the B-spline curves reduce the effect of excessive coupling between adjacent elements. Genetic algorithms are used to search for a quasi-optimized B-spline curve to produce the ultimate amplitude distribution for correcting the array failure. To demonstrate the method's effectiveness, simulation results for correcting failures with three- and four-element failures are presented.

Integration of the IP/MPLS network and the WDM optical mesh network is a promising approach to realizing an efficient backbone network. Because of the great volumes of traffic carried, the social cost incurred by a failure will be extremely high, so survivability is very important in the backbone network. In survivable IP/MPLS over WDM backbone networks, cooperation of the optical level fault recovery and the IP/MPLS level fault recovery is essential. This paper analyzes cost characteristics of the optical level fault recovery and the IP/MPLS level fault recovery. A mathematical programming method is proposed to minimize the initial network cost when the IP/MPLS level fault recovery is utilized in the survivable IP/MPLS over WDM networks. Using this method, the initial network cost needed for the IP/MPLS level fault recovery is compared with that for the optical level fault recovery. The initial network cost for the LSP (Label Switched Path) protection scheme is smaller than that for the shared light-path protection scheme and larger than that for the pre-plan type light-path restoration scheme. The LSP protection scheme is suitable for the best-effort type traffic while the shared light-path protection scheme may be suitable for the bandwidth guaranteed type traffic.

Adaptive arrays with signal blocking have the advantages of fast convergence and robustness to pointing errors as well as of rejecting a coherent interference in addition to incoherent ones. In this paper, we propose a novel method for performance improvement in such arrays with no increase in complexity. The proposed method utilizes all of the array elements to obtain the adaptive output so that its performance is superior to that of the conventional method which does not utilize one of the elements. Their performances are compared analytically and by computer simulation.

This paper presents the design consideration of a polarization-transformation transmission filter, which is composed of a multilayered chiral slab. The optimal material parameters and thickness of each layer of the slab can be determined by using a genetic algorithm (GA). Substituting the constitutive relations for a chiral medium into Maxwell's equations, the electromagnetic field in the medium is obtained. A chain-matrix formulation is used to derive the relationship between the components of the incident, the reflected, and the transmitted electric fields. The cross- and co-polarized powers carried by the transmitted and reflected waves are represented in terms of their electric field components. The procedure proposed for the design of a polarization-transformation filter is divided into two stages. An ordinary filter without polarization-transformation and a polarization-transformation filter for the transmitted wave are designed with a multilayered non-chiral slab and a multilayered chiral slab at the first and the second stages, respectively. According to the specifications of the filters, two functionals are defined with the transmitted and reflected powers. Thus the optimal design of a polarization-transformation filter with the multilayered chiral slab is reduced to an optimization problem where the material parameters and thickness of each chiral layer are found by maximizing the functionals. Applying the GA to the maximization of the functionals, one can obtain the optimal material parameters and thicknesses of the multilayered chiral slab. Numerical results are presented to confirm the effectiveness of the two-stage design procedure. For three types of multilayered chiral slabs, optimal values of refractive indices, thicknesses, and chiral admittances are obtained. It is seen from the numerical results that the proposed procedure is very effective in the optimal design of polarization-transformation filters for the transmitted wave.

This paper proposes a traffic-driven optical IP networking architecture for service provider networks. Its design is derived from the optical GMPLS architecture, which provides high performance but is not scalable since both optical paths and IP routes need to be arranged in a mesh topology. To improve scalability, we first modified the configuration so that paths and routes can be arranged in a tree topology. However, this approach may degrade performance due to traffic concentration at each tree's root. To prevent such performance degradation, we further modified the architecture so that both cut-through optical paths and cut-through IP routes can be assigned reactively, according to traffic demand, and these can work together in cooperation. As a result, our architecture achieves both high performance and scalability, in that the whole network performance can be maintained without a massive increase in the number of optical paths and IP routes, even if the number of customer networks grows.

Multiple access interference and near-far effect cause the performance of the conventional single user detector in DS/CDMA systems to degrade. Due to high complexity of the optimum multiuser detector, suboptimal multiuser detectors with less complexity and reasonable performance have received considerable attention. In this paper we apply the classic and a new modified genetic algorithm for multiuser detection of DS/CDMA signals. It is shown that the classic genetic algorithm (GA) reaches an error floor at high signal to noise ratios (SNR) while the performance of proposed modified GA is much better than the classic one and is comparable to the optimum detector with much less complexity. The results hold true for AWGN and fading channels. We also describe another GA called as meta GA to find the optimum parameters of the modified GA. We compare the performance of proposed method with the other detectors used in CDMA.