The direct optical switching CDMA radio-on-fiber network is proposed as multiplexing method for radio base stations in microcell/picocell technologies. In this system, aliasing distortions degrade the received signal quality and decreases the number of connectable radio base stations (RBSs) when the encoding rate becomes lower than the twice of bandwidth of RF signal. This paper proposes the optical switching speed reduction method and clarifies that the chaotic spreading sequences can suppress the aliasing distortion without additional processing at the receiver even if the encoding rate becomes lower than the RF signal bandwidth. The effect in switching speed reduction is theoretically investigated and the effect in aliasing distortions suppression is experimentally investigated by using the proposed method.

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. The present paper shows that such a construction generates a binary zcz sequence set by using a primitive linear recursion over GF(2), the finite field of integers modulo 2.

To secure the interactive multimedia applications in WLANs (wireless local area networks), it is pertinent to implement a number of security services such as authentication, key exchange and real-time encryption/decryption. The implementation of those security services in WLANs presents a complex and challenging environment because these services may deplete the limited network resources and increases the burden of supporting the quality of service for multimedia applications. As an alternative solution, we thus introduce a new security system, which is based on RCNC (Random Connection Node Convolutional) code and M-sequence. The architecture of RCNC code formed by developing the conventional convolutional code structure has an excellent security operation as well as an error correction function. To verify the performance of our proposed system, the computer simulations have been performed in IEEE 802.11b environment.

This paper investigates multiple-valued code-division multiple access (MV-CDMA) techniques and circuits for intra/inter-chip communication to achieve efficient data transmission in VLSI systems. To address the problems caused by interconnection complexity, we transmit multiplexed signals inside LSI systems employing pseudo-random orthogonal m-sequences as information carriers. A new class of multiple-valued CDMA techniques for intra-chip communication is discussed to demonstrate the feasibility of eliminating co-channel interference caused by a propagation delay of signals, e.g., clock skew. This paper describes the circuit configuration and performance evaluation of MV-CDMA systems for intra-chip communication. We first explain the principle of MV-CDMA technique, and then propose a bidirectional current-mode CMOS technique to realize compact correlation circuits for CDMA. Finally, we show the Spice and MATLAB simulation results of MV-CDMA systems, which indicate the excellent capabilities of eliminating co-channel interference.

An optical spectral coding scheme is devised for fiber-optic code-division multiple-access (FO-CDMA) networks. The spectral coding is based on the pseudo-orthogonality of FO-CDMA codes properly written in the fiber Bragg grating (FBG) devices. For an incoming broadband optical signal having spectral components equal to the designed Bragg wavelengths of the FBG, the spectral components will be reflected and spectrally coded with the written FO-CDMA address codes. Each spectral chip has different central wavelength and is distributed over the spectrum of the incoming light source. Maximal-length sequence codes (m-sequence codes) are chosen as the signature or address codes to exemplify the coding and correlation processes in the FO-CDMA system. By assigning the N cycle shifts of a single m-sequence code to N users, we get an FO-CDMA network that can theoretically support N simultaneous users. To overcome the limiting factor of multiple-access interference (MAI) on the performance of the FO-CDMA network, an FBG decoder is configured on the basis of orthogonal correlation functions of the adopted pseudo-orthogonal codes. An intended receiver user that operates on the defined orthogonal correlation functions will reject any interfering user and obtain quasi-orthogonality between the FO-CDMA users in the network. Practical limiting issues on networking performance, such as non-flattened source spectra, optical path delay, and asynchronous data accesses, are evaluated in terms of the bit-error-rate versus the number of active users. As expected, the bit-error-rate will increase with the number of active users. Increasing the flatness parameter of optical signal will lead to a lower average error probability, since we are working in a part of the more flattened optical spectrum. In contrast, reducing the encoded bandwidth will reduce the total received power, and this will necessitate higher resolution of fiber Bragg gratings.

This paper proposes applications of a code-division multiplexing technique to VLSI systems free from interconnection problems. We employ a pseudo-random orthogonal m-sequence carrier as a multiplexable information carrier to achieve efficient data transmission. Using orthogonal property of m-sequences, we can multiplex several computational activities into a single circuit, and execute in parallel using multiplexed data transmission with reduced interconnection. Also, randomness of m-sequences offers the high tolerance to interference (jamming), and suppression of dynamic range of signals while maintaining a sufficient signal-to-noise ratio (SNR). We demonstrate application examples of multiplex computing circuits, neural networks, and spread-spectrum image processing to show the advantages.

The maximum order complexity (MOC) of a sequence is a very natural generalization of the well-known linear complexity (LC) by allowing nonlinear feedback functions for the feedback shift register which generates a given sequence. It is expected that MOC is effective to reduce such an instability of LC as an extreme increase caused by the minimum changes of a periodic sequence, i. e. , one-symbol substitution, one-symbol insertion or one-symbol deletion per each period. In this paper we will give the bounds (lower and upper bounds) of MOC for the minimum changes of an m-sequence over GF(q) with period qn-1, which shows that MOC is much more natural than LC as a measure for the randomness of sequences in this case.

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.

This paper presents a new method to derive the phase difference between n-tuples of an m-sequence over GF(p) of period pn-1. For the binary m-sequence of the characteristic polynomial f(x)=xn+xd+1 with d=1,2c or n-2c, the explicit formulas of the phase difference from the initial n-tuple are efficiently derived by our method for specific n-tuples such as that consisting of all 1's and that cosisting of one 1 and n-1 0's, although the previously known formula exists only for that consisting of all 1's.

The value distribution of the partial autocorrelation of periodic sequences is important for the evaluation of the sequence performances when sequences of long period are used. But it is difficult to find the exact value distribution of the autocorrelation in general. Therefore we derived some properties of the partial autocorrelation for binary m-sequences which may be used to find the exact value distribution.

In this paper, a construction of de Bruijn sequences using maximum length linear sequences is considered. The construction is based on the well-known cross-join (CJ) method: Maximum length linear sequences are used to produce de Bruijn sequences by the CJ process. Properties of the CJ paris in the maximum length linear sequences are investigated. It is conjectured that the number of CJ pairs in a maximum length linear sequence is given by (22n-3+1)/3-2n-2, where n2 is the length of the linear feedback shift register with the sequence. The CJ paris for some special cases are obtained. An algorithm for finding CJ pairs is described and a method of implementation is discussed briefly.

Recently, the small set of nonbinary Kasami sequences was presented and their correlation properties were clarified by Liu and Komo. The family of nonbinary Kasami sequences has the same periodic maximum nontrivial correlation as the family of Kumar-Moreno sequences, but smaller family size. In this paper, first it is shown that each of the nonbinary Kasami sequences is unbalanced. Secondly, a new family of nonbinary sequences obtained from modified Kasami sequences is proposed, and it is shown that the new family has the same maximum nontrivial correlation as the family of nonbinary Kasami sequences and consists of the balanced nonbinary sequences.