In this paper, an experimental result of complex refractive index of soda-lime glass at 30-GHz obtained by transmission method is presented at first. Secondly, a simple empirical formula of complex refractive index of soda-lime glass over frequency range from 0.1-GHz to 1000-GHz is derived using the present experimental result together with data previously reported in literatures by various researchers.

While a multicarrier approach of achieving frequency diversity performs well in the presence of partial-band interference, it suffers from the effects of intermodulation distortion (IMD) due to power amplifier (PA) nonlinearity. On the other hand, transmit diversity using multiple transmit antennas has the benefit of no IMD effects, but can suffer from a larger performance degradation due to partial-band interference (e.g., jamming or narrowband signals in a overlay system) compared to the multicarrier approach. Hence, hybrid diversity schemes which use both multicarrier as well as multiple transmit antennas are of interest. Techniques to suppress IMD effects in such hybrid diversity schemes are important. In this paper, we propose and evaluate the performance of a minimum mean square error (MMSE) receiver to suppress the intermodulation distortion in a coded multicarrier multiple transmit antenna (P transmit antennas) DS-CDMA system with M subcarriers on each transmit antenna, for both BPSK and QPSK modulation. The system uses rate-1/M convolutional coding, interleaving and space-time coding. We compare the performance of a (M = 4,P = 2) scheme and a (M = 2,P = 4) scheme, both having the same diversity order. We show that the proposed MMSE receiver effectively suppresses the IMD effects, thus enabling to retain better antijamming capability without much loss in performance due to IMD effects.

To improve the DS-CDMA signal transmission performance in a frequency-selective fading channel, the frequency-domain equalization (FDE) can be applied, in which simple one-tap equalization is carried out on each subcarrier component obtained by fast Fourier transform (FFT). Equalization weights for joint FDE and antenna diversity combining based on maximal ratio combining (MRC), zero-forcing (ZF), and minimum mean square error (MMSE) are derived. The conditional bit error rate (BER) is derived for the given set of channel gains in a frequency-selective multipath fading channel. The theoretical average BER performance is evaluated by Monte-Carlo numerical computation method using the derived conditional BER and is confirmed by computer simulation. Performance comparison between DS- and multi-carrier (MC)-CDMA both using FDE is also presented.

This paper proposes a new FEC scheme using backup channel to send redundant information instead of piggybacking the main packet. This is particularly applicable to the modern IP networks which are distributed all over the world. In this method only one source coder for both the main and the redundant payload is used to reduce the overall computational complexity. The Gilbert loss model (GLM) is employed to verify the improvement of the packet loss probability in this new method compared with that in a single path FEC scheme. It is shown, through simulation results that using our proposed backup channel can considerably improve the packet loss and delay performance of the VoIP networks.

In this paper, we propose a novel traffic engineering architecture for IP networks with MPLS backbones. In this architecture, two link-disjoint label switched paths, namely the primary and secondary paths, are established among every pair of IP routers located at the edges of an MPLS backbone network. As the main building block of this architecture, we propose that primary paths are given higher priority against the secondary paths in the MPLS data plane to cope with the so-called knock-on effect. Inspired by the ABR flow control mechanism in ATM networks, we propose to split traffic between a source-destination pair between the primary and secondary paths using explicit rate feedback from the network. Taking into consideration the performance deteriorating impact of packet reordering in packet-based load balancing schemes, we propose a traffic splitting mechanism that operates on a per-flow basis (i.e., flow-based multipath routing). We show via an extensive simulation study that using flow-based multipath traffic engineering with explicit rate feedback not only provides consistently better throughput than that of a single path but is also void of out-of-order packet delivery.

A bandpass filter (BPF) with shielded inverted microstrip lines (SIMSL), previously demonstrated by the author, has shown the nontrivial asymmetry of filter responses in spite of adopting a conventional filter synthesis procedure. This paper will reveal the mechanism of the asymmetry and propose prescriptions for recovering the defect, in addition to observing the wave propagation property of SIMSL. Firstly, the behavior of phase constants or effective dielectric constants for various modes propagating on single SIMSL are indicated in terms of the line configuration, and the dispersion characteristics of the quasi-TEM mode are interpreted from the point of mode coupling between the pure TEM mode and dielectric slab modes. Then it is shown that the asymmetry is dependent only on the transmission characteristics of SIMSL parallel-coupled lines involved in the filter circuits. Theoretical considerations reveal that the asymmetry is due to the fact that SIMSL has quite different phase constants for the even- and odd-mode. On the basis of these results, the optimized BPF is designed and it is experimentally demonstrated that the symmetry of its responses is notably recovered. Furthermore, this optimization is still quite efficient for achieving high attenuation properties at its harmonics.

