Turbo coding is a powerful coding technique that can provide highly reliable data transmission at extremely low signal-to-noise ratios. Owing to the computational complexity of the employed decoding algorithm, the realization of turbo decoders usually takes a large amount of memory space and potentially long decoding delay. Therefore, an efficient memory management strategy becomes one of the key factors toward successfully implementing turbo decoders. This paper focuses on the development of general structures for efficient memory management of turbo decoders employing the sliding-window (Log-) MAP algorithm. Three different structures and the associated mathematic representations are derived to evaluate the required memory size, average decoding rate, and latency based on the speed and the number of the adopted processors. Comparative results show the dependency of the resulting performance based on a set of parameters; thus provide useful and general information on practical implementations of turbo decoders.

A bi-directional WDM transmission link that changes the channel-count assigned in each direction is proposed for efficiently accommodating IP traffic which is characterized by directional volume asymmetry. A novel bi-directional optical amplifier is also proposed for overcoming the problems that arise in realizing the proposed link. The asymmetric, bi-directional, repeatered WDM transmission of 8 (total) 10 Gbit/s, 50 GHz-spaced channels over eleven 50 km spans is successfully demonstrated. The experimental results clarify that, owing to the use of the proposed bi-directional amplifier, directional asymmetry in channel-count and Rayleigh backscattering do not result in any significant performance degradation. Based upon an analysis of backscattering induced impairment, we show that the total transmission loss of 1000 dB can be supported if the span loss is 20 dB.

OFDM is a good scheme to transmit high rate data under a multi-path environment. With a sufficiently long guard interval (GI), it is possible to totally eliminate interference between symbols or carriers with OFDM. However, long guard intervals reduce the spectrum efficiency of OFDM. Thus, shortening the guard interval as much as possible is highly desirable. As short guard intervals will usually result in interference in an OFDM system, an interference canceller would be necessary to enable the use of short guard intervals without unduly degrading system performance. This paper presents a possible adaptive interference cancellation scheme for OFDM to help attain this objective.

The detection performance of coherent OFDM receivers significantly depends on the accuracy of channel estimation. The accuracy of channel estimation can be improved by properly post-processing the channel estimate using a so-called channel estimation filter (CEF). Minimum mean-squared error (MMSE) filter is known optimum as the CEF, but it may not be practical due to its implementation complexity. We consider the use of a reduced-complexity CEF whose tap coefficient is real-valued and symmetrically weighted (RSW). The optimum RSW CEF is analytically designed using the SNR and multi-path intensity profile of the channel. For further improvement, we also propose a method to adapt the coefficient of the RSW CEF to the channel condition. Numerical results show that the proposed RSW CEF can provide channel estimation performance comparable to that of linear MMSE filter, while significantly reducing the computational complexity. In addition, the proposed RSW CEF can provide performance robust to unknown timing offset with a fractional dB loss compared to the optimum one.

Ordered successive MMSE detection (OSD) can achieve a good tradeoff between performance and complexity for multiple-input multiple-output (MIMO) wireless systems where different data streams are transmitted and received simultaneously over several equal number of transmit and receive antennas. However, over time-varying MIMO channels, the performance of OSD is degraded with realistic channel estimation. In this paper, we introduce two different approaches in order to improve the performance of OSD. First, we propose to improve the accuracy of the generated nulling weights by using a modified noise variance that takes into consideration the weights update lag error besides to the noise and channel estimation errors. Second, we introduce a new iteration approach in order to improve the decisions made by OSD on transmitted streams. The proposed iterative scheme, named as backward iterative detection, exploits the tentative decisions on lately detected streams in order to mainly improve the decision on the firstly detected stream that limits the overall performance. Simulation results of combining both approaches show significant performance improvements of OSD.

In this paper, we propose a new predictive location management strategy that reduces the update cost while restricting the paging load optimized for mobiles roaming with traceable patterns. Enhanced with directional predictive capabilities offered by Kalman filtering, new update boundaries are assigned to better reflect the movement patterns of individual mobiles upon location registration. Thus, while complying with the required delay constraints, QoS measures such as throughput will not need to be sacrificed as a result of increasing update threshold. The contribution of this paper is two-fold: (1) to propose a distribution model that is capable of describing a wide range of movement patterns with varying correlation between traveling directions and (2) to show the capabilities (in terms of reliable performances) of the Kalman filter in predicting future movement patterns. Simulation results have successfully demonstrated the ability of the Kalman filter in assigning update boundaries capable of reflecting a mobile's roaming characteristics. The performance gains achieved mainly through a significant reduction in the number of updates indicate its potential for promoting better bandwidth conservation.

