In this paper, we propose pilot-assisted decision feedback channel estimation (PA-DFCE) for space-time coded transmit diversity (STTD) in orthogonal frequency division multiplexing (OFDM). Two transmit channels are simultaneously estimated by transmitting the STTD encoded pilot. To improve the tracking ability of the channel estimation against fast fading, decision feedback is also used in addition to pilot. For noise reduction and preventing the error propagation, windowing of the estimated channel impulse response in the time-delay domain is applied. The average bit error rate (BER) performance of OFDM with STTD is evaluated by computer simulation. It is found that the use of PA-DFCE can achieve a degradation in the required Eb/N0 from ideal CE of as small as 0.6 dB for an average BER = 10-3 and requires about 2.4 dB less Eb/N0 compared to differential STTD that requires no CE.

We develop a method of dimensioning and managing the bandwidth of a link on which TCP flows from access links are aggregated. To do this, we extend the application of the processor-sharing queue model to TCP performance evaluation by using flow statistics. To handle various factors that affect actual TCP behavior, such as round-trip time, window-size, and restrictions other than access-link bandwidth, we extend the model by replacing the access-link bandwidth with the actual file-transfer speed of a flow when the aggregation link is not congested. We only use the number of active flows and the link utilization to estimate the file-transfer speed. Unlike previous studies, the extended model based on the actual transfer speed does not require any assumptions/predeterminations about file-size, packet-size, and round-trip times, etc. Using the extended model, we predict the TCP performance when the link utilization increases. We also show a method of dimensioning the bandwidth needed to maintain TCP performance. We show the effectiveness of our method through simulation analysis.

Multi-carrier code division multiplexing (MC-CDM) is one of promising multiplexing techniques for fourth-generation mobile downlink communications systems, where high data rate services should be provided even for high speed-cruising mobiles. For MC-CDM-based packet communication, a frequency scheduling method, which adaptively assigns different sub-carriers to different users, is proposed. This paper proposes a frequency scheduling method, which utilizes pre-assignmented subcarriers in the frequency domain for the MC-CDM scheme. Furthermore, the performance of the proposed system in frequency selective fading channels is compared with that of a no-scheduled MC-CDM scheme by computer simulation in both single- and multi-cell environments. From the results, it is found that the proposed system achieves better bit error rate performance than the no-scheduled MC-CDM scheme and can control quality of service (QoS) for active users.

A new data-aided carrier frequency offset (CFO) estimation technique is presented for correlative coded OFDM systems in the presence of strong multipath. Different from traditional data-aided estimation techniques, the technique estimates CFO by detecting amplitude of pilots rather than their phase shift and removes effects on CFO estimation due to intercarrier interference by an iterative compensation method. A theoretical analysis of its performance has been derived and simulation results comparing the new technique with a traditional data-aided estimation technique are presented.

Multi-Carrier CDMA (MC-CDMA) has been considered as a combination of the techniques of Code Division Multiple Access (CDMA) and Orthogonal Frequency Division Multiplex (OFDM). However, even until now, the efficient MC-CDMA scheme is still under study because of the inherent bugs in OFDM, such as the troubles caused by Multiple Access Interference (MAI) and Peak to Average Power Ratio (PAPR). In this paper, we present a novel two-dimensional spreading sequence named "Two Dimensional Combined Complementary Sequence" (TDC). If we take this kind of sequences as spreading codes, several prominent advantages can be achieved compared with traditional MC-CDMA. First, it can achieve MAI free in the multi-path transmission both in uplink and downlink. Second, it offers low PAPR value within 3 dB with a quite simple architecture. The last but not the least, the proposed MC-CDMA scheme turns out to be an efficient approach with high bandwidth efficiency, high spreading efficiency and flexible transmission rate enriched by a special shift-and-add modulation. Meanwhile, an algorithm that constructs TDC sequences is discussed in details. Based on above results, we can get the conclusion that the novel TDC sequences and corresponding MC-CDMA architecture have great potential for applications in next generation wireless mobile communications, which require high transmission rate in hostile and complicated channels.

