Closed-form expressions for a crosstalk noise amplitude and worst-case delay in capacitively coupled two-line and three-line systems are derived assuming bus lines and other signal lines in a VLSI. Two modes are studied; a case that adjacent lines are driven from the same direction, and the other case that adjacent lines are driven from the opposite direction. Beside, a junction capacitance of a driver MOSFET is considered. The closed-form expressions are useful for circuit designers in an early stage of a VLSI design to give insight to interconnection problems. The expressions are extensively compared and fitted to SPICE simulations. The relative and absolute errors in the crosstalk noise amplitude are within 63.8% and 0.098 E (where E is a supply voltage), respectively. The relative error in the worst-case delay is less than 8.1%.

Exploiting layer7 context is an effective approach to improving the accuracy of detecting malicious messages in network intrusion detection/prevention systems (NIDS/NIPSs). Layer7 context enables us to inspect message formats and the message exchanged order. Unfortunately, layer7-aware NIDS/NIPSs pose crucial implementation issues because they require full TCP and IP reassembly without losing 1) complete prevention, 2) performance, 3) application transparency, or 4) transport transparency. Complete prevention means that the NIDS/NIPS should prevent malicious messages from reaching target applications. Application transparency means not requiring any modifications to and/or reconfiguration of server and client applications. Transport transparency is not to disrupt the end-to-end semantics of TCP/IP. To the best of our knowledge, none of the existing approaches meet all of these requirements. We have developed an efficient mechanism for layer7-aware NIDS/NIPSs that does meet the above requirements. Our store-through does this by forwarding each out-of-order or IP-fragmented packet immediately after copying the packet even if it has not been checked yet by an NIDS/NIPS sensor. Although the forwarded packet might turn out to be a part of an attack message, the store-through mechanism can successfully defend against the attack by blocking one of the subsequent packets that contain another part of attack message. Testing of a prototype in Linux kernel 2.4.30 demonstrated that the overhead of our mechanism is negligible compared with that of a simple IP forwarder even with the presence of out-of-order and IP-fragmented packets. In addition, the experimental results suggest that the CPU and memory usage incurred by our store-through is not significant.

A multiple-output function can be represented by a binary decision diagram for characteristic function (BDD_for_CF). This paper presents a method to represent multiple-output incompletely specified functions using BDD_for_CFs. An algorithm to reduce the widths of BDD_for_CFs is presented. This method is useful for decomposition of incompletely specified multiple-output functions. Experimental results for radix converters, adders, a multiplier, and lists of English words show that this method is useful for the synthesis of LUT cascades. An implementation of English words list by LUT cascades and an auxiliary memory is also shown.

The performance of multiuser MIMO downlink systems with block diagonalization (BD) relies on the channel state information (CSI) at the transmitter to a great extent. For time division duplex TDD systems, the transmitter estimates the CSI while receiving data at current time slot and then uses the CSI to transmit at the next time slot. When the wireless channel is time-varying, the CSI for transmission is imperfect due to the time delay between the estimation of the channel and the transmission of the data and severely degrades the system performance. In this paper, we propose a linear method to suppress the interferences among users and data streams caused by imperfect CSI at transmitter. The transmitter first sends pilot signals through a linear spatial precoding matrix so as to make possible that the receiver can estimate CSI of other users, and then the receiver exploits a linear prefilter to suppress the interference. The numerical results show that the proposed schemes achieve obvious performance enhancement in comparison to the BD scheme with imperfect CSI at the transmitter.

Numerical function generators (NFGs) realize arithmetic functions, such as ex,sin(πx), and , in hardware. They are used in applications where high-speed is essential, such as in digital signal or graphics applications. We introduce the edge-valued binary decision diagram (EVBDD) as a means of reducing the delay and memory requirements in NFGs. We also introduce a recursive segmentation algorithm, which divides the domain of the function to be realized into segments, where the given function is realized as a polynomial. This design reduces the size of the multiplier needed and thus reduces delay. It is also shown that an adder can be replaced by a set of 2-input AND gates, further reducing delay. We compare our results to NFGs designed with multi-terminal BDDs (MTBDDs). We show that EVBDDs yield a design that has, on the average, only 39% of the memory and 58% of the delay of NFGs designed using MTBDDs.

In this paper, we consider consecutive burst transmission with burst loss recovery based on Forward Error Correction (FEC) in which redundant data is transmitted with multiple bursts. We propose two burst generation methods: Out-of Burst Generation (OBG) and In-Burst Generation (IBG). The OBG generates a redundant burst from redundant data, while the IBG reconstructs a burst from an original data block and a part of the redundant data. For both methods, the resulting bursts are transmitted consecutively. If some bursts among the bursts are lost at an intermediate node, the lost bursts can be recovered with the redundant data using FEC processing at the destination node. We evaluate by simulation the proposed methods in a uni-directional ring network and NSFNET, and compare the performances of the proposed methods with the extra-offset time method. Numerical examples show that the proposed methods can provide a more reliable transmission than the extra-offset time method for the OBS network where the maximum number of hops is large. Moreover, it is shown that the end-to-end transmission delay for our proposed methods can be decreased by enhancing the FEC processor or by increasing the number of FEC processors.

