In block transmission systems, blind channel shortening methods are known to be effective to reduce the influence of interblock interference which degrades the performance when the length of a channel impulse response is extremely long. Conventional methods assume that the transmitted signal is uncorrelated; however, this assumption is invalid in practical systems such as OFDM with null carriers and MC-CDMA. In this paper, we consider blind channel shortening methods for block transmissions when the transmitted samples within a block are correlated. First, the channel shortening ability of a conventional method is clarified. Next, a new method which exploits the fact that the transmitted samples in different blocks are uncorrelated is introduced. It is shown that the proposed method can shorten the channel properly under certain conditions. Finally, simulation results of OFDM and MC-CDMA systems are shown to verify the effectiveness of the proposed method compared with a conventional one.

View full abstract

An essential condition for diversity reception is that the fading distributions between individual received signals of an antenna array are uncorrelated. In this paper, a new technique to improve the performance of transmission with the correlated Rayleigh-fading signals is proposed. In conventional array systems, individual receivers start sampling the received signals at the same time with the same sampling rate. On the other hand, in the proposed scheme, the received signals are again sampled with the same rate, however the sampling points are shifted in each receiver. Numerical results through computer simulation show that with correlated received signals, by applying the proposed technique the correlation can be reduced to a sufficient level for diversity reception.

View full abstract

Power-line communication (PLC) technique is one method to realize high-speed communications in a home network. In PLC channels, the transmission signal quality is degraded by colored non-Gaussian noise as well as frequency-selectivity of the channels. In this paper, we describe our investigation of the performance of a OQAM-MCT system in which a noise canceller is used jointly with a time-domain per-subcarrier adaptive equalizer. Furthermore, we propose a noise cancellation method designed for the OQAM-MCT system. The performance of the OQAM-MCT system is evaluated in PLC channels with measured impulse responses in the presence of measured noise. Computer simulation results show that the bit rate of the OQAM-MCT system is improved using both an adaptive equalizer and noise canceller, and that the OQAM-MCT system achieves better performance than an OFDM system with an insufficient length of the guard interval.

View full abstract

A procedure is developed to construct a time-limited pulse for its use in the short-range impulse radio communications. The even-numbered shifts of the pulse constitute a train of overlapping pulses. The pulses are intentionally made orthogonal to the second derivative of one another. This orthogonality makes it possible to detect the received pulses, which are assumed to be the second derivative of the transmitted pulses, by means of correlation with the original pulses. An example pulse is presented that complies with the FCC regulation for indoor ultra-wide bandwidth radio communications.

View full abstract

In this paper, we propose a new algorithm to detect the presence of narrow band interference signals on the band of an Ultra Wide-Band (UWB) system when the UWB spectrum overlaps the bands of other narrow band wireless services. In our proposed algorithm for an UWB Multi-Band Orthogonal Frequency Division Multiplexing (MB-OFDM) system, an appropriate model is selected from the assumed interference models based on the Akaike Information Criterion (AIC) which is an explicit theoretic criterion and a measure of fit of the model. The proposed algorithm does not need a priori information on the interference signals except that we can reduce a computational complexity to implement the algorithm if we have knowledge of the bands of the interference signals. Furthermore, we introduce the Expectation Maximization (EM) algorithm to our algorithm in order to estimate the transmitted signals and the interference signals simultaneously. The proposed algorithm may not require the pilot symbols in the assumed UWB system to detect the presence of other systems. By computer simulations, we show that the proposed algorithm validly detects the presence of interference signals on the UWB band.

View full abstract

This paper presents the analysis of in-band interference caused by pulse-based ultra-wideband (UWB) systems. The analysis contains both plain Impulse Radio UWB (IR-UWB) and Transmitted Reference UWB (TR-UWB) systems as a source of interference. The supposed victim is a narrowband BPSK system with a band-pass filter. The effect of pulse-based UWB systems is analyzed in terms of bit error rate. The analysis is given in terms of the specific combinations of pulse repetition frequency and center frequency of the narrowband bandpass filter. In those situations, the UWB interference cannot be modeled as a Gaussian noise. It also manifests situations in which the victim is under the severest or the slightest interference from TR-UWB. According to its result, the analysis is validated via simulation.

