Electroencephalography (EEG) and magnetoencephalography (MEG) measure the brain signal from spatially-distributed electrodes. In order to detect event-related synchronization and desynchronization (ERS/ERD), which are utilized for brain-computer/machine interfaces (BCI/BMI), spatial filtering techniques are often used. Common spatial potential (CSP) filtering and its extensions which are the spatial filtering methods have been widely used for BCIs. CSP transforms brain signals that have a spatial and temporal index into vectors via a covariance representation. However, the variance-covariance structure is essentially different from the vector space, and not all the information can be transformed into an element of the vector structure. Grassmannian embedding methods, therefore, have been proposed to utilize the variance-covariance structure of variational patterns. In this paper, we propose a metric learning method to classify the brain signal utilizing the covariance structure. We embed the brain signal in the extended Grassmann manifold, and classify it on the manifold using the proposed metric. Due to this embedding, the pattern structure is fully utilized for the classification. We conducted an experiment using an open benchmark dataset and found that the proposed method exhibited a better performance than CSP and its extensions.

Classification tasks in computer vision and brain-computer interface research have presented several applications such as biometrics and cognitive training. However, like in any other discipline, determining suitable representation of data has been challenging, and recent approaches have deviated from the familiar form of one vector for each data sample. This paper considers a kernel between vector sets, the mean polynomial kernel, motivated by recent studies where data are approximated by linear subspaces, in particular, methods that were formulated on Grassmann manifolds. This kernel takes a more general approach given that it can also support input data that can be modeled as a vector sequence, and not necessarily requiring it to be a linear subspace. We discuss how the kernel can be associated with the Projection kernel, a Grassmann kernel. Experimental results using face image sequences and physiological signal data show that the mean polynomial kernel surpasses existing subspace-based methods on Grassmann manifolds in terms of predictive performance and efficiency.

This paper deals with two types of capacity allocation schemes, i.e., static and adaptive, for uplink and downlink burst durations in the IEEE 802.16 BE (Best Effort) service. We study QoE (Quality of Experience) enhancement of audio-video IP transmission over the uplink channel with the two capacity allocation schemes. We introduce a piggyback request mechanism for uplink bandwidth requests from subscriber stations to the base station in addition to a random access-based request mechanism. We assess QoE of audio-video streams for four schemes obtained from the combination of the capacity allocation schemes and the bandwidth request mechanisms. We also employ two types of audio-video contents. From the assessment result, we notice that the adaptive allocation scheme is effective for QoE enhancement particularly under heavily loaded conditions because of its efficient usage of OFDM symbols. In addition, the piggyback request mechanism can enhance QoE of audio-video transmission. We also find that the effects of capacity allocation schemes and piggyback request mechanism on QoE change according to the content types.

We design M(≥3)-phase spreading sequences of Markov chains optimal in terms of bit error probabilities in asynchronous SSMA (spread spectrum multiple access) communication systems. To this end, we obtain the distributions of the normalized MAI (multiple access interference) for such systems and find a necessary and sufficient condition that the distributions become independent of the phase shifts.

Soft-decision decoding techniques are applied to asynchronous frequency-hop/spread-spectrum multiple-access (FH/SSMA) networks, where M-ary frequency shift keying (MFSK) is employed to transmit one modulated symbol per hop. Coding schemes using soft-decision decoded binary convolutional codes or turbo codes are considered, both with or without bit-interleaving. Performances of several soft metrics are examined for each coding scheme. It is shown that when multiple access interference is the main source of errors, the product metric offers the best performance among the soft metrics considered for all coding schemes. Furthermore, the application of soft-decision decoded convolutional codes or turbo codes without bit-interleaving is shown to allow for a much larger number of simultaneously transmitting users than hard-decision decoded Reed-Solomon codes. Finally, it is observed that when soft-decision decoding techniques are employed, synchronous networks attain better performance than asynchronous networks.

In this letter, we propose a limited feedback precoding scheme based upon grassmannian beamforming and user selection for downlink multiuser MIMO systems. Conventional random beamforming scheme only enjoys significant performance gains with a large number of users, which limits its practical application. With proper codebook size the proposed scheme outperforms conventional random beamforming scheme when the number of users is small or moderate.

We extend the sliding block code in symbolic dynamics to transform J (≥2) sequences of Markov chains with time delays. Under the assumption that the chains are irreducible and aperiodic, we prove the central limit theorem (CLT) for the normalized sums of extended sliding block codes from J sequences of Markov chains. We apply the theorem to the system analysis of asynchronous spread spectrum multiple access (SSMA) communication systems using spreading sequences of Markov chains. We find that the standard Gaussian approximation (SGA) for estimations of bit error probabilities in such systems is the 0-th order approximation of the evaluation based on the CLT. We also provide a simple theoretical evaluation of bit error probabilities in such systems, which agrees properly with the experimental results even for the systems with small number of users and low length of spreading sequences.

