• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.1A
• /
• pp.31-36
• /
• 2004

In this paper, we proposed the new structure of the Rake Finger using Walsh Switch, the shared accumulator, and the pipeline-FWHT algorithm for reducing the signal processing complexity resulting from the increase of the number of data correlator. The function simulation of the proposed architecture is performed by Synopsys tool and the timing simulation is performed by Compass tool. The number of computational operation in the proposed data correlators is 160 additions and the conventional ones is 512 additions when the number of walsh code N=4. As a result, it is reduced about 3.2 times other than the number of computational operation of the conventional ones. Also, the result shows that the data processing time of the proposed Rake Finger architecture is 90,496[ns] and the conventional ones is 110,696[ns]. It is $18.3\%$ faster than the data processing time of the conventional Rake Finger architecture.

• Journal of Communications and Networks
• /
• v.7 no.3
• /
• pp.243-247
• /
• 2005

We propose an efficient block least-mean-square (BLMS) adaptive algorithm, in conjunction with error control coding, for direct-sequence code division multiple access (DS-CDMA) systems. The proposed adaptive receiver incorporates decision feedback detection and channel encoding in order to improve the performance of the standard LMS algorithm in convolutionally coded systems. The BLMS algorithm involves two modes of operation: (i) The training mode where an uncoded training sequence is used for initial filter tap-weights adaptation, and (ii) the decision-directed where the filter weights are adapted, using the BLMS algorithm, after decoding/encoding operation. It is shown that the proposed adaptive receiver structure is able to compensate for the signal-to­noise ratio (SNR) loss incurred due to the switching from uncoded training mode to coded decision-directed mode. Our results show that by using the proposed adaptive receiver (with decision feed­back block adaptation) one can achieve a much better performance than both the coded LMS with no decision feedback employed. The convergence behavior of the proposed BLMS receiver is simulated and compared to the standard LMS with and without channel coding. We also examine the steady-state bit-error rate (BER) performance of the proposed adaptive BLMS and standard LMS, both with convolutional coding, where we show that the former is more superior than the latter especially at large SNRs ($SNR\;\geq\;9\;dB$).

• ETRI Journal
• /
• v.19 no.3
• /
• pp.186-201
• /
• 1997

In this paper, a home location register (HLR) for CDMA mobile communication system (CMS) is introduced. It stores the mobile station (MS) subscribers locations and supplementary service information. Call processing procedures for HLR are developed to receive and store subscriber's location coming from mobile exchange (MX) during the location registration, and to transfer subscriber's location and supplementary service information to the MX during the mobile-terminated call setup. For fast call processing by increasing database access speed, a memory-resident database management system is devised. For Easy and secure HLR operation, administration and maintenance functions and overload control mechanisms are implemented. Designed HLR hardware platform is expandable and flexible enough to reallocated software blocks to any subsystems within the platform. It is configurable according to the size of subscribers. An authentication center (AC) is developed on the same platform. It screens the qualified MS from the unqualified. The calls to and from the unqualified MS are rejected in CMS. To authenticate the MS, the AC generates a new authentication parameter called "AUTHR" using shared secret data (SSD) and compared it with the other AUTHR received from the MS. The MC also generates and stores seed keys called "A-keys" which are used to generate SSDs. The HLR requirements, the AC requirements, software architecture, hardware platform, and test results are discussed.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.14 no.12
• /
• pp.1300-1310
• /
• 2003

In this paper, the performance of a multicarrier CDMA system using adaptive modulation and adaptive subchannel allocation scheme is analyzed in Rayleigh fading channel. The proposed adaptive modulator consists of modulation schemes using QPSK 16 QAM, 64 QAM and 256 QAM and constellations are pointed by Gray code. In addition, the threshold of the analysis is average E$\_$b//N$\_$o/ when the BER is 1 %. In the multicarrier system with adaptive subchannel allocation scheme, each DS waveform of user is transmitted over the K subchannels with the biggest fading among L subchannels. In case of the proposed system, total 4 subchannels are used and data are transmitted over 2 subchannels with the biggest fading, which results in the threshold of each channels is 5.2 dB, 9 dB, 13.2 dB and 8.4 dB, 12.2 dB, 16.3 dB. In the case of proposed system, the BER of 10$\^$-3/ is satisfied if average E$\_$b//N$\_$o/ is 8.1 dB. This is increased performance of 12.9 dB in comparison with conventional system. The BPS according to average channel is needed average E$\_$b//N$\_$o/ of about 15 dB in 7 bit. In the case of subchannel error, the BER of 10$\^$-3/ is 13.6 dB and is declined about 5.5 dB.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.2
• /
• pp.64-69
• /
• 2003