In this paper, introducing a stochastic hill-climbing dynamics into an optimal competitive Hopfield network model (OCHOM), we propose a new algorithm that permits temporary energy increases, which helps the OCHOM escape from local minima. In graph theory, a clique is a completely connected subgraph and the maximum clique problem (MCP) is to find a clique of maximum size of a graph. The MCP is a classic optimization problem in computer science and in graph theory with many real-world applications, and is also known to be NP-complete. Recently, Galan-Marin et al. proposed the OCHOM for the MCP. It can guarantee convergence to a global/local minimum of energy function, and performs better than other competitive neural approaches. However, the OCHOM has no mechanism to escape from local minima. The proposed algorithm introduces stochastic hill-climbing dynamics which helps the OCHOM escape from local minima, and it is applied to the MCP. A number of instances have been simulated to verify the proposed algorithm.

This investigation proposes a novel dual-mode patch bandpass filter (BPF) that uses defect ground structure (DGS) to suppress spurious response. The proposed dual-mode patch BPF has exhibits a wide stopband characteristic owing to that uses the bandgap resonant characteristic of DGS in the harmonic frequency of the dual-mode patch BPF. The novel proposed filter demonstrates the frequency characteristics with center frequency f0 = 2.2 GHz, 3-dB bandwidth (FBW) of 8% and wider stopband from 2.6 to 6 GHz at the level of -35 dB. The experimental and simulated results agree.

In this paper, we provide explicit representations of average weight and stopping set distributions and asymptotic expressions of their exponent for detailedly represented irregular LDPC code ensembles. Further we present numerical examples which compare a detailedly represented irregular LDPC code ensemble with a conventional one with respect to both of weight and stopping set distributions.

Energy consumption is one of the most critical constraints in the design of portable embedded systems. This paper describes an empirical study about the impacts of compiler optimizations on the energy consumption of the address bus between processor and instruction memory. Experiments using a number of real-world applications are presented, and the results show that transitions on the instruction address bus can be significantly reduced (by 85% on the average) by the compiler optimizations together with bus encoding.

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.

One of the most important issues in spontaneous speech recognition is how to cope with the degradation of recognition accuracy due to speaking rate fluctuation within an utterance. This paper proposes an acoustic model for adjusting mixture weights and transition probabilities of the HMM for each frame according to the local speaking rate. The proposed model is implemented along with variants and conventional models using the Bayesian network framework. The proposed model has a hidden variable representing variation of the "mode" of the speaking rate, and its value controls the parameters of the underlying HMM. Model training and maximum probability assignment of the variables are conducted using the EM/GEM and inference algorithms for the Bayesian networks. Utterances from meetings and lectures are used for evaluation where the Bayesian network-based acoustic models are used to rescore the likelihood of the N-best lists. In the experiments, the proposed model indicated consistently higher performance than conventional HMMs and regression HMMs using the same speaking rate information.

This paper presents an application-level QoS comparison of three inter-destination synchronization schemes: the master-slave destination scheme, the synchronization maestro scheme, and the distributed control scheme. The inter-destination synchronization adjusts the output timing among destinations in a multicast group for live audio and video streaming over the Internet/intranets. We compare the application-level QoS of these schemes by simulation with the Tiers model, which is a sophisticated network topology model and reflects hierarchical structure of the Internet. The comparison clarifies their features and finds the best scheme in the environment. The simulation result shows that the distributed control scheme provides the highest quality of inter-destination synchronization among the three schemes in heavily loaded networks, while in lightly loaded networks the other schemes can have almost the same quality as that of the distributed control scheme.

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.

In this paper, we presented a new interference suppression method based on groupwise decorrelation for the multirate wideband-code division multiple access (W-CDMA) downlink. Code grouping in the proposed method is performed according to the correlation property between the mother code and the child code in the orthogonal variable spreading factor (OVSF) code tree. The decorrelation process based on the grouped codes, so called groupwise decorrelation, is then performed to suppress the interference induced in the downlink propagation. We demonstrate that the proposed method can enhance the performance significantly, with lower computational complexity and higher operational efficiency in which any information about interference users (code, data, amplitude) is not required to know in prior at the detection stage.