View full abstract

Exact bit error probabilities (BEP) are derived in closed-form for binary pulsed direct sequence (DS-) and hybrid direct sequence time hopping code division multiple access (DS/TH-CDMA) systems that have potential applications in ultra-wideband (UWB) communications. Flat Nakagami fading channel is considered and the characteristic function (CF) method is adopted. An exact expression of the CF is obtained through a straightforward method, which is simple and good for any arbitrary pulse shape. The CF is then used to obtain the exact BEP that requires less computational complexity than the method based on improved Gaussian approximation (IGA). It is shown under identical operating conditions that the shape of the CF, as well as, the BEP differs considerably for the two systems. While both the systems perform comparably in heavily faded channel, the hybrid system shows better BEP performance in lightly-faded channel. The CF and BEP also strongly depend on chip length and chip-duty that constitute the processing gain (PG). Different combinations of the parameters may result into the same PG and the BEP of a particular system for a constant PG, though remains nearly constant in a highly faded channel, may vary substantially in lightly-faded channel. A comparison of the results from the exact method with those from the standard Gaussian approximation (SGA) reveals that the SGA, though accurate for both the systems in highly-faded channel, becomes extremely optimistic for low-duty systems in lightly-faded channel. The SGA also fails to track several other system trade-offs.

View full abstract

Combining transmission of ultra wideband pulses, organized in blocks, with the inclusion of cyclic prefixing pulses yields a pulsewidth periodic signal at the receiver. Although unknown, this signal fits perfectly the diversity exploitive architecture of a RAKE receiver. Aiming to profit from this signal arrangement, we propose a pulse shape modulation system employing a RAKE receiver that estimates this periodic signal during a training interval and uses the estimated values for detection of data symbols. Our proposal relies on the invariability of the multipath propagation channel during the transmission of a UWB packet, the adequate application of the cyclic prefix, and the fact that different transmitted pulses result in different periodic signals at the receiver. This system is equivalent to transforming the multipath nature of the UWB propagation channel into a multichannel digital communications affected solely by additive noise. Our proposal is important because it ameliorates the performance of a pulse shape modulation RAKE receiver. On the other hand, the cost of our proposed system resides in the inefficiencies product of the cyclic prefix inclusion.

View full abstract

Ultra wideband (UWB) technologies are expected to be used in ultra-high-speed wireless personal area networks (WPAN) and wireless body area networks (WBAN). UWB human electromagnetic phantoms are useful for performance evaluation of antennas mounted in the vicinity of a human body and channel assessment when a human body blocks a propagation path. Publications on UWB phantoms, however, have been limited so far. This paper describes the development of liquid UWB phantom material (aqueous solution of sucrose) and UWB arm and torso phantoms. The UWB phantoms are not intended to evaluate a specific absorption rate (SAR) in a human body, because UWB devices are supposed to transmit at very low power and thus should pose no human hazard.

View full abstract

Delay profile of ultra-wideband impulse-radio (UWB-IR) indoor channel fluctuates for a physical change such as intruder. This paper investigates a human body detection using the UWB-IR in order to protect a house, not a room, because the radio with high range resolution can penetrate into the inner walls and also the reflected paths from human body are discriminated in time domain. The usefulness is experimentally investigated under a scenario which someone intrudes into a typical house with four rooms and walks around.

View full abstract

