JOURNAL OF TELECOMMUNICATIONS, VOLUME 22, ISSUE 1, OCTOBER 2013 1

Performances of Code-Diversity with a Novel Spreading Sequence in DS/CDMA Communication Systems

Shinichi Tachikawa and Hayato Noguchi
AbstractThis paper proposes a novel spreading sequence for code-diversity in direct sequence/ code division multiple access (DS/CDMA) communication systems. In code-diversity, a composite sequence which is a sum of several branch sequences is adopted. By the proposed sequences, both the composite sequence and the branch sequences can be constructed from digital signal. Therefore, the hardware of the system can be simplified. By evaluations of computer simulations, bit error rate (BER) performance of the system to suppress multiple access interference (MAI) has a little degradation compared with that of the system using a conventional analog composite sequence. However, it can be obtained almost same BER performance of the system using a previous digital composite sequence by analog branch sequences. Further, to improve the BER performances and simplfy its hardware, modified code-diversity system with the proposed sequence is shown. Index TermsDS/CDMA; code-diversity; digital composite sequence; digital branch sequence; multiple access interference

1 INTRODUCTION

n recent years, a direct sequence / code division multiple access (DS/CDMA) communication system has been studied. In a DS/CDMA system, many users communicate simultaneously on a common channel using unique spreading codes which is pseudo noise (PN) sequences, therefore the received signal usually consists of desired signal, multiple access interference (MAI), and Gaussian noise. Ordinarily, influence of multiple access interference on communication quality is small, the receiver properly detects the desired signal. However, in many multiple access users, and near-far problem, that is, the undesired signal power is much larger than the desired signal power, the communication quality is deteriorated considerably [1][2]. To solve this problem, various systems (the MAI cancellation technique [1], the receiver using Code- Orthogonalizing Filter (COF) [3][4], the receiver using partial correlation weight control [5], etc.) have been discussed in the past. One of these systems is a code-diversity system [6][7]. The code-diversity system does not have to know all PN sequences of communicating users at the receiver. The code-diversity system uses a sum of several PN sequence as the spreading code at the transmitter. At the code-diversity receiver, the received signal is correlated each PN sequence used at the transmitter and these correlation outputs are combined. Then, the desired signal is

detected. Moreover, a constant amplitude code-diversity system which is advanced a conventional code-diversity system is presented [8][9]. However, in these codediversity systems, an analog sequence as a composite sequence is adopted [6][7], or analog sequences as branch sequences are applied [8][9]. Therefore hardware of these systems becomes complicated. In this paper, we propose a novel digital spreading sequence which is composed of several digital branch sequences for code-diversity. As both the composite sequence and the branch sequences are given by digital signals, hardware of the system can be simplified. First, in Sect. 2, the construction of code-diversity is described, and the difference between the previous and the proposed spreading sequences are explained. In Sect. 3, we present the construction methods of the proposed spreading sequences and these merits of the hardware using the sequences. Further, modified code-diversity system with the proposed sequence is shown. In Sect. 4, by computer simulations, the bit error rate (BER) performances of proposed system are shown and discussed, in comparison with the previous code-diversity systems. Finally, in Sect. 5, these results are concluded.

2 CODE-DIVERSITY SYSTEM IN DS/CDMA

2.1 System model of code-diversity Fig. 1 shows a system model of original code-diversity [6][7]. A transmitter employs a composite sequence which is a sum of M branch PN sequences (PN1, PN2, , PNM in the Fig. 1, M is the number of code-diversity branches), and it spreads data signal which value is +1 or -1, and the time duration is T. The sequence construction methods are described later. After the transmitter, it is assumed multiple access interference (MAI) and an additive white

S. Tachikawa is with the Nagaoka National College of Technology, Nagaoka, Niigata, 940-2188, Japan. H. Noguchi was with the Nagaoka National College of Technology, Nagaoka, Niigata, 940-2188, Japan. This paper is based on A Novel Spreading Sequence and its Performances for Code-Diversity in DS/CDMA Communication Systems, by Hayato Noguchi and Shinichi Tachikawa, which appeard by the Proceedings of 2012 International Symposium on Information Theory and its Applications (ISITA2012), Honolulu, Hawaii, USA, pp.347-351, Oct. 2012.

Gaussian noise (AWGN) are added in a channel. In a receiver, assumed complete synchronization, the received signal is correlated with the each branch PN sequence which is used at the transmitter in each codediversity branch. Next, these correlation outputs are combined after multiplied with each appropriate weight coefficient gi (i=1, 2, , M). Then, output data can be obtained by the threshold circuit of level 0.