For the reception of MC-CDMA signals in a frequency-selective fading channel, frequency-domain equalization is necessary before despreading. In this paper, joint antenna diversity combining and one-tap frequency-domain equalization is considered (simply referred to as the joint antenna diversity & equalization, in this paper). A receiver structure for joint antenna diversity & equalization is presented and the unified weights based on minimum mean square error (MMSE) criterion are found in the presence of multi-users with different spreading factors and transmit powers. For comparison, antenna diversity combining after despreading using MMSE combining (MMSEC) is also considered. The achievable bit error rate (BER) performances with joint antenna diversity & equalization and with antenna diversity after MMSEC despreading in a frequency-selective Rayleigh fading channel are evaluated by computer simulations and compared.

The performance of a GMPLS switching architecture with or without the flush capability is studied. For this switching architecture, we propose a queueing model that includes the control plane, the switch buffer mechanism, and the flush mechanism. The flush capability is included to reduce the out-of-sequence problem due to dynamic path changes. The behavior of aggregated streams, the label-setup and release policies, and the mechanisms for efficient resource allocation are all covered. With the proposed model, one can select appropriate parameters for the label-setup policy and the label-release policy to match the traffic load and network environment. Key performance metrics, such as the label-setup rate, the switching ratio, the bandwidth utilization of the label switched path, the average delay, and the average packet loss rate, can all be evaluated via this mathematical model. Numerical results and simulations are used to verify the accuracy of the proposed queueing model. Furthermore, we adopt trace simulation to certify the applicability the proposed model. The trade-off among these performance metrics can be observed as well.

The performance of a mobile ad hoc network (MANET) is related to the efficiency of the routing protocol in adapting to changes in the network topology and the link status. However, the use of many different mobility models without a unified quantitative "measure" of the mobility has made it very difficult to compare the results of independent performance studies of routing protocols. In this paper, a mobility measure for MANETs is proposed that is flexible and consistent. It is flexible because one can customize the definition of mobility using a remoteness function. It is consistent because it has a linear relationship with the rate at which links are established or broken for a wide range of network scenarios. This consistency is the strength of the proposed mobility measure because the mobility measure reliably represents the link change rate regardless of network scenarios.

We propose a method of IP traffic management where the TCP performance at a bottleneck link is estimated from monitored data about the behavior of the number of active flows versus link utilization, which are both easy to measure. This method is based on our findings that (i) TCP performance remains constant as long as the link utilization is below some threshold value, but becomes degraded when it exceeds this value and (ii) the number of active flows increases linearly with link utilization up to the same value, and the increase becomes nonlinear above it. Though this threshold may vary depending on traffic/network conditions, our method requires neither predetermination of a threshold on the basis of assumed traffic conditions nor direct measurement of TCP performance.

In this paper, we consider the problem of bearing estimation for spatially distributed sources in unknown spatially-correlated noise. Assumed that the noise covariance matrix is centro-Hermitian, a differential denoising scheme is developed. Combined it with the classic DSPE algorithm, a differential denoising estimator is formulated. Its modified version is also derived. Exactly, the differential processing is first imposed on the covariance matrix of array outputs. The resulting differential signal subspace (DSS) is then utilized to weight array outputs. The noise components orthogonal to DSS are eliminated. Based on eigenvalue decomposition of the covariance matrix of weighted array outputs, the DSPE null spectrum is constructed. The asymptotic performance of the proposed bearing estimator is evaluated in a closed form. Moreover, in order to improve the performance of bearing estimation in case of low signal-to-noise ratio, a modified differential denoising estimator is proposed. Simulation results show the effectiveness of the proposed estimators under the low SNR case. The impacts of angular spread and number of sensors are also investigated.

In this paper, a non-adaptive optimal transform (NAOT) coding system is proposed. Note that the energy-invariant property in an orthogonal transformation and that the mean squared error (MSE) of a reconstructed image is proportional to the total energy of transform coefficients discarded in the coding process. The NAOT coding system is developed and proved optimal in the sense of minimum average energy loss. Basically, the proposed coding system consists of the following steps. First, obtain the average energy image block from transform image blocks. Second, sort the average energy image block in the descending order by energy where the sorted indices are recorded. Third, specify the number of coefficients, M, to be retained in the coding process. Fourth, the first M sorted indices form a set denoted as S_M through which the problem of optimal feature selection in transform coding is solved. Fifth, find a fixed mask A_M from set S_M which is then used to select M significant transform coefficients in image blocks. Finally, the M selected coefficients are quantized and coded by the order as in S_M. To verify the NAOT coding system, simulations are performed on several examples. In the simulation, the optimality and the optimal feature selection in the NAOT coding system are justified. Also, the effectiveness of the proposed S_M-based selection approach is compared with the zigzag scan used in the JPEG. For fair comparison, the JPEG is modified to code only M transform coefficients. Simulation results indicate that the performance of S_M-based selection approach is superior or identical to the zigzag scan in terms of PSNR. Finally, the performance comparison between the NAOT coding system and the JPEG is made. It suggests that the proposed NAOT coding system is able to trade very little PSNR for significant bit rate reduction when compared with the JPEG. Or it can be said that the JPEG wastes much bit rate to improve very little PSNR on the reconstructed image, when compared with the NAOT coding system.