Ultra wideband (UWB) radar cross sections (RCSs) of several targets have been measured using various combinations of transmitting and receiving linear polarizations (V-V, H-H, and +45°--45°) with a view to obtaining information on the design of vehicular short-range radars. This paper reports the UWB RCSs (σ_LR and σ_LL) of a typical passenger automobile using two circular polarization combinations (L and R denote left and right circular polarizations). The wideband measurements were carried out with use of a vector network analyzer by sweeping the frequency from 24.5 to 28.8GHz in a radio anechoic chamber. The UWB RCSs were derived by integrating the received power in the frequency domain. Similar to the linear polarization results, fluctuations of the RCSs were smaller in the UWB than in narrowband for both L-R and L-L, because the ultra-wide bandwidth cancels out RCS plunges caused by narrowband interference among reflected waves from various facets of the target. The median of (σ_LR-σ_LL) was 2dB, while the median of (σ_HH-σ_{+45^°--45^°}) or (σ_VV-σ_{+45^°--45^°}) was 6dB. This is because the body of the automobile comprises a number of smaller scattering objects yielding σ_LL, either similar to the corner reflectors or asymmetrical to the radar boresight. Frequency-domain responses showed a number of notches caused by the interference between numerous reflecting waves having power levels of a similar order and different round-trip path lengths. Some representative reflective parts of the automobile were identified through analyses of time-domain responses.

View full abstract

In order to effectively improve the BER (Bit Error Rate) performance of noncoherent IR-UWB (Impulse Radio Ultra Wide Band) systems utilizing 2PPM (Binary Pulse Position Modulation), we propose a selective signal combining scheme which performs selective combination of received signals by estimating the SNR (Signal-to-Noise Ratio) of the energies during the pulse width interval.

View full abstract

In March, 2007, IEEE802.15.4a was standardized as a low-rate and low-power UWB system for sensor networks. In general, detection of the IEEE802.15.4a signal is considered to be difficult because of its low transmitting power density and low duty cycle. However, if detecting of the IEEE802.15.4a signal is available, it is possible to avoid interference issues both among the IEEE802.15.4a systems and between the 15.4a and other UWB systems. This letter proposes a simple detection method using non-coherent detectors. The possibility of detecting of the IEEE802.15.4a signal by proposal detection method was examined. By conducting experiments with an emulated 15.4a RF signal, the signal detection probability was examined, and 15.4a signal from the range of about 11 meters in the radius could be detected. From this observation, the CSMA/CA method with detecting the signal in 15.4a system may be applied for alternative access method for 15.4a systems.

View full abstract

Multi-Car Elevator (MCE) systems, which consist of several independent cars built in the same shaft, are being considered as the elevators of the next generation. In this paper, we present MceSim, a simulator of MCE systems. MceSim is an open source software available to the public, and it can be used as a common testbed to evaluate different control methods related to MCE systems. MceSim was used in the group controller performance competition: CST Solution Competition 2007. This experience has proven MceSim to be a fully functional testbed for MCE systems.

View full abstract

Recently, multi-car elevator (MCE) system has captured attention as an effective mean for the improvement of transportation capability in a high-rise building. The MCE has two or more cars in one shaft. In this paper, we propose an algorithm for group controllers of MCE system, and show the effectiveness of our algorithm through computer simulation.

View full abstract

In this paper, we study performance evaluation of workflow-based information systems. Because of state space explosion, analysis by stochastic models, such as stochastic Petri nets and queuing models, is not suitable for workflow systems in which a large number of flow instances run concurrently. We use fluid-flow approximation technique to overcome this difficulty. In the proposed method, GSPN (Generalized Stochastic Petri Nets) models representing workflows are approximated by a class of timed continuous Petri nets, called routing timed continuous Petri nets (RTCPN). In RTCPN models, each discrete set is approximated by a continuous region on a real-valued vector space, and variance in probability distribution is replaced with a real-valued interval. Next we derive piecewise linear systems from RTCPN models, and use interval methods to compute guaranteed enclosures for state variables. As a case study, we solve an optimal resource assignment problem for a paper review process.

View full abstract

This paper discusses an on-line Tasks Assignment and Routing Problem (TARP) for Autonomous Transportation Systems (ATSs) in manufacturing systems. The TARP is a constrained version of the Pickup and Delivery Problem with Time Windows (PDPTW). In our former study, a cooperative algorithm, called the triple loop method, with autonomous distributed agents has been proposed. The Improving initial Task Assignment and Avoiding Deadlock method (ITAAD) is a faster algorithm than the triple loop method. In this paper, we propose a new vehicle routing method for the ITAAD. Results of computational experiments show effectiveness of the proposed routing method.

