The Fourier integrals are treated as a rigorous extension of the Fourier series expansion. The reward for this is that so called, in the Fourier integrals, singular functions that are not absolutely integrable, e.g., trigonometric functions can be discussed within a field of ordinary function giving a foundation for the delta function as distribution.

In this paper, a test architecture optimization for system-on-a-chip under floorplanning constraints is proposed. The models of previous test architecture optimizations were too ideal to be applied to industrial SOCs. To make matters worse, they couldn't treat topological locality of cores, that is, floorplanning constraints. The optimization proposed in this paper can avoid long wires for TAMs in consideration of floorplanning constraints and finish optimizing test architectures within reasonable computation time.

In this paper, we investigate a low-power architecture for designs modeled as an Extended Finite State Machine (EFSM). It is based on the general dynamic power management concept, in which the redundant computation can be dynamically disabled to reduce the overall power dissipation. The contribution of this paper is mainly a systematic procedure to identify almost maximal amount of redundant computation in a design given as an EFSM. There are two levels of redundant computation to be exploited--one is based on the machine state information, while the other is based on the transition information. After the extraction of the redundant computation, a low-power architecture using input gating is proposed to synthesize the final circuit. We tested the technique on a design computing a number's modulo inverse. Experimental results show that 31% power reduction can be achieved at the costs of 2% timing penalty and 16% area overhead.

This paper presents a non-scan design scheme to enhance delay fault testability of controllers. In this scheme, we utilize a given state transition graph (STG) to test delay faults in its synthesized controller. The original behavior of the STG is used during test application. For faults that cannot be detected by using the original behavior, we design an extra logic, called an invalid test state and transition generator, to make those faults detectable. Our scheme allows achieving short test application time and at-speed testing. We show the effectiveness of our method by experiments.

Some conventional beamformers require the direction of the desired signal. The performance of such beamformers can substantially be degraded even in the presence of small error on the directional information. In this letter, we propose a prefilter-type beamforming scheme robust to directional error by employing a simple compensator. The performance of the proposed scheme is verified by computer simulation.

In this paper, we consider the problem of multicast routing and wavelength assignment (MC-RWA) in multi-fiber all-optical WDM networks. Two main network design system comprehensively investigated here are mesh and multi-ring designs. Given the multicast traffic demands, we present new ILP formulations to solve the MC-RWA problem with an objective to determine the minimal number of fibers needed to support the multicast requests. Unlike previous studies, our ILP formulations are not only capable of finding the optimal multicast routing and wavelength assignment pattern to the light-trees, but also finding the optimal light-tree structures simultaneously. Since broadcast and unicast communications are special cases of multicast communications, our ILP models are actually the generalized RWA mathematical models of optical WDM networks. In addition to proposing the ILP models, this paper takes two main issues affecting the network capacity requirement into account, that is, the splitting degree level of optical splitters and techniques of wavelength assignment to the light-trees. Three multicast wavelength assignment techniques studied in this paper are Light-Tree (LT), Virtual Light-Tree (VLT) and Partial Virtual Light-Tree (PVLT) techniques. Due to the NP-completeness of the MC-RWA problem, the ILP formulations can reasonably cope with small and moderate networks. To work with large networks, this paper presents alternative MC-RWA ILP-based heuristic algorithms for the PVLT and LT networks and develops lower bound techniques to characterize the performance of our algorithms. Using existing large backbone networks, numerical results are reported to analyze such aspects as multiple fiber systems, the benefits of using optical splitters and wavelength converters, and the capacity difference between the mesh and multi-ring designs. Finally, this paper provides an analysis of the influence of network connectivity on the network implementation under the constraints of mesh and multi-ring design schemes.

Recently, a new light-weight version of the secure electronic transaction protocol was proposed. The protocol can achieve two goals. One goal is that the security level is the same as the SET protocol. The other goal is to reduce the computational time in message generation and verification, and reduce the communication overhead. However, the protocol has a weakness, which is that non-repudiation is acquired, but confidentiality is lost. In this paper, we point out the weakness of the protocol. We also propose an improvement to the protocol to overcome this weakness.

