To increase the spectral utilization efficiency of a wireless link, multiple-input multiple-output (MIMO) systems can be employed to transmit several data streams in parallel at the same time and on the same frequency but from different transmit antennas. However, at the receiver side multi-stream detection is needed. In this paper, ordered successive MMSE detection (OSD) is considered as a low-complexity detection scheme. OSD's main computational cost lies in computing the nulling weights that correspond to each stage of successive detection. In this paper, we develop an efficient semi-adaptive approach to generate MMSE weights. This semi-adaptive approach efficiently combines two approaches: channel estimates-based direct matrix inversion weights generation (direct approach) and Recursive Least Squares (RLS) algorithm-based weights generation (adaptive approach). Although the direct approach alone performs better than the adaptive approach, it is more complex for updating weights within the tracking mode. On the other hand, the adaptive approach alone is less complex in updating weights within the tracking mode, but converges slowly within the training mode. Our combined semi-adaptive approach effectively offsets these disadvantages. We demonstrate, through computer simulations, that the semi-adaptive approach can achieve the BER of the direct approach in slow time-varying MIMO channels, while its computational complexity is less than or comparable to that of the adaptive approach.

The present paper introduces a new construction of a class of binary sequence set having a zero-correlation zone (hereafter binary zcz sequence set). The cross-correlation function and the side-lobe of the auto-correlation function of the proposed sequence set is zero for the phase shifts within the zero-correlation zone. This paper shows that such a construction generates a binary zcz sequence set from an arbitrary pair of Hadamard matrices of common size. Since the proposed sequence construction generates a sequence set from an arbitrary pair of Hadamard matrices, many more types of sequence sets can be generated by the proposed sequence construction than is possible by a sequence construction that generates sequence sets from a single arbitrary Hadamard matrix.

Adaptive background techniques are useful for a wide spectrum of applications, ranging from security surveillance, traffic monitoring to medical and space imaging. With a properly estimated background, moving or new objects can be easily detected and tracked. Existing techniques are not suitable for real-world implementation, either because they are slow or because they do not perform well in the presence of frequent outliers or camera motion. We address the issue by computing a learning rate for each pixel, a function of a local confidence value that estimates whether a pixel is (or not) an outlier, and a global correlation value that detects camera motion. After discussing the role of each parameter, we report experimental results, showing that our technique is fast but efficient, even in a real-world situation. Furthermore, we show that the same method applies equally well to a 3-camera stereoscopic system for depth perception.

This study proposed the new method to minimize distortion of the ST segment and noise deletion of ECG baseline wander. In general, the standard filter and adaptive filter are used to remove the baseline wander of the ECG. The standard filter, however, is limited because the frequency of the baseline signal is variable and the baseline wander's spectrum overlaps with the ST segment's spectrum, and for the adaptive filter, it is difficult to select the reference signal. This study proposed a new, structured adaptive filter that is to remove noise without reference signal using neural networks. In order to confirm performance, this paper used ECG data of MIT-BIHs and obtained significant results through the tests.

Quasi-millimeter-wave-band Fixed Wireless Access (FWA) systems have higher transmission rates than 2.4-GHz or 5-GHz systems, because the available frequency bandwidth for quasi-millimeter-wave-bands is broader than the 2.4-GHz and 5-GHz bands. However, quasi-millimeter-wave-band systems are unsuitable for long-span transmission because the attenuation caused by rain is large. We propose that the symbol rate be lowered for rainfall; i.e., when it rains, a low symbol rate is used. This means narrowing the equivalent noise bandwidth so that a margin for rain attenuation is obtained. We compared a method in which the symbol rate is either high or low with one in which the symbol rate is selectable over a range of values. We verified the beneficial effect of the two-rate method through calculations and simulations. A case study in the Tokyo metropolitan area showed that the service zone radius of this method is double that of conventional systems. Changing to a low symbol rate decreases the transmission rate, but periods of heavy rainfall comprise only about 1% of the amount of time in a year, and so the average decrease in the transmission rate is approximately zero.