Video telephone service (VTS) is considered one of promising services provided in wideband CDMA (WCDMA) networks. Without a designated call admission policy, VTS calls are expected to suffer from relatively high probability of blocking since they normally have more stringent signal quality requirement than ordinary voice calls. In this letter, we consider a prioritized call admission design in order to reduce the blocking probability of VTS calls, which may encourage the users to access the newly-provided VTS in a more comfortable way. The VTS calls are given a priority by reserving a number of channel-processing equipments. With the reservation, the blocking probability of prioritized VTS calls can be reduced evidently. That of ordinary calls, however, is increasing instead. This letter provides a system model that counts the blocking probabilities of VTS and ordinary calls simultaneously, and numerically examines an adequate level of the prioritization for VTS calls. The results show that the prioritization level should be selected depending on received interference as well as bandwidth required for VTS.

An audio signal level compressor is presented, which is based on the approximation algorithm using an interpolating polynomial. To implement a compression characteristic in a digital audio system, a power calculation with fractional numbers is required and it is difficult to be performed directly in digital circuits. We introduce a polynomial expression to approximate the power operation, then the gain calculation is easily performed with a number of additions, multiplications and a division. Newton's interpolation formula is used to calculate the compression characteristics in a very short time and the obtained compression characteristics are very close to the ideal ones.

Recursive programs are often easier to read and write than iterative ones, but their execution frequently requires large numbers of procedure calls and stack operations. This causes problems in program optimization related to inline coding and the locality of data references. In addition to these problems, defining programs recursively sometimes leads to repetitive execution of similar computations, causing programs to have exponential time complexity. As a result, recursion removal methods, which transform a given recursive program to an iterative one without using the stack and increasing the amount of computation time, have been studied since the 1970s. In 1998, our group proposed a recursion removal method for a linear recursive program. In this paper, we extend the method to deal with non-linear recursive programs with one descent function (RPODs), which are programs of the form f(x) = if p(x) then b(x) else a(c(x),f(d(x)),f(d2(x)),...,f(dn(x))). First, we define the cumulative function for an RPOD. Next, based on the new cumulative function, several transformation techniques for RPODs are shown. These include a unified method of deriving logarithmic-order iterative programs or loop-free programs. Finally, the relationships between our method and various tupling strategies are discussed.