A very long instruction word (VLIW) digital signal processor (DSP), called ODiN, which could execute six instructions in a single cycle simultaneously, is designed and fabricated using 0.25 µm 1-ploy 5-metal standard cell static CMOS process. The ODiN core delivers maximum 600 MIPS with 100 MHz system clock. In order to achieve high performance operation, the designed core includes compact register files, orthogonal instruction set, single cycle operations for most instructions, and parallel processing based on software scheduling. In addition, a Viterbi decoder processor and a FFT processor that are embedded make it possible to implement software defined radio (SDR) applications efficiently.

This paper proposes the dynamic resource assignment (DRA) scheme in the multi-carrier mesh-topology millimeter-wave (MMW) broadband entrance networks. In the DRA scheme, the radio path allocation and the frequency channel assignment techniques are deployed to maximize the network throughput. In the radio path allocation technique, the traffic load is distributed into the appropriate paths. On the other hand, the frequency channel assignment is performed based on the linear programming (LP) method. As the results, the proposed DRA scheme yields higher throughput performance than the conventional scheme using the random frequency channel assignment. In addition, the proposed scheme can guarantee the throughput performance when the number of frequency channels is 36 and the input load is no more than 9 Gbps. Moreover, the proposed scheme can yield the satisfaction sub-optimum throughput with the small computational complexity.

A novel signal enhancement scheme using the rotation of signal subspace (RSS) and Toeplitz matrix approximation (TMA) methods to enhance the performance of an adaptive antenna array in multirate DS/CDMA systems is proposed. The basis of RSS is to find a transformation matrix in order to recover the desired complex array covariance matrix from a sampled complex array covariance matrix which is contaminated by an interference-plus-noise component, which is the total noise. Also, the objective of TMA is to change the output matrix of RSS into a matrix having the theoretical properties of a total noise-free signal. Consequently, the proposed signal enhancement scheme using RSS and TMA methods can greatly improve the performance of an adaptive antenna array by reducing the undesired total noise effect from the sampled complex array covariance matrix of the pre-correlation received signal vector that is used to calculate a weight vector of an adaptive antenna array. It is shown through various simulation results that the system performance using the proposed signal enhancement scheme is much superior to that of the conventional method.

Efficient schemes to enhance the performance of the optimum beamforming for DS/CDMA systems are proposed. The main focus of the proposed schemes is to enhance the practical estimation of an array response vector used at the weight vector for the optimum beamforming. The proposed schemes for the performance enhancement of the optimum beamforming are the Complex Toeplitz Approximation (CTA) and the real Toeplitz-plus-Hankel Approximation (RTHA) which have the theoretical property of an overall noise-free signal. It is shown through several simulation results that the performance of the optimum beamforming using the proposed schemes is much superior to that of a system using the conventional method under several simulation environments, i.e., the number of users, the SNR value, the number of antenna elements, the angular spread, and Nakagami fading parameter.

All-optical switching is of considerable interest, since it enables the construction of large-capacity networks with protocol- and bit-rate-independent transmission. In this paper, we determine the most desirable of three all-optical architectures for a backbone network, by comparing the following architectures: the wavelength-routed network, the slotted wavelength-routed network, and the optical burst switching network. After proposing an optical path accommodation algorithm that minimizes the total fiber length, we evaluate the total network cost in order to compare the availability of the first two architectures. We then compare the architectures in terms of the burst blocking probability in order to clarify the effectiveness of the third architecture.

This letter proposes a hierarchical label-switched path (LSP) setup scheme, called ConSet, for multi-layer generalized multi-protocol label switching (GMPLS) networks. ConSet allows a Path message to be transmitted to the downstream neighbor node without waiting for the establishment of the higher-order LSP. Confirmation of the establishment of the higher-order LSP is performed at the ingress node of the higher-order LSP before a Resv message of the lower-order LSP is transmitted to the upstream neighbor node. ConSet is able to set up hierarchical LSPs faster than the sequential scheme.