Secure distribution of digital goods is now a significantly important issue for protecting publishers' copyrights. In this paper, we study a useful primitive for constructing a secure and efficient digital rights management system (DRM) where a server which encrypts digital content and one which issues the corresponding decryption key works independently, and existing schemes lack this property. We first argue the desired property necessary of an encryption scheme for constructing an efficient DRM, and formally define an encryption scheme as split encryption scheme containing such property. Also, we show that an efficient split encryption scheme can be constructed from any identity-based scheme. More precisely, we show an equivalence result implying that a split encryption scheme for some system parameter setting and an identity-based encryption scheme have the same primitives but for different uses. Since currently there is no identity-based encryption scheme which is based on well-known computational assumption and/or provably secure in the standard model (i.e. without the random oracle model), by reasonably tuning the system parameter, we show another construction of split encryption which is secure against chosen ciphertext attacks in the standard model assuming that decision Diffie-Hellman problem is hard to solve.

In this paper, as an important technology for the software-defined radio, a novel scheme of adaptive array antenna utilizing bandpass sampling technique is proposed. For adaptive signal processing, it is necessary to convert the radio frequency signal received by the antenna that is given by real number into baseband region, i.e., complex number region. Then, the method for dividing the bandpass sampled signal to in-phase and quadrature components is analyzed. The sampling scheme is called the IQ-division bandpass sampling. An adaptive array antenna based on the IQ-division bandpass sampling is characterized by the signal processing at the bandpass sampled signal stage, namely, intermediate frequency stage, not baseband. Finally, we will confirm the validity of the proposed scheme through an experiment in a radio anechoic chamber.

This paper presents the approximate error rates of M-ary phase shift keying (MPSK) for optimum combining (OC) with multiple interferers in a flat Rayleigh fading channel. The approximations, which have been used to evaluate the performance of binary PSK for OC, are extended to the performance analysis of MPSK for OC in the presence of arbitrary numbers of antennas and interferers. The mean eigenvalues of interference-plus-noise covariance matrix are analyzed to compare the approximation techniques, i.e., first-order approximation and the orthongal approximation. Using the moment generating function (MGF)-based method, the approximate error rates of MPSK for OC are derived as the closed-form expressions in terms of the exact error rates of MPSK for MRC. The approximate analytical results show the simple and accurate way to assess the average symbol error rate of MPSK for OC with arbitrary numbers of antennas and interferers.

Many carriers are introducing multi-media services to satisfy customer demands for these services. In order to provide such services, carrier must increase their system capacity. It is well known that space division multiple access (SDMA) improves system capacity and is compatible with existing access systems. In order to evaluate the performance of SDMA, we developed an SDMA test bed. The test bed maintains the personal handy phone systems (PHS). The PHS adopts time division multiple access (TDMA). Aiming to compare the performance of SDMA and TDMA using the same analog hardware, the SDMA test bed employs a software-defined radio (SDR) technique. This paper shows the outline and performance of the test bed. The results of laboratory tests indicate that the bit error rate (BER) of the test bed operated in the SDMA mode at under 10-3 when the carrier-tointerference ratio (CIR) was larger than approximately -22 dB. Antenna patterns measured in an anechoic chamber show that the SDMA test bed produces correct antenna patterns when there are three desired signals and one interference signal. The results of the four field tests confirm that the test bed operated while two-multiplex SDMA mode doubled of the traffic and decreased the interference level as compared with the TDMA mode. Furthermore, the test bed operated while threemultiplex SDMA mode improves the traffic about 2.4 to 2.7 times. The SDMA test bed decreased the impact of the adjusted TDMA base station (BS). Therefore, we confirmed that the SDMA improves system capacity without any degradation.

In this letter, a concise formula for the SNR degradation of OFDM caused by carrier frequency offset is derived by approximations over a shadowed two-path channel, which explicitly shows the sensitivity of SNR degradation to various parameters including the frequency offset. It is shown that, for small frequency offset, the SNR degradation is proportional to the square of the frequency offset and the square of the number of subcarriers. It is also shown that, if Es/N0 is reasonably large, the SNR degradation becomes insensitive to Es/N0, which is contrary to the case of the AWGN channel.