Inoue et al. introduced an automaton on a two-dimensional tape, which decides acceptance or rejection of an input tape by scanning the tape from various sides by various automata which move one way, and investigated the accepting power of such an automaton. This paper continues the investigation of this type of automata, especially, -type automata (obtained by combining four three-way two-dimensional deterministic finite automata (tr2-dfa's) in "or" fashion) and -type automata (obtained by combining four tr2-dfa's in "and" fashion). We first investigate a relationship between the accepting powers of -type automata and -type automata, and show that they are incomparable. Then, we investigate a hierarchy of the accepting powers based on the number of tr2-dfa's combined. Finally, we briefly describe a relationship between the accepting powers of automata obtained by combining three-way two-dimensional deterministic and nondeterministic finite automata.

Novel microstrip lowpass filters are developed with reduced size and significantly improved stopband characteristics. After introducing quarter-wavelength open stubs, we get one or two transmission zeros in the stopband. By folding the high impedance microstrip lines, we reduce the size of the filter. Three-pole and five-pole lowpass filters are designed, and their measured frequency responses agree well with theoretical predictions.

Fingerprinting is a technique to add identifying marks to each copy of digital contents in order to enhance traceability to a distribution system. Collusion attacks, in which the attackers collect two or more fingerprinted copies and try to generate an untraceable copy, are considered to be a threat for the fingerprinting system. With the aim of enhancing collusion security to the fingerprinting system, several collusion secure codes, such as c-frameproof code, c-secure frameproof code and c-identifiable parent property code, have been proposed. Here, c indicates the maximum number of colluding users. However, a practical construction of the above codes is still an issue because of the tight restrictions originated from their combinatorial properties. In this paper, we introduce an evaluation of frameproof, secure frameproof, and identifiable parent property by the probability that a code has the required property. Then, we focus on random codes. For frameproof and secure frameproof properties, we estimate the average probability that random codes have the required property where the probability is taken over the random construction of codes and random construction of coalitions. For the estimation, we assume the uniform distribution of symbols of random codes and the symbols that the coalitions hold. Therefore, we clarify the adequacy of the assumptions by comparison with numerical results. The estimates and numerical results resemble, which implies the adequacy of the assumption at least in the range of the experiment.

We regard the events of a Markov decision process as the outputs from a Markov information source in order to analyze the randomness of an empirical sequence by the codeword length of the sequence. The randomness is an important viewpoint in reinforcement learning since the learning is to eliminate the randomness and to find an optimal policy. The occurrence of optimal empirical sequence also depends on the randomness. We then introduce the Lempel-Ziv coding for measuring the randomness which consists of the domain size and the stochastic complexity. In experimental results, we confirm that the learning and the occurrence of optimal empirical sequence depend on the randomness and show the fact that in early stages the randomness is mainly characterized by the domain size and as the number of time steps increases the randomness depends greatly on the complexity of Markov decision processes.

We consider space division multiplexing in a MIMO-OFDM system for high data rate transmission. Channel estimation is very important for suppressing interference and demultiplexing signals. In a wireless LAN system such as IEEE 802.11a, only a few training symbols are inserted in each subcarrier. First, we propose a channel estimation method for a MIMO-OFDM system with two training symbols per subcarrier. The basic idea is to estimate the time-domain channel responses between the transmit and receive antennas. The array response vectors for each subcarrier are calculated by applying a fast Fourier transform to them. We then can obtain the adaptive weights to cancel the interference. We show that employing training symbols having a lower condition number of the matrix used for the channel estimation improves the estimation accuracy. Furthermore, we show the bit error rate for several signal detection schemes using the above estimated channel. It is shown that an ordered successive detection based on an MMSE criterion has excellent performance, that is, it can achieve higher-speed transmissions with a lower transmit power.

This paper focuses on the characteristics of tunable half-wavelength resonators and their applications to bandpass filters (BPFs). First, the resonance characteristics of various tunable half-wavelength resonators are examined for the tunabilities of transmission zeros and the center frequency of the proposed BPFs. We examine four types of tunable half-wavelength resonators, namely, an end-coupling resonator and three types of tap-coupling resonators. Secondly, the proposition and design of two types of BPFs using acquired resonators are carried out. The fabrication and experimental application of the resonators and designed BPFs are also performed based on coplanar waveguide (CPW) technologies. Their calculated and measured results are compared with each other. The results show that tunabilities of the transmission zero and the center frequency of the proposed BPF are obtained as expected.

The paper reports a compact and high performance dual-band bandpass filter (BPF) using two types of dual-mode resonators. The dual mode cross shaped resonator and the three dual mode ring resonators in the designed dual-band BPF are excited to control the first and second passband, respectively. It is shown that the designed and fabricated dual-band BPF has narrow bandwidths and very sharp attenuation rate due to the existence of the transmission zeros. The frequency response of the designed dual-band BPF shows good agreement between the simulations and experiments.

The investigation presents a low cost and low insertion loss X-band dual mode bandpass filter (BPF) based on inexpensive commercial FR4 substrate. The proposed filter at a central frequency f0 of 11.3 GHz has high filter performance filter with a fractional bandwidth of 14%, the insertion loss of -2.7 dB, and two transmission zeros. The designed procedures are presented in this letter and the fabricated filter verifies the proposed designed concept.

We consider the multicast routing problem for large-scale wavelength division multiplexing (WDM) optical networks where transmission requests are established by point-to-multipoint connections. To realize multicast routing in WDM optical networks, some nodes need to have light (optical) splitting capability. A node with splitting capability can forward an incoming message to more than one output link. We consider the problem of minimizing the number of split-capable nodes in the network for a given set of multicast requests. The number of wavelengths is fixed and given a priori. We propose a genetic algorithm that exploits the combination of alternative shortest paths for the given multicast requests in order to minimize the number of required split-capable nodes. This algorithm is examined for two realistic networks constructed based on the locations of major cities in Ibaraki Prefecture and those in Kanto District in Japan. Our experimental results show that the proposed algorithm can reduce more than 10% of split-capable nodes compared with other routing algorithms whereby the optimization for the split-capable node placement is not taken into account.

The number of satisfying assignments of k-CNF formulas is computed using the inclusion-exclusion formula for sets of clauses. Recently, it was shown that the information on the sets of clauses of size log k + 2 already uniquely determines the number of satisfying assignments of k-CNF formulas. The proof was, however, only existential and no explicit procedure was presented. In this paper, we show that such a procedure exists.

Test compression / decompression is an efficient method for reducing the test application cost. In this letter we propose a response compression method based on Huffman coding. The proposed method guarantees zero-aliasing and it is independent of the fault model and the structure of a circuit-under-test. Experimental results of the compression ratio and the size of the encoder for the proposed method are presented.

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.