View full abstract

In human-machine systems, a user gets abstracted information of a machine via an interface and operates it referring to a manual. If a manual has an erroneous description leading to automation surprises, the user may be lost in his/her operations so that he/she may make a serious human error. In this paper, we propose an algorithm for generating a manual by which automation surprises never occur. We model the machine and the interface as a discrete event system and a mapping from machine's state to a display of the interface, respectively. First, we represent a manual as a finite language and model behavior of the system operated by the user with the manual as a tree called an operational tree. Next, we characterize three automation surprises using the tree. Finally, we propose an algorithm for generating an operational tree by which the machine reaches a target state.

View full abstract

In real-time embedded systems, there is requirement for adapting both energy consumption and Quality of Services (QoS) of tasks according to their importance. This paper proposes an adaptive power-aware resource allocation method to resolve a trade-off between the energy consumption and QoS levels according to their importance with guaranteeing fairness. The proposed resource allocator consists of two components: the total resource optimizer to search for the optimal total resource and QoS-fairness-based allocator to allocate resource to tasks guaranteeing the fairness. These components adaptively achieve the optimal resource allocation formulated by a nonlinear optimization problem with the time complexity O(n) for the number of tasks n even if tasks' characteristics cannot be identified precisely. The simulation result shows that the rapidness of the convergence of the resource allocation to the optimal one is suitable for real-time systems with large number of tasks.

View full abstract

A method for the exact cost performance analysis of autonomous discrete-time piecewise affine systems is presented. Cost performance refers to the average trajectory cost over the entire region of attraction of the origin. The trajectory cost is based on the infinite-horizon cost. First, a reverse reachability algorithm which constructs the explicit piecewise quadratic trajectory cost function over the entire region of attraction of the origin is presented. Then, an explicit expression for the integral of a quadratic function over a simplex of arbitrary dimension is derived. Thus, the piecewise quadratic trajectory cost function can be integrated exactly and efficiently in order to determine the cost performance of the system as a whole. This alleviates the need to perform a large number of simulations.

View full abstract

A formal approach for specifying and reasoning about earth-friendly logistics management systems is presented. To reduce fossil fuel consumption and carbon dioxide emissions resulting from transport, we must enhance the transport efficiency of trucks, which play an essential role as carriers in modern logistics services. This paper addresses the milk-run approach. It is one of the most effective and popular solutions to this problem, but it makes it be complicated to implement in a logistics management system. We propose a language for specifying the routes of trucks and an order relation between the requirements of routes and the possible routes of trucks. The former is formulated as process calculus and the latter selects suitable trucks according to their routes.

View full abstract

We propose a new methodology of DOA (direction of arrival) estimation named SPIRE (Stepwise Phase dIfference REstoration) that is able to estimate sound source directions even if there is more than one source in a reverberant environment. DOA estimation in reverberant environments is difficult because the variance of the direction of an estimated sound source increases in reverberant environments. Therefore, we want the distance between microphones to be long. However, because of the spatial aliasing problem, the distance cannot be longer than half the wavelength of the maximum frequency of a source. DOA estimation performance of SPIRE is not limited by the spatial aliasing problem. The major feature of SPIRE is restoration of the phase difference of a microphone pair (M1) by using the phase difference of another microphone pair (M2) under the condition that the distance between the M1 microphones is longer than the distance between the M2 microphones. This restoration process enables the reduction of the variance of an estimated sound source direction and can alleviates the spatial aliasing problem that occurs with the M1 phase difference using direction estimation of the M2 microphones. The experimental results in a reverberant environment (reverberation time =about 300ms) indicate that even when there are multiple sources, the proposed method can estimate the source direction more accurately than conventional methods. In addition, DOA estimation performance of SPIRE with the array length 0.2m is shown to be almost equivalent to that of GCC-PHAT with the array length 0.5m. SPIRE can executes DOA estimation with a smaller microphone array than GCC-PHAT. From the viewpoint of the hardware size and coherence problem, the array length is required to be as small as possible. This feature of SPIRE is preferable.