The adaptive cross-spectral (ACS) technique recently introduced by Okuno et al. provides an attractive solution to acoustic echo cancellation (AEC) as it does not require double-talk (DT) detection. In this paper, we first introduce a generalized ACS (GACS) technique where a step-size parameter is used to control the magnitude of the incremental correction applied to the coefficient vector of the adaptive filter. Based on the study of the effects of the step-size on the GACS convergence behaviour, a new variable step-size ACS (VSS-ACS) algorithm is proposed, where the value of the step-size is commanded dynamically by a special finite state machine. Furthermore, the proposed algorithm has a new adaptation scheme to improve the initial convergence rate when the network connection is created. Experimental results show that the new VSS-ACS algorithm outperforms the original ACS in terms of a higher acoustic echo attenuation during DT periods and faster convergence rate.

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.

A simple non-destructive depth estimation method for a crack on a metal surface has been proposed. This method is based on our finding that the electromagnetic back scattering from a narrow trough (crack model) on the ground plane causes periodical nulls (dips) as the frequency changes, and the first dip occurs when the depth of the crack becomes nearly one half of the incident wavelength. Dependencies of the crack's aperture and the incident angle have also been studied from rigorous and numerical analyses, and considered as our depth estimation parameters. A simple estimation formula for a crack depth has been derived from these studies. Test measurement has been made to check the accuracy of our estimation formula. Time domain gating process is utilized for isolating the crack scattering spectra buried in the measured frequency RCS data. Tested crack types are a narrow rectangular, a tapered, and a stair approximated crack shapes. It is found that the depth of these cracks can be measured within 3 percent error by our estimation method.

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 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.

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.

We investigated the intercalation of water into BaMgAl10O17:Eu2+ (BAM), a blue phosphor that is used in plasma display panels. The adsorption and desorption characteristics of water with BAM have hysteresis; showing that water is intercalated into BAM. Using thermal analysis techniques, we suggested that water hydrated to barium ions caused oxidation. We found that the water intercalated into BAM played an important role in the oxidation of Eu2+ between 450 and 600, and contributed to a 10% degradation of luminance. In contrast, oxidation due to oxygen is a principal factor in degradation above 600 through baking process in air.

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.

In this paper, a simple adaptive notch filter (ANF) scheme for reducing RFI over CAP/QAM-based VDSL systems is proposed. To alleviate the spectral null caused by notch filtering, a null reshaping scheme is introduced between the normal ANF and the decision feedback equalizer (DFE). The proposed filter scheme can control the width and depth of the null. The shallow and narrow null obtained by null reshaping reduces the loss of signal components and consequently improves the mean square error (MSE) at the output of the equalizer. The proposed null reshaping scheme also enables the infinite impulse response (IIR) type constrained ANF to have a smaller pole contraction factor α. This results in a fast convergence property in RFI frequency estimation with a recursive prediction error (RPE) algorithm. The performance variations of the proposed null reshaping are investigated with varying filter parameters. Compared to the conventional ANF, simulation results show that, at the expense of small system complexity, the proposed structure yields a 2-3 dB MSE gain and a fast convergence property for RFI estimation.

In this paper, we focus on the problem of secure multicast in dynamic groups. In this problem, a group of users communicate using a shared group key. Due to the dynamic nature of these groups, to preserve secrecy, it is necessary to change the group key whenever the group membership changes. While the group key is being changed, the group communication needs to be interrupted until the rekeying is complete. This interruption is especially necessary if the rekeying is done because a user has left (or is removed). We split the rekeying cost into two parts: the cost of the critical path--where each user receives the new group key, and the cost of the non-critical path--where each user receives any other keys that it needs to obtain. We present a family of algorithms that show the tradeoff between the cost of the critical path and the cost of the non-critical path. Our solutions allow the group controller to choose the appropriate algorithm for key distribution by considering the requirements on critical and non-critical cost. In our solutions, the group controller can dynamically change the algorithm for key distribution to adapt to changing application requirements. Moreover, we argue that our solutions allow the group controller to effectively manage heterogeneous groups where users have different requirements/capabilities.