large degradation of received signal arises in employing an amplitude limiter.

Digital value a Seq.1 + -a a Seq.2 -a + a Seq.3 -a

Analog value x y -y -x Spreading sequence

= (Sum of 3 sequences)

PN1

Fig.2 Digital-analog sequence (DAS).

Data
T

Analog value Seq.1

PN2

!"

+
Seq.2 Seq.3

Digital value 1 -1 Spreading sequence

= (Sum of 3 sequences ! PN sequence)

PNM

Tramsmitter Fig.3 Analog-digital sequence (ADS).

!
g1

PN1

!"
Output data g2

PN2

Digital value a Seq.1 -b + a Seq.2 + -b a Seq.3 -b

Digital value 1 -1 Spreading sequence

= (Sum of 3 sequences ! PN sequence)

!
gM
Receiver

Fig.4 Digital-digital sequence (DDS).

PNM

Fig.1 System model of original code-diversity.

2.2 Branch Sequences and Composite Sequence

2.2.1 DigitalAnalog Sequence (DAS) Fig. 2 shows an example of digital-analog sequence (DAS) as a conventional composite sequence [6][7]. For these branch sequences, orthogonal Gold sequences are employed. The crosscorrelation values between branch sequences must be zero because no degradation arises after the correlator with each branch sequence. The values of these branch sequences are digital (+a, -a), and the values of composite spreading sequence by adding branch sequences become analog (+x, +y, -y, -x in sum of 3 sequences). These values (a, x, y) are normalized to the total signal power 1. Applying this DAS, output of transmitter becomes analog value, and the final amplifier circuit must be designed in large power capacity. Further, in the receiver,

2.2.2 Analog-Digital Sequence (ADS) Fig. 3 shows an example of analog-digital sequence (ADS) as a constant amplitude composite sequence [8][9]. These branch sequences are composed of several orthogonal cyclic shifted M-sequence. Then, the amplitude values of branch sequences become analog. The set of orthogonal cyclic shifted M-sequences is composed cyclic shifted Msequences and added an orthogonalizing complement number ! = 1 L + 1 L to each chip of M-sequence, where L is the code length, and means either + or - only takes [8][10]. This set of sequences is given as following matrix, & a1 a 2 ! a L # $ ! (1) $ a L a1 ! a L '1 ! . Orth M = $ " " # " ! $ $a a ! a ! ! 3 1 " % 2