View full abstract

The complexity of Finite Impulse Response (FIR) filters is mainly dominated by the number of adders (subtractors) used to implement the coefficient multipliers. It is well known that Common Subexpression Elimination (CSE) method based on Canonic Signed Digit (CSD) representation considerably reduces the number of adders in coefficient multipliers. Recently, a binary-based CSE (BSE) technique was proposed, which produced better reduction of adders compared to the CSD-based CSE. In this paper, we propose a new 4-bit binary representation-based CSE (BCSE-4) method which employs 4-bit Common Subexpressions (CSs) for implementing higher order low-power FIR filters. The proposed BCSE-4 offers better reduction of adders by eliminating the redundant 4-bit CSs that exist in the binary representation of filter coefficients. The reduction of adders is achieved with a small increase in critical path length of filter coefficient multipliers. Design examples show that our BCSE-4 gives an average power consumption reduction of 5.2% and 6.1% over the best known CSE method (BSE, NR-SCSE) respectively, when synthesized with TSMC-0.18µm technology. We show that our BCSE-4 offers an overall adder reduction of 6.5% compared to BSE without any increase in critical path length of filter coefficient multipliers.

View full abstract

In high-precision positioning systems, the limit cycles induced by friction effects result in a significant reduction in the positioning performance; particularly when the servo system utilizes a high gain controller. Accordingly, the current study presents a compensation scheme consisting of a dead-zone function and an integral term to limit the equivalent gain of unspecified controllers to the stable range. The proposed compensation scheme not only ensures that the feedback loop system remains stable, but also provides a simple and effective mechanism for preventing the users from inadvertently setting control gains which degrade the positioning performance of the system. The simulation results confirm the ability of the gain limit compensation scheme to suppress the effects of limit cycles and therefore demonstrate its feasibility for practical applications.

View full abstract

This paper proposes a novel hybrid NoC structure and a dynamic job distribution algorithm which can reduce system area and power consumption by reducing packet drop rate for various multimedia applications. The proposed NoC adopts different network structures between sub-clusters. Network structure is determined by profiling application program so that packet drop rate can be minimized. The proposed job distribution algorithm assigns every job to the sub-cluster where packet drop rate can be minimized for each multimedia application program. The proposed scheme targets multimedia applications frequently used in modern embedded systems, such as MPEG4 and MP3 decoders, GPS positioning systems, and OFDM demodulators. Experimental results show that packet drop rate was reduced by 31.6% on the average, when compared to complex network structure topologies consisting of sub-clusters of same topology. Chip area and power consumption were reduced by 16.0% and 34.0%, respectively.

View full abstract

To understand the structural and functional properties of large-scale complex networks, it is crucial to efficiently extract a set of cohesive subnetworks as communities. There have been proposed several such community extraction methods in the literature, including the classical k-core decomposition method and, more recently, the k-clique based community extraction method. The k-core method, although computationally efficient, is often not powerful enough for uncovering a detailed community structure and it produces only coarse-grained and loosely connected communities. The k-clique method, on the other hand, can extract fine-grained and tightly connected communities but requires a substantial amount of computational load for large-scale complex networks. In this paper, we present a new notion of a subnetwork called k-dense, and propose an efficient algorithm for extracting k-dense communities. We applied our method to the three different types of networks assembled from real data, namely, from blog trackbacks, word associations and Wikipedia references, and demonstrated that the k-dense method could extract communities almost as efficiently as the k-core method, while the qualities of the extracted communities are comparable to those obtained by the k-clique method.

View full abstract

