• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.34C no.8
• /
• pp.1-7
• /
• 1997

In tis paper, w eproposed a modeling for direct-sequence spread communication base band modem in RT-level VHDL and implemented in a one-chip VLSI and tested. The transmitter modulates with DQPSK modulation method and spreads a modulated signal with 32-bit PN code into 1.152MHz. The receiver de-spreads a signal using 32-tap matched filter and recovers with DQPSK demodulation method. The digital frequency synthesizer generates the sine signal and the cosine signal of 2.304MHz with ROM tables in the size of 7$\^$*/256 and 6$\^$*/256, respectively. The implemented VLSI has been verified a BER with 10$\^$-4/ at E$\_$b//N$\_$o/ of 13dB with a SPW fixed design model and fabricated in the 0.8.mu.m KG6423 gate array with a VHDL model.

• 한국정보통신설비학회:학술대회논문집
• /
• 2008.08a
• /
• pp.39-42
• /
• 2008

In this paper, we analyze the performance of ultra wide band (UWB) systems in indoor wireless channel in accordance with the number of pulses per bit at transmit signals and the decision types of receiver. The indoor channel is modeled as the modified Saleh and Valenzuela (SV) model which has been proposed as a UWB channel model by the IEEE group, IEEE 802.15.SG3a. Two types of UWB signals are considered One is the pulse position modulation-time hopping (PPM-TH) signal. And the other is the pulse amplitude modulation-direct sequence (PAM-DS) signal. It is assumed that the receiver is an ideal receiver which can receive all signals of the multipath.

• Journal of Positioning, Navigation, and Timing
• /
• v.8 no.1
• /
• pp.13-18
• /
• 2019

This paper analyzes the signal acquisition performance of the legacy GNSS spreading codes and a polyphase code. The code length and chip rate of a polyphase code are assumed to be same as those of the GPS L1 C/A and Galileo E1C codes. The autocorrelation and cross correlation characteristics are analyzed. In addition, a way to calculate a more accurate probability of false alarm for a code with sidelobe non-zero auto-correlation function is proposed. Finally, we estimate the probability of detection and the mean acquisition time for a given signal strength and the probability of false alarm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.5
• /
• pp.952-958
• /
• 1994

In this paper a method calculates the time offset between a binary sequence and its shifted sequence based on the number theoretic approach is presented. Using this method the time offset between a binary sequence and its shifted sequence can be calculated. It has been recongnized that the defining the reference (zero-offset) sequence is important in synchronous code division multiple access(CDMA) system since the same spreading sequence are used by the all base station. The time offset of the sequence with respect to the zero offset sequence are used to distinguish signal received at a mobile station from different base stations. This paper also discusses a method that defines the reference sequence.

• Journal of Broadcast Engineering
• /
• v.16 no.1
• /
• pp.64-72
• /
• 2011

In a Single Frequency Network (SFN) for Advanced Television Systems Committee (ATSC) terrestrial digital television (DTV) system, the interferences induced by the multiple transmitters and/or repeaters using same frequency are unavoidable. To ease the interference handing in the SFN for ATSC DTV system, transmitter identification (TxID) signal is recommended in the ATSC terrestrial DTV system. The TxID signal is embedded in the ATSC DTV signal and transmitted from each transmitter and repeater within the SFN and in ATSC recommended practice (RP) A/111, Kasami sequence is recommended as the TxID signal. In this paper, we propose an additional data transmission scheme using the TxID signal. In the proposed scheme, the Kasami sequence not only acts as the conventional TxID of the SFN for ATSC terrestrial DTV system but also carriers the additional data bits on its polarity and the code phase.

• Journal of the Institute of Convergence Signal Processing
• /
• v.19 no.2
• /
• pp.42-46
• /
• 2018