Recently, Zhu et al. proposed an password-based authenticated key exchange protocol based on RSA such that it is efficient enough to be implemented on most of the target low-power devices such as smart cards and low-power Personal Digital Assistants in wireless networks. They claimed that the proposed scheme is secure against dictionary attacks. In this paper, we show that the scheme proposed by Zhu et al. is insecure against undetectable on-line password guessing attacks. Furthermore, we examine Zhu et al.'s protocol and find that Zhu et al.'s protocol does not achieve explicit key authentication. An improved version is then proposed to defeat the undetectable on-line password guessing attacks and also provide explicit key authentication.

This letter reports on an approximation of the mean waiting time in a finite buffer queue with delay priority and loss priority. Both priorities are controlled by head-of-the-line (HOL) priority scheduling and buffer reservation. The proposed approximation is based on the known results on a HOL-priority queue with infinite buffer and a finite buffer queue with FIFO scheduling and buffer reservation. The accuracy of the approximation is validated by comparing exact and approximate results. The approximation provides good estimates when the blocking probabilities at the buffer controlled by the buffer reservation are low.

In this paper, a novel 622 Mb/s burst-mode clock and data recovery (CDR) circuits with muxed oscillators are realized for passive optical network (PON) application. The CDR circuits are implemented with 0.35 µm CMOS process technology. Lock is accomplished on the first data transition and data are sampled at the optimal point. The experimental results show that the proposed CDR circuits recover the incoming 400-622 Mb/s burst mode input data without errors.

This letter proposes a novel technique for evaluating the longitudinal distribution of the Raman gain characteristics in optical fibers connected to a reference optical fiber with a known Raman gain efficiency. This technique can evaluate the Raman gain efficiency in test fibers using a simplified experimental setup. We performed experiments on various test fibers and confirmed that their Raman gain efficiency can be obtained easily and accurately by employing a reference fiber.

We propose and demonstrate a directly modulated AM-VSB CATV system employing split-band and optical vestigial sideband (VSB) modulation techniques. Systems' performance can be improved by using optical VSB modulation and split-band techniques simultaneously. Our proposed directly modulated transmission system is simpler and more cost-effective than conventional externally modulated transmission system because of external modulator and complicated stimulated Brillouin scattering (SBS)-suppression method are not required.

In optical transport networks that use 2R optoelectronic wavelength converters, performance degradation is expected due to the accumulation of timing-jitter. We theoretically analyze the effects of timing-jitter and the cascadability of 2R optoelectronic wavelength converters based on a nonlinear signal model. We measured the cascadability in a 40-km re-circulation loop for 10 Gb/s signal.

In this paper, we introduce an analytical model of CDMA reverse link power control based on the asymptotic theory. The effect of the SIR threshold value on the transient behavior is addressed and the optimal value of the threshold to achieve the fast convergence without oscillation is derived. In addition, the usefulness of the asymptotic analysis is confirmed by simulations.

This letter presents a lower bound and approximation for the coverage probability of the pilot channel that can be used for a CDMA downlink design. The approximation of a compound truncated Poisson distribution is used to obtain a closed form equation for the coverage probability of the pilot channel. Computer simulations show that our lower bound curve is truly less than the empirical curve, and our proposed approximation agrees well with the empirical result.

In this letter, we propose the Low-Density Parity-Check (LDPC) coded Orthogonal Frequency Division Multiplexing (OFDM) systems to improve the error rate performance of OFDM. We also evaluate the iterative decoding performance on both an AWGN and a frequency-selective fading channels. We show that when the energy per information bit to the noise power spectral density ratio E_b/N₀ is not small, the LDPC coded OFDM (LDPC-COFDM) systems have the good error rate performance with a small number of iterations. We also show that when the E_b/N₀ is small, the BER of the LDPC-COFDM systems is worse than that of the Turbo coded OFDM (TCOFDM) systems, while when the E_b/N₀ is not small, the BER of the LDPC-COFDM systems is better with a small number of iterations.

