In transmitter diversity, the received signal is the superposition of signals transmitted from transmitter antennas. Thus, the separation of channel characteristics corresponding to each transmitter antennas from these signals is very important. The conventional channel estimation scheme tends to show higher computational complexity for larger channel delay profile. To reduce this computational complexity, significant-tap-catching method has been proposed. However, there is still a burden of complexity for data transmission mode. Reference [14] has shown how to reduce the complexity for data transmission mode in system with constant modulus modulation. However, this method can't reduce the complexity required for multi-level signals such as QAM. In this paper, we propose an efficient channel estimation scheme for OFDM systems with transmitter diversity using space-time trellis coding. The computational complexity of the proposed scheme is independent of channel delay profile. Also, compared with the conventional scheme, the complexity of the proposed scheme is not related to modulation methods including multi-level signals such as QAM. The performance of the proposed scheme is evaluated by computer simulation in various multipath fading environments.

We investigated the truncated convolutional code with the characteristics of a block code for block-based communication systems. Three truncation methods (direct truncation, tail-terminating, and tail-biting method) were introduced by other researchers. Each of the three methods has a weakness: the direct truncation method decreases the minimum distance, the tail-terminating method uses tail bits, and the tail-biting method can only be applied by using a complicated decoder. Although the tail-biting method gives a better BER performance than the other two methods, we cannot apply the tail-biting method in all situations. Occasionally, the tail-biting convolutional code does not exist. Wang et al. presented two necessary conditions for the existence of the tail-biting convolutional code of the rate-1/2 recursive systematic convolutional code. In this paper, we analyze the encoder of the convolutional code as a linear time invariant system, and present two theorems and six corollaries on the existence of the tail-biting convolutional code. These existence conditions are adaptable to all convolutional codes. In the communication system using the truncated convolutional code, these results are applicable to determining the truncation method.