At Indocrypt 2005, Viet et al., [21] have proposed an anonymous password-authenticated key exchange (PAKE) protocol and its threshold construction both of which are designed for client's password-based authentication and anonymity against a passive server, who does not deviate the protocol. In this paper, we first point out that their threshold construction is completely insecure against off-line dictionary attacks. For the threshold t > 1, we propose a secure threshold anonymous PAKE (for short, TAP) protocol with the number of clients n upper-bounded, such that $n\leq 2 \sqrt{N-1} -1$, where N is a dictionary size of passwords. We rigorously prove that the TAP protocol has semantic security of session keys in the random oracle model by showing the reduction to the computational Diffie-Hellman problem. In addition, the TAP protocol provides unconditional anonymity against a passive server. For the threshold t=1, we propose an efficient anonymous PAKE protocol that significantly improves efficiency in terms of computation costs and communication bandwidth compared to the original (not threshold) anonymous PAKE protocol [21].

View full abstract

For determining whether an input number is prime, there are two kinds of algorithms, a primality test and a primality proving. A primality test is very efficient but probabilistic, that is, there are certain errors in determining primality. On the other hand, a primality proving always gives a correct answer but it is not so efficient. Grantham proposed a very interesting problem on the Quadratic Frobenius Test (QFT) which is a primality test. If we negatively solve the problem, then we can construct a primality proving more efficient than any other existing primality proving. To solve Grantham's problem, it is important to study when QFT fails. In this paper, as the first step to solve Grantham's problem, we show two conditions on a given odd composite number n and parameters a, b of QFT such that n passes QFT for a, b. Based on these conditions, we made a computational experiment that may suggest the problem will be negatively solved. Moreover, the two conditions give two algorithms computing a pair (a, b) for which a given odd composite number n passes QFT, where n's prime factorization is known.

View full abstract

This paper presents a novel interference cancellation (IC) scheme for both synchronous and asynchronous direct-sequence code-division multiple-access (DS-CDMA) wireless channels. In the DS-CDMA system, the multiple access interference (MAI) and the near-far problem (NFP) are the two factors which reduce the capacity of the system. In this paper, we propose a new algorithm that is able to detect all interference signals as an individual MAI signal by maximum correlation detection. It is based on the discovery of all the unknowing spreading codes of the interference signals. Then, all possible MAI patterns so called replicas are generated as a summation of interference signals. And the true MAI pattern is found by taking correlation between the received signal and the replicas. Moreover, the receiver executes MAI cancellation in a successive manner, removing all interference signals by single-stage. Numerical results will show that the proposed IC strategy, which alleviates the detrimental effect of the MAI and the near-far problem, can significantly improve the system performance. Especially, we can obtain almost the same receiving characteristics as in the absense of interference for asynchrnous system when received powers are equal. Also, the same performances can be seen under any received power state for synchronous system.

View full abstract

This paper describes a vision-based and real-time system for detecting road signs from within a moving vehicle. The system architecture which is proposed in this paper consists of two parts, the learning and the detection part of road sign images. The proposed system has the standard architecture with adaboost algorithm. Adaboost is a popular algorithm which used to detect an object in real time. To improve the detection rate of adaboost algorithm, this paper proposes a new combination method of classifiers in every stage. In the case of detecting road signs in real environment, it can be ambiguous to decide to which class input images belong. To overcome this problem, we propose a method that applies fuzzy measure and fuzzy integral which use the importance and the evaluated values of classifiers within one stage. It is called fuzzy-boosting in this paper. Also, to improve the speed of a road sign detection algorithm using adaboost at the detection step, we propose a method which chooses several candidates by using MC generator. In this paper, as the sub-windows of chosen candidates pass classifiers which are made from fuzzy-boosting, we decide whether a road sign is detected or not. Using experiment result, we analyze and compare the detection speed and the classification error rate of the proposed algorithm applied to various environment and condition.

View full abstract

This paper presents a method of scalable lossless image compression by means of lossy coding. A progressive decoding capability and a full decoding for the lossless rendition are equipped with the losslessly encoded bit stream. Embedded coding is applied to large-amplitude coefficients in a wavelet transform domain. The other wavelet coefficients are encoded by a context-based entropy coding. The proposed method slightly outperforms JPEG-LS in lossless compression. Its rate-distortion performance with respect to progressive decoding is close to that of JPEG2000. The spatial scalability with respect to resolution is also available.