In ubiquitous networks, Mobile Nodes (MNs) often suffer from performance degradation due to the following two reasons: (1) reduction of signal strength by the movement of an MN and intervening objects, and (2) radio interference with other WLANs. Therefore, handover initiation based on quick and reliable detection of the deterioration in a wireless link condition arising from the above two reasons is essential for achieving seamless handover. In previous studies, we focused on a handover decision criterion and described the problems related to the two existing decision criteria. Furthermore, we showed the effectiveness of the number of frame retransmissions through simulation experiments. However, a comparison of the signal strength and the number of frame retransmissions could not be examined due to the unreliability of the signal strength in simulations. Therefore, in the present paper, by employing FTP and VoIP applications, we compare the signal strength and the number of frame retransmissions as a handover decision criterion with experiments in terms of (1) and (2) in a real environment. Finally, we clarify the problem of the signal strength in contrast to the effectiveness of the number of frame retransmissions as a handover decision criterion.

We consider power and rate adaptations in multicarrier (MC) direct-sequence code-division multiple-access (DS/CDMA) communications under the assumption that channel state information is provided at both the transmitter and the receiver. We propose, as a power allocation strategy in the frequency domain, to transmit each user's DS waveforms over the user's sub-band with the largest channel gain, rather than transmitting identical DS waveforms over all sub-bands. We then adopt channel inversion power adaptation in the time domain, where the target user's received power level maintains at a fixed value. We also investigate rate adaptation in the time domain, where the data rate is adapted such that a desired transmission quality is maintained. We analyze the BER performance of the proposed power and rate adaptations with fixed average transmission power, and show that power adaptation in both the frequency and the time domains or combined power adaptation in the frequency domain and rate adaptation in the time domain make significant performance improvement over the power adaptation in the frequency domain only. We also compare the performance of the proposed power and rate adaptation schemes in MC-DS/CDMA systems to that of power and rate adapted single carrier DS/CDMA systems with RAKE receiver.

We experimentally demonstrated polarization-mode dispersion (PMD) compensation by distributing polarizers with only 1 degree of freedom (DOF) along the transmission line. The average power penalty was measured to be 0.4 dB by inserting four compensators, where average differential group delay was 47% of bit period.

The time division duplex cellular system can support various downlink and uplink traffic ratios by setting the downlink and uplink transmission periods appropriately. However, it causes severe co-channel interference problem when some cells are active in the downlink while the others are in the uplink [2]. To mitigate this problem, a resource allocation scheme combined with sectorization is proposed for orthogonal frequency division multiple access. Simulations demonstrate that the proposed scheme improves both spectral efficiency and outage performance compared to the conventional allocation schemes.

SIMD instructions are often implemented in modern multimedia oriented processors. Although SIMD instructions are useful for many digital signal processing applications, most compilers do not exploit SIMD instructions. The difficulty in the utilization of SIMD instructions stems from data parallelism in registers. In assembly code generation, the positions of data in registers must be noted. A technique of generating pack instructions which pack or reorder data in registers is essential for exploitation of SIMD instructions. This paper presents a code generation technique for SIMD instructions with pack instructions. SIMD instructions are generated by finding and grouping the same operations in programs. After the SIMD instruction generation, pack instructions are generated. In the pack instruction generation, Multi-valued Decision Diagram (MDD) is introduced to represent and to manipulate sets of packed data. Experimental results show that the proposed code generation technique can generate assembly code with SIMD and pack instructions performing repacking of 8 packed data in registers for a RISC processor with a dual-issue coprocessor which supports SIMD and pack instructions. The proposed method achieved speedup ratio up to about 8.5 by SIMD instructions and multiple-issue mechanism of the target processor.

Transmit diversity gain can be obtained in cooperative communication by cooperating the multiple users with single antenna. In cooperative communication, in the first step, each mobile station (MS) transmits its own data to both the base station (BS) and the other MS. In the second step, each MS's data is transmitted from the other MS to BS. As a result, transmit diversity gain can be obtained without implementing multiple transmit antennas at MS. In the conventional relay method, if error is detected within the received packet by using cyclic redundancy check (CRC) code, MS transmits its own data to BS instead of relaying the other MS's data in the second step. As a result, transmit diversity gain cannot be obtained. In this paper, we propose a novel cooperative method. In the proposed method, if the CRC decoder detects error within the received packet, MS transmits soft decision symbol which is obtained from the decoded data in second step. As a result, the transmit diversity gain always can be obtained. From the computer simulation, we show that the proposed method can achieve the better error rate performance than the conventional one.

This letter deals with adaptive array beamforming based on a minimum variance distortionless response (MVDR) technique with robust capabilities for code-division multiple access signals. It has been shown that the MVDR beamformer suffers from the drawback of being very sensitive to pointing error over the eigenspace-based beamformers. For the purpose of efficient estimation and calibration, a highly efficient approach has been proposed that is implemented on polynomial rooting rather than spectral searching. However, this rooting method is suboptimal in the presence of the noise and multiple access interference (MAI). In this letter, we propose an improved polynomial rooting calibration method that is robust in both of the low signal-to-noise ratio and large MAI scenarios. Several computer simulations are provided for illustrating the effectiveness of the proposed method.