A sum of each column of this matrix is the same value (" 1 + L! ). A row sequence of (1) is called an elemental sequence. By adopting all elemental sequences to make branch sequences, the addition of branch sequences, i.e., all elemental sequences, is the same amplitude value. To distinguish the own user, the conventional own PN se-

quence is multiplied. The amplitude value is normalized to the total signal power 1. So that, the values of composite spreading sequence becomes digital (+1, -1) and it is as same as a conventional PN sequence of DS / spread spectrum (SS) at the transmitter. Examinations of branch sequence construction methods are discussed in the reference [8], however, in this paper, a simple method that each branch sequence is assigned the almost same number of elemental sequence is employed. Applying this ADS, output of the transmitter becomes digital value, however, the correlators in the receiver must be multiplied with analog branch sequence or many elemental sequences of orthogonal cyclic shifted Msequence matrix. Then the hardware of receiver becomes complicated. 2.2.3 DigitalDigtal Sequence (DDS) (Proposed Sequence) Fig. 4 shows an example of proposed novel digital-digital sequence (DDS). Amplitude value of these branch sequences is composed of digital two values (a, -b), and amplitude value of the composite spreading sequence is also composed of digital values (+1, -1). These branch sequences are constructed from concatenations of short code length orthogonal cyclic shifted M-sequences or other appropriate sequences. Precise and concrete construction methods of branch sequences are described in the next Sect. 3. In a similar matter to ADS, by adding all branch sequences, the same amplitude value can be obtained. Then, to distinguish the own user, the conventional own PN sequence is multiplied. The amplitude value is normalized to the total signal power 1. Applying this DDS, only multiplication by digital signal is necessary in each correlator, the hardware becomes simple.

quence length, i.e., the correlated desired signal level. In addition, denominator of (2) is shown as following expression,

E[ I i ] + E[ N i ] = E[(Si + I i + N i ) 2 ] ! E[Si ]

(3)

where Si is the desired signal component. Thus, if the desired signal component of received signal is already known, the interference plus AWGN component can be calculated and the weight coefficient can be decided by the component.

3 CONSTRUCTION METHODS OF PROPOSED SEQUENCES (DDS)

In this section, the construction methods of proposed sequences (DDS), their merits of hardware and the modified system are presented.

3.1 Method A (M-Sequence Method) This method employs short code length orthogonal cyclic shifted M-sequence given (1). For example, short code length Ls employs 3, and required code length L employs 30.
3.1.1 Producing of Branch Sequence Component The M-sequence of Ls=3 is (-1, -1, 1). ! = 1 Ls + 1 L s = +1 or (1/3). Then, (0, 0, 2) or (-4/3, -4/3, 2/3) can be obtained. Here, the later sequence (-4/3, -4/3, 2/3) is selected because of avoiding 0. The orthogonal M-sequence matrix is given as & a1 a 2 a 3 # & ' 4 / 3 ' 4 / 3 2 / 3 # $ ! $ !. (4) $ a 3 a1 a 2 ! = $ 2 / 3 ' 4 / 3 ' 4 / 3 ! $ a a a ! $ ' 4 / 3 2 / 3 ' 4 / 3! 3 1" % 2 % " A sum of each column of this matrix is the same value 2. To normalize to total signal value 1, -1/2 is multiplied. Therefore, the following matrix called component matrix can be obtained, & a1 a 2 a 3 # & 2 / 3 2 / 3 ' 1 / 3 # $ ! $ !. (5) $ a 3 a1 a 2 ! = $ ' 1 / 3 2 / 3 2 / 3 ! $ a a a ! $ 2 / 3 ' 1/ 3 2 / 3 ! 3 1" % 2 % " The component of branch sequence is assigned from each row sequence, (a1, a2, a3), (a3, a1, a2), or (a2, a3, a1).

2.3 Weight Coefficient gi for Each Branch The weight coefficient gi (i=1, 2, , M) is controlled based on a correlation value with multiple access interference (MAI) in each branch. Assuming an approximation of maximal ratio combining of diversity, the magnitude of influence component, i.e., variance of interference components plus variance of AWGN of each branch is estimated. Then, the weight coefficient of branch which has large magnitude of influence component is assigned small value, and the weight coefficient of branch which has small magnitude of influence component is assigned large value. As variance of AWGN is the same value in the each branch, the diversity weight is almost controlled based on the interference component. This diversity weight is calculated as

gi =

!
E[ I ] + E[ N i2 ]
2 i

i = 1,2,!, M

(2)

3.1.2 Producing of Branch Sequences To obtain branch sequence for required long code length L, the component matrix in which the row sequences are exchanged each other is arranged to concatenate. When L=30 and Ls=3, the number of the concatenated matrix is L/Ls=10. Each row sequence is adopted the branch sequence of DDS, Seq. 1, Seq. 2, or Seq. 3. Table 1 shows the branch sequences of DDS. Chip number 1, 2, 3 is the above component matrix, and chip number 4, 5, 6 is the component matrix exchanged row sequences. It is 10 component matrix are concatenated. These branch sequences are orthogonal each other. 3.1.3 Producing of Composite Sequence In Table 1, a sum of each column is the same value 1. To spread spectrum and distinguish the own user, the

where I i is interference component of branch i, N i is AWGN of branch i. E[] is defined as the average value of variable , and ! is the received signal level " PN se-

conventional own PN sequence is multiplied. Then the composite sequence of DDS is the same as a conventional PN sequence. Fig. 5 shows a system model of DDS code diversity system. The transmitter is the same as a conventional DS/SS transmitter. However, in the receiver, the demodulated data can be obtained by using Ms correlators with different digital sequence. In this method A, the number of branches is Ls, and the code length L of PN sequence must be a multiple of Ls. Ls is 2n-1 (n=1, 2, ), then , only 3, 7, 15, . The number of + elements is (Ls+1)/2, and the number of - elements is (Ls-1)/2. The balance of +- elements in the branch sequence is almost kept. Further it is possible to chip-interleave together for all branch sequences. The orthogonality of sequences can be kept.
Table 1 Branch sequences of DDS.

2 / Ls 2 / Ls & $ $ ' ( Ls ' 2) / Ls 2 / Ls $ " " $ $ 2 / Ls 2 / Ls %

! !