Combining a layered space-time receiver with the OFDM for high-rate transmissions requires the multi-channel estimation process. So, this letter proposes a time-domain approach for new preamble structure in OFDM-based multiple antenna systems, and investigates the channel estimation performance based on the semi-blind processing and its imperfectness by using time-domain windowing. The proposed preamble can estimate the multi-channel up to the 8 transmit antennas in the WLAN standards using two long preambles.

The channel noise in OFDM systems affects the accuracy of channel estimation, deteriorating the performance of equalization. We present a novel algorithm with MMSE (Minimum Mean Square Error) channel estimation based on Hadamard Transform, to mitigate the effects of noise. The performance of the proposed algorithm is proved to be better than that with LS (Least Square) estimation, and very close to that with the MMSE estimation based on Fourier Transform, while the computation required is pretty small due to the use of Hadamard Transform.

Multi-Code CDMA (MC-CDMA) can not only be integrated easily with a conventional CDMA system, but also achieve good spectral efficiency and high processing gain. MC-CDMA requires a linear amplifier due to the increasing value of its peak-to-average power ratio (PAPR) as the number of codes increases. As such, a multi-phased MC-CDMA (MP-CDMA) system is proposed to provide a variable rate service that is not susceptible to the nonlinear characteristics of an amplifier. A clipping technique is used between the output of a multi-code modulator and the input of an MPSK modulator to improve the performance of the MPSK chip demodulator and reduce the system's complexity. System performance is analyzed and compared with the number of codes and clipping levels. The optimum clipping level is also evaluated for the number of codes on both AWGN and flat fading channels.

The performance enhancement technology for indoor-to-outdoor wireless communication systems is discussed in this study. In outdoor communication systems, transmitted signals may be severely degraded mainly by multipath fading effect of the channel and this problem can be overcome using conventional multiple antenna technology and array signal processing algorithms. But, since channel characteristics depend on both multipath fading and angle spread in indoor-to-outdoor communication systems, conventional algorithms which do not consider the effect caused by angle spread cannot give good results. In this letter, characteristics of indoor-to-outdoor channels are analyzed and a channel model suitable for this situation is proposed. And a new array antenna processing algorithm exploiting the concept of the mean steering vector is presented and the system performance is analyzed. It can be shown that the proposed algorithm outperforms conventional methods through computer simulations for the case in which signals sent from indoor transmitters arrive at outdoor receivers.

We propose an effective method to localize a maneuvering mobile station by means of fixed base stations using the interacting multiple model (IMM) supporting the geometry-based localization algorithms. Representative performance analysis confirms that the proposed IMM solution significantly reduces location error and is better than that of Kalman filter implementation.

A mathematical expression for the received signal power in a severe frequency-selective fading channel is derived. Using the derived expression, the signal power distributions are obtained by Monte-Carlo simulation and compared with the Nakagami m-power distribution. It is found that the power distribution matches well with the Nakagami m-power distribution when the multipath channel has a uniform power delay profile.

It is expected that per-user customized services are widely used in next generation Personal Communication Network. To provide personalized services for each call, per-user service profiles are frequently referenced, so efficient service profile management is essentially required. To provide service profile based services, typically two schemes can be employed: One is Intelligent Network based Central scheme and the other is IMT-2000 based full replication scheme, we refer to as Follow-Me Replication Unconditional (FMRU). Since the Central scheme only depends on the service call rate and the FMRU is merely dependent on the movement rate, it is apparent that the FMRU scheme outperforms the Central scheme if the call-to-mobility ratio (CMR) is large, and vice versa. In this paper, we propose a new service profile replication schemes, Adaptive Follow-Me Replication Conditional (AFMRC) that determine replication automatically according to the user's varying CMR in real-time. We compared the performance of the AFMRC with the previous non-adaptive Follow-Me Replication Conditional (FMRC) scheme. Performance results indicate that as the CMR of a user changes, AFMRC adapts well compared to the existing schemes.

Temporal locality in IP destination address sequences can be captured by the addresses' reuse distance distribution. Based on measurements from data for a wide range of networks, we propose an accurate empirical model in contrast to results derived from the stationarity assumption of address generation processes.

A special group of voice application services (VASs) are promising contents for wireless as well as wireline networks. Without a designated call admission policy, VAS calls are expected to suffer from relatively high probability of blocking since they normally require better signal quality than ordinary voice calls. In this letter, we consider a prioritized call admission design in order to reduce the blocking probability of VAS calls, which makes the users feel the newly-provided VAS in belief. The VAS calls are given a priority by reserving a number of channel-processing hardwares. With the reservation, the blocking probability of prioritized VAS calls can be evidently reduced. That of ordinary calls, however, is increasing instead. This letter provides a system model that counts the blocking probabilities of VAS and ordinary calls simultaneously, and numerically examines an adequate level of the prioritization for VAS calls.