In this paper, I introduce a simple design method using existing filter design method, such as Parks-McClecllan algorithm, for root-squared type raised cosine filter with equiripple characteristics, Thought some design examples, we show that the proposed filter has much better performance in ripple than the conventional SRCF at the expense of small increasing of ISI. In addition, the proposed filter is compatible with conventional SRCF. Finally, the filter for W-CDMA which uses RRC (Root Raised Cosine) with a=0.22 is designed in 12bit finite precision.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.12A
• /
• pp.1309-1318
• /
• 2004

The rapid growth of the mobile Internet has enabled its application area to expand, and its users want services that require more bandwidth for multimedia services. There are limits to support the various multimedia service to mobile station provided by existing mobile communications. The wireless MAN called the IEEE 802.16 Broadband Wireless Access systems which the IEEE 802.11 wireless LAN is similar to wireline Internet service being able to supper a various contents is used and is designed to consider a handoff is studying. Especially, TG(Task Group)e of IEEE 802.16 is in progress discussion to support a handoff to higher layer using BS(Base Station) or unit of sector, to UC. Yet a scheme is not detail. This thesis proposes the network model for IEEE 802.16e to support a soft handoff between BSs to use a mobile communication network called cdma2000 Ix EV-DO network. The proposed network model supports soft handoff to add a management skill in MA of each BS for MC(Mobility Controller). The proposed network model has merits that is able to apply existing systems as it is and that is able to use a various multimedia service, when using a wireless Internet.

• Journal of Communications and Networks
• /
• v.5 no.3
• /
• pp.187-196
• /
• 2003

We consider the use of error control coding in direct sequence-code-division multiple access (OS-COMA) systems that employ multiuser detection (MUO) and space diversity. The relative performance gain between Reed-Solomon (RS) code and convolutional code (CC) is well known in [1] for the single user, additive white Gaussian noise (AWGN) channel. In this case, RS codes outperform CC's at high signal-to-noise ratios. We find that this is not the case for the multiuser interference channel mentioned above. For useful error rates, we find that soft-decision CC's to be uniformly better than RS codes when used with DS-COMA modulation in multiuser space-time channels. In our development, we use the Gaussian approximation on the interference to determine performance error bounds for systems with low number of users. Then, we check their accuracy in error rate estimation via system's simulation. These performance bounds will in turn allow us to consider a large number of users where we can estimate the gain in user-capacity due to channel coding. Lastly, the use of turbo codes is considered where it is shown that they offer a coding gain of 2.5 dB relative to soft-decision CC.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.7
• /
• pp.1427-1436
• /
• 1997

Turbo codes, decoded through an iterative decoding algorithm, habe recently been shown to yidel remarkable coding gains close to theoretical limits in the Gaussian channel environment. This thesis presents the performance of Turbo code through the computer simulation. The performance of modified Turbo code is compared to that of the conventional Turbo codes. The modified Turbo code reduces the time delay in decoding with minimal effect to the performance for voice transmission sytems. To achieve the same performance, random interleaver the size of which is no less than the square root of the original one should be used. Also, the modified Turbo code is applied to MC-CDMA system, and its performance is analyzed under the Rayleigh Fading channel environment. In Rayleigh fading channel environment, due to the amplitude distortion caused by fading, the interleaver of the size twice no less than that in the Gaussian channel enironment was required. In overall, the modified Turbo code maintained the performance of the conventional Turbo code while the time delay in transmission and decoding was reduced at the rate of multiples of two times the squared root of the interleaver size.

• Journal of the Institute of Convergence Signal Processing
• /
• v.5 no.1
• /
• pp.6-12
• /
• 2004

Identification rate and time are very important in the identification of RFID tag, and the tag requires simple structure to use economically large quantity of tags. These factors make the MAC protocols of wired or wireless network environment result in different requirements. In the paper, we propose a method to apply spread spectrum scheme using orthogonal channel via Walsh function as the anti-collision communication system for the purpose of non-collision identification of multiple tags, and consider its property. The proposed system use two step identification. in the first step, collision is resolved via constructing to respond after specific delay time based on unique n, and conventional polling scheme follows in the second step.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.38 no.12
• /
• pp.66-74
• /
• 2001

In this paper, we proposed the new structure of the Rake Finger using Walsh Switch, the shared accumulator, and the pipeline FWHT(Fast Walsh Hadamard Transform) algorithm for reducing the signal processing complexity resulting from the increase of the number of data correlators. The function simulation of the proposed architecture is performed by Synopsys tool and the timing simulation is performed by Compass tool. The number of computational operation in the proposed data correlators is 160 additions and the conventional ones is 512 additions when the number of walsh code channels is 4. As a result, it is reduced about 3.2 times other than the number of computational operation of the conventional ones. Also, the result shows that the data processing time of the proposed Rake Finger architecture is 90,496[ns] and the conventional ones is 110,696[ns]. It is 18.3% faster than the data processing time of the conventional Rake Finger architecture.