' ( Ls ' 2) / Ls # ! (6) 2 / Ls ! ! # " " ! ! ! ' ( Ls ' 2) / Ls 2 / Ls " 2 / Ls

2 / Ls

Chip number Seq. 1 Seq. 2 Seq. 3 Sum

1 a1 a3 a2 1

2 a2 a1 a3 1

3 a3 a2 a1 1

4 a3 a2 a1 1

5 a1 a3 a2 1

6 a2 a1 a3 1

L a1 a3 a2 1

where Ls means short code length, which is the number of branches. Ls can take 2, 3, 4, , all integer number larger than 1. The sum of each column of this matrix is the same value 1. The crosscorrelation of row sequences are 0, each other, i.e., they are orthogonal relation. When Ls=3, (6) is equal to (4) of the Method A, accidentally. The methods of producing of branch sequences and component sequence of DDS are similar to the method A. In this method B, Ls can take all integers except 1, then, the number of branches can be designed properly for a utilized channel. However, the number of + elements is Ls-1, the number of - elements is 1. The balance of +- elements in the branch sequence is collapsed and the property of random declines. It is possible to chip-interleave together for all branch sequences in similar to the method A.

Transmitter Input data PN seq. (digital)

Channel MAI, AWGN

3.3 Merits of Hardware Using DDS As shown in Fig. 5, a simple conventional DS/SS transmitter can employ. In the receiver, multiplication circuits by digital signal are adopted at the correlators. As high speed clock is worked at the correlators, hardware of analog multiplication circuit is difficult. However, hardware of digital multiplication circuit can be constructed easily by high speed analog switch devices. While, multiplication circuits by analog weight coefficients are needed. However, these circuits are worked more slowly than the correlators. Conventional analog gain control circuits can be employed. Therefore, by simple modification of receiver, the proposed code diversity system can be realized easily. 3.4 Modified Code-Diversity System with DDS To improve the BER performances and simplfy its hardware of code-diversity system with DDS, modified codediversity system with DDS is discussed. First, the number of branches is increased. Second, each gi is calculated by the similar manner. Next, when each gi is small compared with other gi, e.g., the average value E [gi] of gi, the value decides 0. Coversely, when each gi is large, the value decides 1. About half of code-diversity branches gi becomes 1, and the others are neglected. By selecting from many DDS and digital value (0 or 1) of gi, performances of modified code-diversity system with DDS can be improved and its hardware of multiplication can be simplified.

!
g1

Seq.1(digital)

!
Output data g2

Seq.2(digital)
T

PN

!
Receiver gM

Seq.M(digital)

Fig.5 System model of DDS code-diversity.

3.2 Method B (One-Chip Reverse Sequence Method) This method employs one-chip reverse sequence given as the following component matrix,

4 SIMULATIONS AND DISCUSSIONS

4.1 Performance Evaluation of Code-Diversity Systems In this section, the proposed system is evaluated on bit error rate (BER) performance by computer simulations.

Table 2 shows a specification of simulations for DDS code diversity system. Modulation is a binary PSK direct sequence / spread spectrum (DS/SS) system. The own PN sequence at the transmitter is a modified M-sequence, that is, the original M-sequence of code length 31 is made by a primitive polynomial x5+x2+1=0 with initial value -1, -1, -1, -1, -1 and the modified M-sequence is made by removing -1 of the first chip from the original M-sequence. Then the code length L of modified M-sequence is 30. The construction method of composite sequence is adopted method A, which employs short code length orthogonal cyclic shifted M-sequence. The component matrix is (3"3) and the number of concatenations is 10, then, the code length is 30, which is equal to the code length of modified M-sequence. The number of branches M for code-diversity becomes 3. In the channel, MAI sequence from another user (the number of K is 2) is added in signal to interference ratio (SIR)=-10[dB]. The sequence is made by a primitive polynomial x5+x4+x2+x+1=0 with initial value -1, -1, -1, -1, -1 and removing -1 of the first chip similar to the own sequence. Further, AWGN with double sided power density spectrum No/2[W/Hz] is added in signal bit energy (Eb) to noise ratio (Eb/No) from 0 to 10[dB]. At the receiver, the received timing of data is assumed asynchronous, i.e., the delay (sequence phase) is unique random from 0 to L, and receiving time of chip is assumed synchronous because the performance of chip asynchronous system can be approximated interpolation of chip synchronous system and the chip synchronous system can be simplified in computer simulations. The weight coefficients for code-diversity branches are calculated by enough training bits for convergence (about 1"105 [bits]).
Table 2 Specification of simulations for DDS code-diversity system.