Density evolution has recently been used to analyze the iterative decoding of Low Density Parity Check (LDPC) codes, Turbo codes, and Serially Concatenated Convolutional Codes (SCCC). The density evolution technique makes it possible to explain many characteristics of iterative decoding including convergence of performance and preferred structures for the constituent codes. While the analytic density evolution methods were applied to LDPC codes, the simulation based density evolution methods were used for Turbo codes and SCCC due to analytic difficulties. In this paper, several density evolution ideas in the literature are used to analyze common code structures and it is shown that those ideas yield consistent results. In order to do that, we derive expressions for density evolution of SCCC with a simple 2-state constituent code. The analytic expressions are based on the sum-product and min-sum algorithms, and the thresholds are evaluated for both message passing algorithms. Particularly, for the min-sum algorithm, the density evolution with Gaussian approximation is derived and used to analyze the effect of scaling soft information. The scaling of extrinsic information slows down the convergence of soft information or avoids an overestimation effect of it and results in better performance, and its gain is maximized in particular constituent codes. Similar approaches are made for LDPC code. We show that the scaling gain is noticeable in the LDPC code as well. This scaling gain is analyzed with both density evolution and simulation performance. The expected scaling gain by density evolution matches well with the achievable scaling gain from simulation results. These results can be extended to the irregular LDPC codes based on the degree distribution for the min-sum algorithm. All density evolution algorithms used in this paper are based on the Gaussian approximation for the exchanged messages.

A novel ferroelectric-gate transistor with split-gate structure has been proposed and its read out characteristics have been analyzed. "Transistor-type" FeRAMs have a problem in degradation of readout current, i.e. when the readout voltage is applied at the gate, the current of readout operation is smaller than that of write operation. We demonstrate by SPICE simulation that the proposed split-gate structure ferroelectric-FET can overcome the problem.

The single path routing protocol, known as the Ad Hoc On-demand Distance Vector, has been widely studied for use in mobile ad hoc networks. AODV requires a new route discovery whenever a path breaks. Such frequent route discoveries cause a delay due to route discovery latency. To avoid such inefficiency, a multipath routing protocol has been proposed that attempts to find link-disjoint paths in a route discovery. However, when there are two or more common intermediate nodes on the path, the protocol can not find a pair of link-disjoint paths even if the paths actually exist. To reduce this route discovery latency, it is necessary to increase the opportunities for finding a pair of link-disjoint paths. In this paper, we focus on AODV and propose an AODV-based new multipath routing protocol for mobile ad hoc networks. The proposed routing protocol uses a new method to find a pair of link-disjoint paths by selecting a route having a small number of common intermediate nodes on its path. Using simulation models, we evaluate the proposed routing protocol and compare it with AODV and the existing multipath routing protocol. Results show that the proposed routing protocol achieves better performance in terms of delay than other protocols because it increases the number of cases where a pair of link-disjoint paths can be established.

Analytical derivation of bit error rates for multi-user coherent chaos-shift-keying (CSK) communication systems are presented in this paper. Nearly exact results are obtained by applying the central limit theorem of statistics to sums of independent variables. Based on χ2 distribution approximations, more viable but still very accurate results decrease complexity of the calculations. The χ2 approach is compared with the widely used Gaussian approximation approach to show its superiority in most cases. Bit error performance bounds for the multi-user CSK system from the approach are deduced as further contributions of this paper. The theoretical results obtained are entirely consistent with a range of simulations.

We propose a new end-to-end transport protocol called Multi-path Transmission Control Protocol (M/TCP) and its two robust acknowledgement (ACK) schemes. Our protocol is designed as an alternative TCP option to improve reliability and performance of the Internet. The M/TCP sender simultaneously transmits data via multiple controlled paths to the receiver. Our protocol requires no modification in IP layer. Two M/TCP endpoints establish multiple paths between them by subscribing to multiple ISPs. The two robust ACK schemes proposed in this paper aim at improving M/TCP performance over the Internet with high packet loss in ACK channels. Performances between our protocol and TCP Reno are compared in terms of throughput and fairness by using ns2 simulator. Simulation results indicate that M/TCP achieves higher throughput than TCP Reno in situation of random drop and burst traffic with small buffer size. When there is network congestion on reverse path, M/TCP with the proposed robust ACK schemes performs better than M/TCP with the conventional immediate ACK scheme.