Recently, there have been a number of studies on wavelength division multiplexing (WDM) systems designed to increase transmission capacity and flexibility. This has in turn made it necessary to design the optical loss for optical fiber networks over a wide wavelength range. However, there is no general optical loss design method that allows us to employ for an optical fiber network over a wide wavelength range. In this paper, we propose a novel optical loss design and estimation method based on multiple regression analysis and statistical loss design technology for designing new optical fiber networks and for upgrading those that have already been installed. We show that the method can be used for highly accurate optical loss design and estimation from the O- to the L-band (1260 nm to 1625 nm), except for the E-band, by using easily obtainable optical loss values at wavelengths of 1310 and 1550 nm, which are usually used for communication. Moreover, we also show that the accuracy of our proposed method can be improved by selecting proper additional predictor wavelengths.

Estimating the parameters of a statistical distribution from measured sample values forms an essential part of many signal processing tasks. K-distribution has been proven to be an appropriate model for characterising the amplitude of sea clutter. In this paper, a new method for estimating the parameters of K-Distribution is proposed. The method greatly lowers the computational requirement and variance of parameter estimates when compared with the existing non-maximum likelihood methods.

This paper proposes a bandwidth allocation algorithm and a demand accommodation algorithm guaranteeing utility max-min fairness under bandwidth constraints. We prove that the proposed algorithms can fairly split network resources among connections and achieve call admission control considering the fairness among different types of applications. We then formulate three different network design problems to maximize the total utility of all customers, the number of users accommodated in the network, and the average utility of the customers accommodated in the network. To solve the problems, we extend the conventional network design algorithms considering utility max-min fair share, and numerically evaluate and compare their performance. Finally, we summarize the best algorithms to design the utility max-min fair share networks considering the operation policy of network providers.

Sensor networks, in which a large number of sensor nodes are connected with each other through communication networks, are potential to provide extensive new applications with various research and technical challenges and attracting much attention all over the world. In this paper we describe information and signal processing for sensor networks with emphasis on the concepts of collaboration and fusion as one of the most important issues for the sensor networks. We also review some basic aspects of sensor networks in terms of their features and the network architecture.

In mobile cellular networks it is crucial to be able to use the available radio spectrum as efficiently as possible while providing a certain level of Quality of Service (QoS) for the users. Emergence of miscellaneous services has dramatically increased the complexity of this problem by creating a heterogeneous traffic environment. In this paper an efficient resource allocation scheme between two real-time services with different bandwidth requirements has been proposed for cellular networks with multimedia offered traffic and highly mobile users, which combines classical intera-cell resource borrowing concept with a novel inter-cell resource-sharing scheme between diverse classes of traffic. By assuming the heterogeneous offered traffic to be a combination of audio and video traffic types, through extensive simulations it will be shown that HCBA-UCB is capable of significantly improving audio teletraffic performance of the system while preserving fairness in service provision, i.e. without imposing additional expenses upon video QoS performance.

Even in embedded processors, the accuracy in a branch prediction significantly affects the performance. In designing a branch predictor, in addition to accuracy, microarchitects should consider area, delay and power consumption. We propose two techniques to reduce the power consumption; these techniques do not requires any additional storage arrays, do not incur additional delay (except just one MUX delay) and never deteriorate accuracy. One is to look up two predictions at a time by increasing the width (decreasing the depth) of the PHT (Prediction History Table). The other is to reduce unnecessary accesses to the BTB (Branch Target Buffer) by accessing the PHT in advance. Analysis results with Samsung Memory Compiler show that the proposed techniques reduce the power consumption of the branch predictor by 15-52%.

A novel method is presented to the symbolic computation of Noise Figure (NF) of transistor circuits. Several computationally efficient macromodels of BJTs and MOSFETs by using nullors, are introduced. To demonstrate the suitability of the proposed method, the fully-symbolic expression of NF of a CMOS current-mirror is computed, and the total output noise-voltage is compared with HSPICE simulations. The calculated NF and the simulated noise are in good agreement. Finally, the method is extended to compute NF of a CMOS translinear circuit biased in weak inversion.