worst phase (i.e., the largest BER phase), BER of the proposed CD-DDS is improved because of effects by codediversity. In the average of BER for every phase, BER of the proposed CD-DDS is superior to that of the conventional Non-CD. Improvement of large BER is important to the average BER performance.
1.00E+00 1.0E-0 1.00E-01 1.0E-1 1.00E-02 1.0E-2
BER BER

1.00E-03 1.0E-3

1.0E-4 1.00E-04
1.00E-05 1.0E-5 1.00E-06 1.0E-6

Non-CD best bestphase phase DS/SS Non-CD worst worstphase phase DS/SS DS/SS Non-CD average average DS/SS-DDSbest CD-DDS best phase phase CD-DDS worst phase DS/SS-DDSworst CD-DDS average phase DS/SS-DDSaverage
1 1 2 2

0 0

3 3

4 4

5 5

6 6

7 7

8 8

9 9

10 10

Eb/No [dB]
Fig.6 BER performances of code-diversity system with DDS.

1.0E+0 1.0E-0

1.0E-1 1.0E-1

BER
1.0E-2 1.0E-2

1.0E-3 1.0E-3 0 0

Non-CD CD-DAS CD-ADS CD-DDS

1 1 2 2 3 3

Modulation PN sequence Code length Construction method of composite sequence Component matrix Number of concatenations Number of branches Number of users SIR Eb/No Received timing