We study asynchronous SSMA communication systems using binary spreading sequences of Markov chains and prove the CLT (central limit theorem) for the empirical distribution of the normalized MAI (multiple-access interference). We also prove that the distribution of the normalized MAI for asynchronous systems can never be Gaussian if chains are irreducible and aperiodic. Based on these results, we propose novel theoretical evaluations of bit error probabilities in such systems based on the CLT and compare these and conventional theoretical estimations based on the SGA (standard Gaussian approximation) with experimental results. Consequently we confirm that the proposed theoretical evaluations based on the CLT agree with the experimental results better than the theoretical evaluations based on the SGA. Accordingly, using the theoretical evaluations based on the CLT, we give the optimum spreading sequences of Markov chains in terms of bit error probabilities.

In this paper, the CSK/SSMA ALOHA system with nonorthogonal sequences which combines the ALOHA system with Code Shift Keying (CSK) using nonorthogonal sequences is proposed. The throughput performance was evaluated by theoretical analysis. Moreover, the throughput performance of the system is compared with those of the DS/SSMA ALOHA and M-ary/SSMA ALOHA systems. It is found that the throughput performance of our system to be better than those of the other two systems.

In this paper, we propose a partial erasure decoding scheme with erasure-decision threshold for Reed-Solomon (RS) codes and analyze its performance in frequency-hopped multiple-access communications. RS code is used to correct erasures and errors caused by other-user interference. Binary FSK is employed to transmit the channel symbol. The proposed decoder decides whether to erase the received RS code symbol based on the ersure decsion threshold. The approximated formula for optimal erasure decision threshold is derived in such a way that packet error probability can be minimized. Numerical results show that the employment of adaptive erasure decision threshold attains the higher normalized throughput in the areas of high channel traffic cases.

In generating Frequency-Hopping (FH) sequences for Frequency Hopping Spread Spectrum Multiple Access (FH-SSMA) applications, binary maximal-length sequences (m-sequences) over GF(2m) have been preferred because of their characteristics of good Hamming correlation property, long period capability and high speed generation in association with simple hardware implementation based on Feedback Shift Registers (FSR). In practice, however, one difficulty of applying such sequences into the FH-SSMA communication systems with a wide bandwidth such as Military Satellite Communication (MilSatCom) is that the number of hopping frequency slots available may be far from a power of 2 in proportion to the spreading bandwidth. In that case, we can not make good use of the spreading bandwidth. In this paper, we propose a construction of some favorable FH sequences which deals effectively with the above difficulty using FSR and some nonlinear logic by introducing a re-mapping method. We show that the resulting sequences satisfy the (almost) uniform symbol distribution in one period and preserve a reasonably good Hamming correlation property so that they are appropriate for FH-SSMA applications.

The UCHT (Unified Complex Hadamard Transform) has been proposed as a new family of spreading sequences for DS-SSMA systems recently. In this Letter, the periodic autocorrelation (PAC) properties of the Unified Complex Hadamard Transform (UCHT) sequences are analyzed. Upper bounds for the out-of-phase PAC are derived for two groups of the UCHT sequences, namely the HSP-UCHT and the NHSP-UCHT sequences (the later is a more general representation of the well-known Walsh-Hadamard (WH) sequences). A comparison of the two bounds is performed. It turns out that the HSP-UCHT sequences have a lower upper bound for the out-of-phase PAC. This makes the HSP-UCHT sequences more effective than the WH sequences in combating multipath effect for DS-SSMA systems.

M-ary/SS systems are compared with DS/SS systems applied the multicarrier systems and the RAKE receiver in the presence of AWGN, frequency selective Rayleigh fading and partial-band interference. In particular, the BER performance and SSMA capability are evaluated. Consequently, the M-ary/SSMA system using the multicarrier techniques is subject to the M-ary/SSMA system with the RAKE receiver in the presence of partial-band interference. The BER performance of the M-ary/SSMA system is better than that of the DS/SSMA system when the number of users is smaller than 20. And the spectral efficiency of the multicarrier M-ary/SSMA system is best in the four systems when JSR=20 [dB] and BER=10-3.

This comment rectifies the auto-correlation function of the raised-cosine pulse shaping filter response derived in the above paper, giving its exact expression. We give, not only the exact solution for the auto-correlation taken at multiples of the chip period, Φ(rTc), but also for its entire domain, Φ(τ). Nevertheless, due to an approximation made in [1], the conclusions reached therein remain valid.