Adaptive signal processing is quite important in various signal and communication environments. In adaptive signal processing methods since the least mean square(LMS) algorithm is simple and robust, it is used everywhere. As the step is varied in the variable step(VS) LMS algorithm, the fast convergence speed and the small excess mean square error can be obtained. Various variable step LMS algorithms are researched for better performances. But in some of variable step LMS algorithms the computational complexity is quite large for better performances. The fixed step LMS algorithm with a low computational complexity merit and the variable step LMS algorithm with a fast convergence merit are combined in the proposed sporadic step algorithm. As the step is sporadically updated, the performances of the variable step LMS algorithm can be maintained in the low update rate using Fibonacci sequence. The performances of the proposed variable step LMS algorithm are proved in the adaptive equalizer.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.6
• /
• pp.257-262
• /
• 2010

In this paper, we propose an effective method for detecting signals among multi-user in cooperative communication system. Spread sequence is inserted to NULL space of synchronization channel to synchronize between each user among frame formats of the cooperative communication and then transmitted. In the receiver, the wanted signal is detected by using correlation among the inserted spread sequences. As simulation results, correlations among the signals using m-sequence in AWGN, Rician, and Rayleigh channel are shown. Using the simulation results in this paper, we expect a reliable cooperative communication.

• Proceedings of the KOSOMBE Conference
• /
• v.1989 no.05
• /
• pp.35-37
• /
• 1989

A new MR angiography technique using a composite sequence for the suppression of static sample signals is proposed and verified with experiments. When the composite [$90^{\circ}-{\tau}-180^{\circ}-2{\tau}-180^{\circ}-{\tau}$] sequence is applied, the large signal from the static sample is sufficiently suppressed but the signal from fresh inflow sample of which amplitude. is observed without suppression. These properties are appropriate for angiographic applications. In this paper, a modified line scan method (Block line scan angiography) incorporated with the composite [$90^{\circ}-{\tau}-180^{\circ}-2{\tau}-180^{\circ}-{\tau}$] sequence is used to obtain flow-only images, i.e., angiograms. The block line scan method improves the resolution in the flow-direction at the expense of imaging time. With the composite sequence, there is no need for subtraction procedure as in the most conventional angiographic methods. Experimental results for a phantom and a normal volunteer with KAIS 2.0 Tesla MRI system are shown.

• Journal of Satellite, Information and Communications
• /
• v.5 no.1
• /
• pp.22-26
• /
• 2010

In this paper, we propose an effective method for detecting signals among multi-user in cooperative communication system. Spread sequence is inserted to NULL space of synchronization channel to synchronize between each user among frame formats of the cooperative communication and then transmitted. In the receiver, the wanted signal is detected by using correlation among the inserted spread sequences. As simulation results, correlations among the signals using Kasami/Walsh sequence in AWGN, Rician, and Rayleigh channel are shown. Using the simulation results in this paper, we expect a reliable cooperative communication.

• Journal of the Institute of Convergence Signal Processing
• /
• v.13 no.4
• /
• pp.194-200
• /
• 2012

In this paper we analyze the code sequence generating algorism defined on $GF(2^n)$ proposed by S.Bostas and V.Kumar[7] and derive the implementation functions of code sequence generator using Boolean functions which can map the vector space $F_2^n$ of all binary vectors of length n, to the finite field with two elements $F_2$. We find the code sequence generating boolean functions based on two kinds of the primitive polynomials of degree, n=5 and n=7 from trace function. We then design and implement the code sequence generators using these functions, and produce two code sequence groups. The two groups have the period 31 and 127 and the magnitudes of out of phase(${\tau}{\neq}0$) autocorrelation and crosscorrelation functions {-9, -1, 7} and {-17, -1, 15}, satisfying the period $L=2^n-1$ and the correlation functions $R_{ij}({\tau})=\{-2^{(n+1)/2}-1,-1,2^{(n+l)/2}-1\}$ respectively. Through these results, we confirm that the code sequence generators using boolean functions are designed and implemented correctly.