BPSK-DS/SS Modified M-sequence L = 30 Method A (3 " 3) 10 M=3 K=2 -10 [dB] 0 ~ 10 [dB] Data: asynchronous, Chip: synchronous

5 6 7 8 9 10 7 6 8 9 5 10 Eb/No [dB] Fig.7 Comparisons of BER performances for several systems.

44

Fig. 6 shows BER performances of proposed codediversity (CD) system with DDS (CD-DDS) according to several phase of MAI. Compared with conventional systems (Non code-diversity: Non-CD), in the best phase (i.e., the least BER phase), BER of the proposed CD-DDS is degraded because of error of calculation gi. While, in the

Fig. 7 shows comparisons of BER performances of several systems. BERs of Non-CD, CD-DAS, CD-ADS and the proposed CD-DDS are presented. In CD-DAS, the orthogonal Gold sequences (M-sequence of x5+x2+1=0 with initial value 1, -1, 1, -1, -1, M-sequence of x5+x4+x3+x2+1=0 with initial value 1, -1, -1, 1, -1, and +1 chip addition) are employed [6]. The code length L=32 and the number of branches M=5 are adopted. In CDADS, the own PN sequence is M-sequence (x5+x2+1=0 with initial value -1, -1, -1, -1, -1), orthogonal cyclic shifted M-sequence (x5+x4+x3+x2+1=0 with initial value -1, -1, -1, 1, -1) are employed. The code length L=31 and the number of branches M=5 are adopted. The combination of the orthogonal cyclic shifted M-sequences is employed in order of shift [8]. MAI sequence is the same as previous one, also SIR=-10[dB]. In Fig. 7, the average BERs for several systems are presented. BER of the original CD-DAS is superior to the other systems because the 5 branch sequences are selected more independently. BER of CD-ADS and CD-DDS are almost same, and improved to that of the Non-CD system.

However, a little degradation arises compared with that of CD-DAS because these branch sequences are included same elements. While, hardware of the proposed CDDDS is most simplified as described in Sect. 3.

noise, and so on. Also, the discussions about the optimal number of branches, calculations of weight coefficients, and other construction methods of branch sequences will be needed.

4.2 Performance Evaluation of Modified CodeDiversity Systems Next, BER performance of modified CD system with DDS is evaluated by computer simulations. The number of prepared DDS is 7. These sequences are selected to secure approximate orthogonalization for several phase shifted (i.e., delayed) interference. By calculating and selecting gi, half of code-diversity branches gi becomes 1, and the others are neglected as 0. Fig.8 shows BER performances of modified codediversity system with DDS (Modified CD-DDS), and compares the system with Non-CD or CD-DDS. X-axis is signal to interference power ratio(SIR), y-axis is BER, and Eb/No =6.8[dB] is fixed. BER performance of CD-DDS is improved to that of Non-CD. Further, BER performance of modified CD-DDS can be more improved to them. For example, at BER= 10-2, about 4[dB] gain of SIR can be obtained compared with them.

ACKNOWLEGMENT
This study has been supported in part by a Grant-in-Aid for Scientific Research ((C) 23560480) from Japan Society for the Promotion of Science.

REFERENCES
[1] R. Kohno, Pseudo-noise sequence and interference cancellation techniques for spread spectrum system spread spectrum theory and techniques in Japan -, IEICE Trans., vol.E74, no.5, pp.1083-1092, May 1991. M. Okubo and M. Nakagawa, Countermeasure against SSMA near-far problem using unknown sequence estimator, IEEE ISSSTA94, vol.1, pp167-170, July 1994. K. Fukawa and H. Suzuki, Reception scheme utilizing matched filter with interference canceling Linear interference canceling for DS-CDMA mobile communication, IEICE Technical Report, SST94-22, June 1994. U. Madhow and M.L. Honig, Minimum Mean Squared Error Interference Suppression for Direct-Sequence Spread-Spectrum Code-Division Multiple Access, Proc. 1st Int. Conf. Universal Personal Commun., 1, pp.273-277, Sept.1992. H. Asato, S. Tachikawa and G. Marubayashi, Suppression effects of multiple access interference in DS/SSMA by using partial correlation weight coefficient control techniques, IEICE Trans., Fundamentals, vol.J79-A, no.3, pp.785-794, March 1996. T. Seki, M. Hamamura and S. Tachikawa, Suppression Effects of Multiple Access Interference in DS/CDMA with CodeDiversity, IEICE Trans. Fundamentals, vol.E82-A, no.12, pp.2720-2727, Dec.1999. R. Manzanilla, M. Hamamura and S. Tachikawa, Sequence Interference Suppression Characteristics of Code- Diversity DS/CDMA over Multipath Fading Channels, IEICE Trans. Fundamentals, vol.E84-A, no.12, pp.2983 -2990, Dec.2001. S. Hasebe and S. Tachikawa, DS/SS code-diversity communication system using a constant amplitude composite sequence, IEICE Trans. Fundamentals, vol.J90-A, no.1, pp.44-53, Jan. 2007. S. Tachikawa and M. Takekawa: DS/CDMA Code-Diversity Communication System Using Adaptive Weight Control, The 14th Asia-Pacific Conference on Communications (APCC2008), Akihabara, Tokyo, Japan, 16-PM2-A-1, (2008.10.16). M. Tanimoto, H. Sumiyoshi and M. Komai, Synchronous Spread-Spectrum Multiplex Communication System by Using a Modified M-sequence, IEICE Trans. Com., vol.J67-B, no.3, pp.297-304, Mar. 1984.

[2] [3]

[4]

[5]

[6]

[7]
Non-CD CD-DDS Modified CD-DDS

4dB

[8] [9]

Fig.8 BER performances of modified code-diversity system with DDS compared with other systems.

[10]

5 CONCLUSIONS
In this paper, we have proposed the novel spreading sequences for code-diversity (CD-DDS), in which both branch sequences and a composite sequence by addition of them are constructed digital sequences, in DS/CDMA communication systems. Therefore, the hardware of codediversity system can be simplified. By computer simulations, BER performances of the proposed system have been presented compared with other systems. Improvements of BER have been a little degraded than the original diversity system (CD-DAS), however, almost same as the previous system of constant amplitude composite sequence by analog sequences (CD-ADS). Additionally, modified CD-DDS has been presented to improve the BER performance and simplify its hardware. For further studies, it will be necessary that the evaluation of the proposed system in various environments including fading channels, CW jamming, burst impulsive

Shin'ichi Tachikawa was born in Niigata, Japan. He received the B.S., M.S. and Dr. Degrees in electrical engineering from Nagaoka University of Technology, Nagaoka, Japan, in 1980, 1982 and 1991, respectively. He was engaged at Nagaoka University of Technology from 1982 to 2009. Since 2009, he has been a member of Engineering at Nagaoka National College of Technology, where he is now a Professor. His current research interests lie in the areas of spread spectrum communication system, ultra wideband systems, coding theory and signal processing. Dr. Tachikawa is a member of IEICE (The Institute of Electronics, Information and Communication Engineers) of JAPAN. Hayato Noguchi was born in Niigata, Japan. He was with Electrical & Mechanical Systems Engineering Advanced Course, Nagaoka National College of Technology, Nagaoka, Japan.