In this paper, three algorithms are proposed for rate maximization (RM) of transmitted data in multichannel (MC) communications, subject to joint constraints on available energy budget and tolerable degradation of service (DOS). Altogether referred to as the RM algorithms, they consist of the EADRM, the DADRM, and the fDADRM algorithms. Based on the rate-distortion optimization theory, closed-form expressions for optimally distributing the energy (for EADRM) or DOS (for DADRM and fDADRM ) among the subchannels (SC's) are derived, when the bit allocation is pre-specified. The specification of bit allocations is achieved by the use of the so-called eligible bit allocation matrix (EBAM), which is a function of the total data rate and the number of SC's. A greedy approach is adopted, where the total data rate is kept on raising until the relevant constraints can no longer be satisfied. While all three RM algorithms essentially generate identical maximum data rates, the fDADRM algorithm is much faster than the other two in computation. As compared to the result achievable by a single-channel communication scheme, the RM algorithms produce a much higher data rate for spectrally shaped channels.

Fiber-optic access system integration is the key to providing various kinds of services to home users. The combination of ATM- and SCM-PON systems is essential to support a high-speed data service and analog/digital video distribution services. From this viewpoint, a frequency-division- multiplexing technique for digital baseband and subcarrier multiplexed signals is required to achieve system integration. However, system integration for these two access systems has not been fully investigated yet. The SCM-PON system, which uses a super wideband optical FM converter, will enable these two different kinds of access system (ATM and SCM) to be integrated. In this paper, we describe experimentally obtained results for frequency- division-multiplexed signals consisting of digital baseband and subcarrier- multiplexed signals. The experiments were carried out using a 622-Mb/s baseband signal and an FM-converted signal containing AM and 64QAM signals. The experimental results reveal that the inter-channel interference between the digital baseband and FM-converted signals restricts the number of subcarriers for AM and 64QAM. With an intermediate frequency of 3 GHz for the FM-converted signal, an FDM signal consisting of 622-Mb/s baseband, 30 carriers of 64QAM, and 11 carriers of AM was successfully transmitted.

In this paper, we propose a new channel allocation scheme, which is designed to efficiently carry out handoffs in wireless networks. Our scheme is based on conventional handoff methods, which include the channel reservation, carrying and sub-rating methods to assign channels for handoffs. First, we reserve a number of channels only for handoffs. Second, if there is no available channel in the next cell during handoff, the mobile station is allowed to carry a movable channel into the next cell. Finally, in order to avoid co-channel interference due to channel mobility, we adopt the sub-rating method for its carried channel. We evaluated our scheme using both Markov analysis and computer simulation. The analytical and simulation results indicate that our scheme may offer better performance than conventional handoff schemes in terms of handoff blocking probability and channel utilization.

It is well known that some of urban man-made noises can be characterized by a wideband impulsive noise (pure impulsive noise). The presence of this pure impulsive noise may significantly degrade the wireless digital transmission performance. As the data rate becomes higher and the radio bandwidth becomes wider, the performance degradation due to pure impulsive interference may become larger. In this paper, the DS-CDMA transmission performance in the presence of pure impulsive interference is theoretically analyzed. First, the BER expressions are derived for DS-CDMA with antenna diversity and Rake combining in a frequency selective fading channel. Then, the numerical computation based on Monte-Carlo method is performed to evaluate the BER performance. Two types of error floor are observed: one is due to impulsive interference and the other due to the multi access interference (MAI). It is found that the error floor due to impulsive interference becomes larger as the area of impulse and the error floor is linearly proportional to the impulse occurrence rate. Furthermore, it is found that the antenna diversity and Rake combining do not help to reduce the error floor caused by impulsive interference and that the influence of impulsive interference can be negligible when the channel is limited by the MAI (i.e., large number of users are in communication).

Adaptive prediction iterative channel estimation is presented for combined antenna diversity and coherent rake reception of direct sequence spread spectrum (DSSS) signals. Its first stage uses pilot-aided adaptive prediction channel estimation, while the succeeding iteration stages use decision feedback and moving average filtering for channel re-estimation. The bit error rate (BER) performance of DSSS signal computer simulations evaluate transmission in a frequency selective Rayleigh fading channel. It is found that the adaptive prediction iterative channel estimation is superior to the non adaptive iterative channel estimation using the conventional weighted multi-slot averaging (WMSA) filtering at the first iteration stage, particularly in a fast fading channel.

Transmit power planning in the W-CDMA downlink, especially planning of the total transmit power of base stations and their apportionment to common control channels, is discussed taking cell coverage planning into account. A transmit power planning procedure is proposed for common control channels based on both link-level and system-level simulations. An analysis on optimum power allocation for common pilot channels is also presented. Link budgets that are applicable to downlink common control channels are developed and presented.

In this paper, to investigate the processing requirements at each node and offered network load of receiver-based and router-based protocols, we analyze the number of packet transmissions on each link until all receivers receive a packet for an arbitrary multicast-tree topology and packet loss probability considering the correlation between loss events of a packet for different receivers. In order to show the effectiveness of the analytical results, we demonstrate the numerical examples for various conditions. The numerical results show that local recovery protocols, especially router-based protocol can reduce the offered network load due to data packets and their acknowledgements, and can decentralize processing requirement of sending nodes effectively. Further, we reveal the influence of the locations of group senders on the performance of both protocols.

The development of efficient quality of service (QoS) routing algorithms in a high-speed network environment is a very important and at the same time very difficult task due to the need to provide divergent services with multiple QoS requirements. Recently heuristic algorithms based on Lagrange relaxation techniques have been proposed to resolve the contradiction between the time complexity and the quality of solution. In this paper, we investigate the performance of two heuristic algorithms, LR_DCLC and NR_DCLC, for the delay-constrained least-cost (DCLC) routing problem. Algorithm LR_DCLC is based on linear relaxation, while algorithm NR_DCLC, which is proposed in this paper, is based on nonlinear relaxation. A large number of simulations demonstrate that even though both algorithms have very good performance, NR_DCLC can obtain much better solutions than LR_DCLC by running Dijkstra's algorithm on average a few more times, especially in the case when the optimal solutions are hard to find.

Performance evaluation criterion is one of the most important issues for design of network traffic control mechanisms and algorithms. Due to multiple performance objectives of network traffic control, performance evaluation criteria must include multiple performance metrics executed simultaneously, which is called integrated performance evaluation criteria. In this paper, we analyze various performance metrics of network traffic control, and propose three integrated performance evaluation criteria. One is the improvement on original Power formula; our new Power formula is based on the multi-service-class model. Another is about the fairness of user's QoS (Quality of Service) requirements (queuing delay and loss rate); especially the detailed discussion on Proportional Fairness Principle is given. And the third one is the integration of preceding two, in which the throughput, queuing delay, packet loss rate, and the fairness are considered simultaneously.

Due to the fast advances in wireless networking technology, there is an increasing number of hosts using TCP/IP to connect to the Internet via wireless links. However, it is known that TCP performs poorly on paths with wireless links. This paper presents an approach to address the problem. In the proposed approach, a sender controls the size of transmitted packets and observes the number of losses for each of the controlled packet sizes. It then estimates the number of congestion losses and random losses separately. The results are used to decide whether to reduce the window size or not when a packet loss is detected. We use ns-2 simulator to evaluate the proposed approach. The simulation results show that the proposed approach is able to achieve between 25% and 150% better throughput than FACK under the byte-error rate range of 510^-5 to 2010^-5.

In this paper, we study a low profile top loaded monopole antenna. By changing the number, thickness, position and shape of post(s), the input and radiation characteristic due to parameters of matching post(s) are investigated. The low profile top loaded monopole antenna (TLMA) is known as a suitable way for antenna's miniaturization. But it is also reported that the parameters of matching post influence the input and radiation characteristic greatly. The FDTD method is well suit for use in analyzing both the plate and wire structure. And to improve the calculation effect efficiency, the non-uniform mesh FDTD algorithm is used. From the measurement and simulation results, we propose the most suitable parameters of matching structure for low profile top loaded monopole antenna.

The authors propose a novel 3-way power divider named a planar cross-junction, which is used as the center feed for single-layer slotted waveguide arrays. A feeding waveguide consisting of a cascade connection of these dividers is placed at the middle of radiating waveguide in a single layer. The length of radiating waveguides is halved; the long line effect in traveling wave operation is halved and bandwidth is widened. One divider as a unit is designed by Galerkin's method of moments to suppress the reflection and to control the amplitude and the phase of the divided power into two radiating waveguides on both sides of a feed one. Two types of the cross-junction with a different divided power ratio are designed and tested by experiments in 4 GHz band. The mutual coupling effects between two adjacent cross-junctions as cascaded in a feeding waveguide of the array are predicted to be small enough; units designed here are directly applicable for a multiple-way power divider.

A new iterative algorithm based on the Gauss-Seidel iteration method is proposed to solve the matrix equation in the MoM analysis of the array antennas. In the new algorithm, the impedance matrix is decomposed into a number of sub matrices, which describe the self and mutual impedance between the groups of the array, and each sub matrix is regarded as a basic iteration unit rather than the matrix element in the ordinary Gauss-Seidel iteration method. It is found that the convergence condition of the ordinary Gauss-Seidel iteration scheme is very strict for the practical use, while the convergence characteristics of the present algorithm are greatly improved. The new algorithm can be applied to the sub domain MoM with a fast convergence if the grouping technique is properly used. The computation time for solving the matrix equation is reduced to be almost proportional to the square of the number of the array elements. The present method is effective in MoM analysis of solving large-scale array antennas.

This paper presents the basic characteristics of a forced resonant type EMI dipole antenna for frequencies below 80 MHz in which two reactance elements are used for the impedance matching at the feed point. The input impedance of the short dipole less than half-wavelength is controlled by the properly determined loading position and the value of loading reactance. The integral equation for unknown current distribution is solved by Galerkin's method of moments with piecewise sinusoidal functions. The numerical results show that the small-sized EMI dipole antenna with lower antenna factors for frequencies below 80 MHz can be realized by the reactance loading. In case the proposed center driven small-sized EMI dipole antenna with 0.3λ length is loaded c=0.133λ from the center, the input impedance is matched at feed line with 50 Ω, and hence the antenna has lower factors in the frequency range of 30 to 80 MHz. Also the normalized site attenuation characteristics are presented for the forced resonant type EMI dipole antenna.

Advances in broadcast digitization have been rapid in Japan since the broadcasting satellite (BS) digital broadcast services commenced in December 2000. It requires that the receiver, which may also be connected to appliances using a Home Network, has an inbuilt HDD for storing interesting programs. However, it is difficult to guarantee QoS level on a Home Network composed of heterogeneous sub-networks. Therefore, for the purpose of an efficient and appropriate transmission of a video stream, such as MPEG over the Home Network, a new scalable MPEG transmission method is required. For this we propose a Scalability method allowing for Impairments Propagation (SIP), which takes into account the impairments propagated to other frames due to the loss of a macroblock in a given frame. In this paper, we introduce the SIP technique, analyze it mathematically, and evaluate its performance.

The locally optimum rank detector achieves a simpler detector structure when reference observations, in addition to regular observations, are available. Without reference observations, we have to use the sign statistics of regular observations, and using the sign statistics results in a complex detector structure. Instead, more computations are necessary to deal with additional reference observations.

The one-sample locally optimum rank detector test statistics for composite signals in multiplicative and signal-dependent noise are obtained. Since the one-sample locally optimum rank detector makes use of the sign statistics of observations as well as the rank statistics, both 'even' and 'odd' score functions have to be considered. Although the one-sample locally optimum rank detector requires two score functions while the two-sample detector requires only one score function, the one-sample detector requires fewer calculations since it has to rank fewer observations.

The two-sample locally optimum rank detector test statistics for composite signals in additive, multiplicative, and signal-dependent noise are obtained in this letter. Compared with the structure of the one-sample locally optimum rank detector, that of the two-sample locally optimum rank detector is shown to be simpler, although it needs more computations. It is known that there is a trade-off of computational complexity and structural simplicity between the one- and two-sample detectors.

Using the great one-time password concept, the widely utilized one-way authentication scheme S/Key provides well protection against replay attacks. In this paper, S/key is enhanced to secure transactions in a critical environment. The proposed scheme is free from any of server spoofing attacks, preplay attacks, and off-line dictionary attacks. A session key here is also established to provide confidentiality. Moreover, simplicity and efficiency are taken into consideration from the user's point of view. A smart card is applied to simplify the user login process and only the hash function is used to keep its efficiency. Therefore, the scheme proposed hereinafter is able to build a safer shield for sensitive transactions like on-line banking or on-line trading in bonds and securities.

Recently, Lin et al. addressed two weaknesses of a new strong-password authentication scheme, the SAS protocol, and then proposed an improved one called the OSPA (Optimal Strong-Password Authentication) protocol. However, we find that both the OSPA protocol and the SAS protocol are vulnerable to the stolen-verifier attack.

DS-CDMA provides a flexible support for the low-to-high bit rate of multimedia services upon a specific user's request. A simple capacity expression is derived for a power-controlled reverse link of orthogonal multi-code DS-CDMA with multiple connections. It is found that an orthogonal multi-code user having multiple connections is equivalent to a single connection user, but with a spreading factor reduced by a factor of the total number of parallel codes and a required signal energy per symbol-to-interference plus noise power spectrum density ratio which is the average taken over multiple connections. Furthermore, the use of antenna diversity is found equivalent to the use of higher spreading factor increased by a factor of the number of antennas.

The reception quality of terrestrial digital broadcasting when the directional pattern of a mobile terminal is controlled has been experimentally evaluated using test signal. It was found that the reception probabilities with a controlled directional pattern were significantly improved over the case when an omni-directional antenna was used.

When M-ary QAM (MQAM) signals experience the Rician fading channels, diversity schemes can minimize the effects of these fadings since deep fades seldom occur simultaneously during the same time intervals on two or more paths. The symbol error probability of MQAM systems using L-branch maximum ratio combining (MRC) diversity reception is derived theoretically over frequency-nonselective slow Rician fading channels with an additive white Gaussian noise (AWGN). This derived evaluation is expressed as the infinite series composed of hypergeometric and gamma functions. These performance evaluations allow designers to determine M-ary modulation methods for Rician fading environments.

In this study, a new signal model suitable for indoor environments with large angle spread is proposed to improve the performance of indoor wireless communication systems. And antenna array techniques adopted for this model are discussed. It is based on the far-field signal assumption. The optimal beamforming weight vector is obtained by applying the antenna algorithm based on the maximum signal to interference noise ratio criterion to the model. The proposed model is verified using a mathematical analysis and computer simulations.

We present pipelined simple matching, called PSM, for an input buffered switch to relax the scheduling timing constraint by modifying pipelined maximal-sized matching (PMM). Like the pipelined manner of PMM, to produce the matching results in every time slot, PSM employs multiple subschedulers which take more than one time slot to complete matching. Using only head-of-line information of input buffers, PSM successively sends each request to all subschedulers to provide a better matching opportunity. To obtain better performance, PSM uses unique starting points of scheduling pointers in which the difference between the starting points is equal for any two adjacent subschedulers for a same output. Using computer simulations under a uniform traffic, we show PSM is more appropriate than PMM for pipelined scheduling of an input buffered switch.

Using eigenstructure approach to form interference canceler is very sensitive to pointing error, especially when the interference number is overestimated. This Letter presents an effective technique to correct the pointing error by the projection matrix of noise subspace. Based on the corrected steering angle, a proper blocking matrix of the eigenstructure interference canceler can be obtained to suppress the leakage of desired signal. Therefore, signal cancellation does not occur, even the interference number is overestimated in constructing the interference subspace.

This paper proposes a new blind adaptive algorithm for computing the weight vector of an antenna array system. The new technique utilizes a Generalized On-Off algorithm to obtain the weight vector from the pilot channel of IS2000 1X system, of which the processing gain can be controlled arbitrarily. The proposed algorithm generates a suboptimal weight vector maximizing the SINR (signal to interference plus noise ratio) with a linear computational load. Based on the analysis obtained from various simulations, it is observed that the proposed algorithm is suitable for the practical IS2000 1X mobile communication environments.

Short range communication between roadside equipment and on-board equipment is very important for ITS (Intelligent Transport System). In this paper, for reliable roadside communication, the radio multi-path propagation at 2.4 GHz at roadside was measured and analyzed.

This paper presents efficient file management of a hard disk drive embedded digital satellite receiver. The digital broadcasting technology enables multimedia access via broadcasting systems. The amount of digital data to be processed is increased remarkably as compared to the previous analog broadcasting environments. The efficient digital data storage and management technology are discussed in this paper to cope with these changes. The DSR uses a new file system that is designed by considering disk cluster sizes and limited memories in the system, which is more appropriate than that of general Personal Computers. The proposed system enables us to watch broadcasting and to manage multimedia data efficiently.