In this paper, a simple frame synchronization system for M-ary Spread Spectrum (M-ary/SS) communication system is analyzed. In particular, synchronization performance, bit error rate performance, and Spread Spectrum Multiple Access (SSMA) performance are analyzed. The frame synchronization system uses the racing counters. The transmitted signal contains framing chips that are added to spreading sequences. In the receiver, the framing chips are detected from several frames. The authors have proposed the simple frame synchronization system that detects framing chips from consecutive 2 frames. In this system, as the number of framing chips increases, synchronization performance improves and bit error rate performance degrades. In this paper a frame synchronization system that improves bit error rate performance is treated and analyzed. As the rusult, when the number of reference frames is 3, the bit error rate is much improved than the conventional system.

In this paper we discuss the binary spreading sequences whose spectral distributions are DC free and spectral distribution's shapes can be easily controlled by a certain parameter denoted by δ. The newly developed sequences, referred to as modified antisymmetric M-sequences, are modified-versions of the conventional antisymmetric (AS)M-sequences. The proposed sequences are designed to increase the varieties of spectral distribution's shapes and improve the correlation properties when compared to those of the FM coded M-sequences which have already proposed by Tsuzuki et al. Some typical line coded M-sequences, i.e. the (differential) Manchester coded M-sequences and the FM coded M-sequences, and the conventional AS M-sequences are included in the set of proposed sequences. The improvement of the average BER (bit error rate) performance for asynchronous DS/SSMA (direct sequence/spread spectrum multiple access) systems using the proposed sequences in comparison to the system using the conventional AO/LSE (auto-optimal phase with least sidelobe energy) M-sequences is also shown.

The performance of a noncoherent parallel matched-filter (MF) acquisition scheme with a reference filter (RF) is evaluated for a direct-sequence/spread-spectrum multiple access (DS/SSMA) packet radio system in a mobile cellular environment. This acquisition scheme employs a RF to estimate the variance of interference at the output of detecting MF. Acquisition-based packet throughput of the parallel NM-RF scheme is derived for an AWGN and a Rayleigh fading channels. Packet throughput of a parallel MF-RF acquisition scheme is compared with those of a serial MF scheme, a serial MF-RF scheme, and a parallel MF. From the numerical results, it is shown that the packet throughput decreases with the number of users in the system, and increases with the preamble length. Imperfect power control causes packet throughput to decrease especially when the power control error is large. The considerations in this paper can be applied to the reverse link (mobile-to-base station) design of a DS/SSMA system for packet-type services.

The performance of an M-ary spread-spectrum multiple-access (M-ary/SSMA) scheme in the presence of carrier frequency offset is discussed in this paper. The influence of carrier frequency offset on the non-coherent reception of M-ary/SSMA signals is examined and it is shown that the carrier frequency offset degrades the performance remarkably, yet. this influence has a distinctive property. Making use of this property, we propose a new M-ary/SSMA scheme that can mitigate the influence of the carrier frequency offset. The scheme is based on the assignment of two distinctive Hadamard codes to in-phase and quadrature components of the transmitted signal. The effect of simultaneous transmission is evaluated in terms of bit-error-rate performance with the carrier frequency offset. As the result, it is observed that the satisfactory bit-error-rate performance can be achieved in the presence of carrier frequendy offset.

A new matched-filter (MF) acquisition scheme with adaptive threshold is proposed for a frequency-hopped/spread-spectrum multiple-access (FH/SSMA) system. Detection and false alarm probabilities are derived for combined interference environments. The combined interference consists of partialband noise jamming or tone jamming, multiple access interference (MAI), multipath interference, and thermal noise. We use Gaussian approximation for modeling the MAI and multipath interference. Equal power assumption of the users is employed which is typically used in the SSMA system analysis. In the proposed scheme, MF output is compared to an adaptive threshold determined by the number of jammed frequency slots. It is shown that the proposed adaptive-threshold acquisition scheme achieves higher detection probability and lower false alarm probability than a conventional fixed-threshold scheme for each jammed fractional bandwidth, JSR, the number of multipaths, and the number of users. It is also shown that adaptive threshold achieves faster acquisition and higher packet throughput than fixed threshold in application to FH/SSMA packet radio system.

This paper proposes M-ary/SSMA using co-channel interference cancellation techniques and presents comparisons with conventional DS/SSMA and other systems. First, ideal models of DS/SSMA and M-ary/SSMA using co-channel interference cancellation techniques are analyzed. In the cancellation circuit of DS/SSMA, when an error bit of other user's data arises, the received signal is degraded by "voltage addition" of the error sequence. While, in M-ary/SSMA, it is degraded by only "power addition" of the error code. Therefore, though the circuits are complicated, bit error rate of the proposed system can be improved considerably. Further, improvement of spectral efficiency in these systems are shown for several bit error rate and chip waveforms.