In this paper, we employ time-reversal space-time block coding (TR-STBC) in single-carrier direct sequence code-division multiple access (DS-CDMA) block transmission in the presence of multiple access interference (MAI) as well as intersymbol interference (ISI), which is subject to fairly long delay spread. We introduce the transmission rate improvement by capitalizing on the assignment of additional spreading codes to each user so as to expand the cardinality of space-time code matrix with no sacrifice of diversity order. Given perfect channel state information at the receiver, a simple linear frequency-domain interference suppression scheme on a basis of symbol-by-symbol processing is developed under certain circumstances. A "turbo principle" receiver is facilitated by exploiting the serially concatenated structure at the transmitter to further enhance system performance. Simulation results justify the efficacy of our proposed system and also present performance comparisons with some existing systems in terms of bit error rate (BER).

The performance of a passive RFID system in a dense multi-reader environment is limited by both reader-to-reader interference and reader-to-tag interference. In this paper, we formulate a practical RFID system model which takes into account the non-linear demodulation of the tags and the transmission spectrum of the readers. Using this model, we derive a novel linear programming formulation to obtain the optimum communication probability of the readers for a given reader deployment scenario. We then propose two novel distributed interference avoidance algorithms based on the detect-and-abort principle for multi-channel readers which can effectively mitigate the reader-to-tag interference as well as the reader-to-reader interference. Computer simulations show that the proposed algorithms can improve the successful communication probability and fairness among readers in dense reader environments, compared with the conventional listen-before-talk algorithm.

A 4-Gb AG-AND flash memory was fabricated by using a 90-nm CMOS technology. To reduce cell size, an inversion-layer-bit-line technology was developed, enabling the elimination of both shallow trench isolations and diffusion layers from the memory cells. The inversion-layer-bit-line technology combined with a multilevel cell technique achieved a bit area 2F2 of 0.0162 µm2, resulting in a chip size of 126 mm2. Both an address and temperature compensation techniques control the resistance of the inversion-layer local bit line. Source-side hot-electron injection programming with self-boosted charge, accumulated in inversion-layer bit lines under assist gates, reduces the dispersal of programming characteristics and also reduces the time overhead of pre-charging the bit lines. This self-boosted charge-injection scheme achieves a programming throughput of 10 MB/s.

In this paper, we present a new fast Fourier transform (FFT) algorithm to reduce the table size of twiddle factors required in pipelined FFT processing. The table size is large enough to occupy significant area and power consumption in long-point FFT processing. The proposed algorithm can reduce the table size to half, compared to the radix-22 algorithm, while retaining the simple structure. To verify the proposed algorithm, a 2048-point pipelined FFT processor is designed using a 0.18 µm CMOS process. By combining the proposed algorithm and the radix-22 algorithm, the table size is reduced to 34% and 51% compared to the radix-2 and radix-22 algorithms, respectively. The FFT processor occupies 1.28 mm2 and achieves a signal-to-quantization-noise ratio (SQNR) of more than 50 dB.

In this paper, we propose two weighting techniques to improve performances of query expansion in biomedical document retrieval, especially when a short biomedical term in a query is expanded with its synonymous multi-word terms. When a query contains synonymous terms of different lengths, a traditional IR model highly ranks a document containing a longer terminology because a longer terminology has more chance to be matched with a query. However, such preference is clearly inappropriate and it often yields an unsatisfactory result. To alleviate the bias weighting problem, we devise a method of normalizing the weights of query terms in a long multi-word biomedical term, and a method of discriminating terms by using inverse terminology frequency which is a novel statistics estimated in a query domain. The experiment results on MEDLINE corpus show that our two simple techniques improve the retrieval performance by adjusting the inadequate preference for long multi-word terminologies in an expanded query.

Decision diagrams are often used for efficient representation of discrete functions in terms of needed storage space and processing time. In this paper, we propose an XML (Extensible Markup Language) based standard for the structural description of various types of decision diagrams. The proposed standard describes elements of the structure common to various types of decision diagrams. It also provides facilities for storing additional information, specific to particular types of decision diagrams. Properties of XML enable us to define a standard that is flexible enough to be applicable to various existing types of decision diagrams as well as new types that could be defined in the future. The existence of such a standard permits efficient storage and exchange of data in decision diagram form between various software systems. In this way, it supports benchmarking, testing and verification of various procedures using decision diagrams as a basic data structure.

The computational complexity of the optimum maximum likelihood detector (OMLD) does not allow its utility for multi-user detection (MUD) in code division multiple access (CDMA) systems. As proposed in this letter, particle swarm optimization (PSO) with soft decision offers a much more efficient option with few parameters to be adjusted, flexibility to implement, that gives a much faster convergence compared to OMLD. It outperforms the conventional detector, the genetic algorithm approach and the standard suboptimal detectors considered in the literature.