View full abstract

We consider a hybrid system controlled by a sampled-data controller whose action is periodically time-driven, that is, the control inputs can change only at the particular time instants. Then, we introduce transition systems as semantics of the controlled hybrid systems and consider a control specification given by a predicate. First, we derive a necessary and sufficient condition for the predicate to be control-invariant. Next, we show that there always exists the supremal control-invariant subpredicate for any predicate. Finally, we propose a procedure to compute it and obtain a sampled-data event controller which satisfies it.

View full abstract

In this paper, a recursive Gauss-Newton (RGN) algorithm is first developed for adaptive tracking of the amplitude, frequency and phase of a real sinusoid signal in additive white noise. The derived algorithm is then simplified for computational complexity reduction as well as improved with the use of multiple forgetting factor (MFF) technique to provide a flexible way of keeping track of the parameters with different rates. The effectiveness of the simplified MFF-RGN scheme in sinusoidal parameter tracking is demonstrated via computer simulations.

View full abstract

In this paper, we propose a method for selecting n-mode singular vectors in higher-order singular value decomposition. We select the minimum number of n-mode singular vectors, when the upper bound of a least-squares cost function is thresholded. The reduced n-ranks of all modes of a given tensor are determined automatically and the tensor is represented with the minimum number of dimensions. We apply the selection method to simultaneous low rank approximation of matrices. Experimental results show the effectiveness of the n-mode singular vector selection method.

View full abstract

In this letter, two OTAs with MOSFETs operating in the weak inversion region are proposed. One of the OTAs uses the exponential-logarithm transformation algorithm. Furthermore, the other realizes the high-linearity characteristics due to a small fluctuation of the common-terminal voltage of differential pair. The performance of the proposed OTAs was confirmed by HSPICE simulation.

View full abstract

In this letter we propose a robust detection algorithm for audio watermarking for copyright protection. The watermark is embedded in the time domain of an audio signal by the normally used spread spectrum technique. The scheme of detection is an improvement of the conventional correlation detector. A high-pass filter is applied along with the linear prediction error filter for whitening the audio signal and an adaptive threshold is chosen for decision comparing. Experimental results show that our detection algorithm outperforms the conventional one not only because it improves the robustness to normal attacks but also because it can provide the robustness to time-invariant pitch-scale modification.

View full abstract

A rate-6/4 full-diversity orthogonal space-time block code (STBC) is constructed for QPSK and 2 transmit antennas by applying constellation scaling and rotation to the set of quaternions used in Alamouti code. Also given is a rate-9/8 full-diversity quasi-orthogonal space-time block code (QOSTBC) for 4 transmit antennas. Lastly, a rate-10/8 code is presented for 4 transmit antennas. Simulation results indicate that these high-rate codes achieve better throughputs in the high signal-to-noise ratio region.

View full abstract

The Letter deals with constant false alarm rate (CFAR) detection of random Gaussian target signals embedded in Gaussian clutter with unknown covariance. The proposed detector is analyzed on the assumption that clutter covariance is not known and a random target signal has low-rank property. The low-dimensional subspace-based approach leads to a robust false alarm rate (RFAR) detector. The detection performance loss and the false alarm stability loss to unknown clutter covariance have been evaluated for example scenario.

View full abstract

This paper studies a dual-hop amplify-and-forward (AF) relaying systems over shadowed Nakagami-m fading channels and derives an approximate analytical expression for the outage probability. The numerical results show that the derived analytical expression can provide very well approximations to the simulation results.

View full abstract

In this letter, new families of binary low correlation zone (LCZ) sequences based on the interleaving technique and quadratic form sequences are constructed, which include the binary LCZ sequence set derived from Gordon-Mills-Welch (GMW) sequences. The constructed sequences have the property that, in a specified zone, the out-of-phase autocorrelation and cross-correlation values are all equal to -1. Due to this property, such sequences are suitable for quasi-synchronous code-division multiple access (QS-CDMA) systems.

View full abstract