• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.17-20
• /
• 1999

In this Paper, we discuss reducing the number of orthogonal code in Multi-Code CDMA (MC-CDMA) system. MC-CDMA system is highlighted for multi-media communication services, but conventional MC-CDMA(CMC-CDMA) system are needed many more orthogonal codes compared to traditional direct sequence CDMA(DS-CDMA) systems. in this paper, we propose the system which can reduce the number of orthogonal codes using sub-orthogonal code(SOC) technique. We certificate that the performance of the proposed system shows the almost same result under gaussian noise environment as compared to CMC-CDMA system through Monte-Curio computer simulation method.

• Proceedings of the Korea Institute of Fire Science and Engineering Conference
• /
• 1997.11a
• /
• pp.526-533
• /
• 1997

Reliability of fire protection systems is often discussed, written about, and even put into codes and standards. However, reliability is seldom considered for the fire protection system as a whole. Why does this happen and why should the designer consider the system as a whole\ulcorner Existing codes and standards incorporate the concept of reliability usually In the form of key component redundancy for some parts of a system. The "Fire Safety Concepts Tree" presented in the National Fire Protection Association Guide 550, Guide to the Fire Safety Concepts Tree, provides a starting point for considering the performance of a water based fire suppression system. Considering fire protection objectives for water based fire suppression systems, means of evaluating system reliability can be developed. This development requires identification of system components that are significant to the overall system reliability.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.2
• /
• pp.113-118
• /
• 2011

This paper has analyzed recognizing performance depending on the size of iris codes extracting by iris recognition algorithm using scale-space filtering. The iris images were created through pre-processing, the features were extracted by scale-space filtering, and the codes of 16 sizes were generated. The generated code's performance was compared for each code to calculate FAR and FRR by matching method utilizing Hamming distance. Every code had little overlapping portion between same person and other persons group so that the proposed algorithm's superiority was proved, and the performance of iris codes was analyzed for each size focused on convenience to use when implementing in realization. In addition, the iris codes suitable to iris recognition system that is high-reliable and is able to reduce user's inconvenience due to mis-rejection has been presented considering for commercialization.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.8 no.6
• /
• pp.141-148
• /
• 2009

Space-time block codes (STBC) have no coding gain but they provide a full diversity gain with relatively low encoder/decoder complexity. Therefore, STBC should be concatenated with an outer code which provides an additional coding gain. In this paper, we consider the concatenation of multiple trellis-coded modulation (MTCM) codes with STBC for achieving significant coding gain with full antenna diversity. Using criteria of equal transmit power, spectral efficiency and the number of trellis states, the performance of concatenated scheme is compared to that of previously known space-time trellis codes (STTC) in terms of frame error rate (FER). Simulation results show that MTCM codes concatenated with STBC offer better performance on fast Rayleigh fading channels, than previously known STTC with two transmit antennas and one receive antenna.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.3
• /
• pp.40-45
• /
• 2008

This paper proposes the signal design techniques of quasi-orthogonal space time block codes (QO-STBCS) on the multi-dimensional signal space. In the multiple antenna system(MIMO), QO-STBC achieves the full-diversity and full-rate by grouping two based-symbols. We study the condition for the full-diversity of the grouping QO-STBC geometrically and the performance analysis of codes on the multi-dimensional signal space regarding the various signal constellations. Simulation results show that the way of the performance analysis is validity.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.6C
• /
• pp.570-579
• /
• 2003

The performance of turbo codes is investigated in the direct detection optical PPM channel. We assume that an ideal photon counter is used as an optical detector and that the channel has background noise as well as quantum noise. Resulting channel model is M-ary PPM Poisson channel. We propose the structure of the transmitter and receiver for applying turbo codes to this channel. We also derive turbo decoding algorithm for the proposed coding system, by modifying the calculation of the branch metric inherent in the original turbo decoding algorithm developed for the AWGN channel. Analytical bounds are derived and computer simulation is performed to analyze the performance of the proposed coding scheme, and the results are compared with the performances of Reed-Solomon codes and convolutional codes.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.11
• /
• pp.2397-2404
• /
• 2012

Underwater acoustic communication has multipath error because of reflection by sea-level and sea-bottom. The multipath of underwater channel causes signal distortion and error floor. In order to improve the performance, it is necessary to employ an iterative coding scheme. Among the iterative coding scheme, turbo codes and LDPC codes are dominant channel coding schemes in recent. This paper concluded that turbo coding scheme is optimal for underwater communications system in aspect to performance, coded word length, and equalizer combining. Also, decision directed phase recovery was used for correcting phase offset induced by multipath. Based on these algorithms, we confirmed the performance in the environment of oceanic experimentation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.4C
• /
• pp.329-336
• /
• 2010

Distributed source coding (DSC) system moves computational burden from encoder to decoder, so it takes higher decoding complexity. This paper explores the problem of reducing the decoding complexity of practical Slepian-Wolf coding using low-density parity check accumulate (LDPCA) codes. It is shown that the convergence of mean magnitude (CMM) stopping criteria for LDPC codes help reduce the 85% of decoding complexity under the 2% of compression rate loss, and marginal initial rate request reduces complexity below complexity minimum bound. Moreover, inter-rate stopping criterion, modified for rate-adaptable characteristic, is proposed for LDPCA codes, and it makes decoder perform less iterative decoding than normal stopping criterion does when channel characteristic is unknown.

• ETRI Journal
• /
• v.37 no.5
• /
• pp.929-939
• /
• 2015

Ultra-high-frequency radio-frequency identification (UHF RFID) is widely applied in different industries. The Frame Slotted ALOHA in EPC C1G2 suffers severe collisions that limit the efficiency of tag recognition. An efficient full-duplex anti-collision scheme is proposed to reduce the rate of collision by coordinating the transmitting process of CDMA UWB uplink and UHF downlink. The relevant mathematical models are built to analyze the performance of the proposed scheme. Through simulation, some important findings are gained. The maximum number of identified tags in one slot is g/e (g is the number of PN codes and e is Euler's constant) when the number of tags is equal to mg (m is the number of slots). Unlike the Frame Slotted ALOHA, even if the frame size is small and the number of tags is large, there aren't too many collisions if the number of PN codes is large enough. Our approach with 7-bit Gold codes, 15-bit Gold codes, or 31-bit Gold codes operates 1.4 times, 1.7 times, or 3 times faster than the CDMA Slotted ALOHA, respectively, and 14.5 times, 16.2 times, or 18.5 times faster than the EPC C1 G2 system, respectively. More than 2,000 tags can be processed within 300 ms in our approach.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.1A
• /
• pp.44-50
• /
• 2007

In typical MC-CDMA systems, different frequency-domain scrambling codes are randomly chosen from a given code set and then assigned to different subscriber stations using the same subcarrier set. When orthogonal codes are employed for the frequency-domain scrambling, the choice of the scrambling code does not affect the detection performance if the timing and frequency synchronizations are perfect and the channel characteristic is flat. However, in practical cases, inter-code interference often appears due to the broken code orthogonality. In this paper, the optimal order of allocating the orthogonal frequency-domain scrambling codes to new subscriber stations is derived under non-negligible timing offsets in MC-CDMA system.