• Title/Summary/Keyword: code complexity

Search Result 594, Processing Time 0.025 seconds

Efficient Cooperative Transmission Scheme for High Speed WPAN System in 60GHz (60GHz WPAN 시스템의 전송 효율 향상을 위한 협력 통신 기법)

  • Lee, Won-Jin;Lee, Jae-Young;Suh, Young-Kil;Heo, Jun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.3C
    • /
    • pp.255-263
    • /
    • 2010
  • In this paper, we present an efficient cooperative transmission scheme for high speed 60GHz WPAN system. In 60GHz, the cooperative transmission with relay is effective scheme because signals are exceedingly attenuated according to the distance and the transmission is impossible when there is no LOS between transmitter and receiver. Moreover, the reliability of signal in destination can be improved by receiving data from a relay as well as a transmitter. However, the overall data rate is reduced because transmission time is more required for relay. To solve this problem, we propose a cooperative transmission scheme with RS-CC serial concatenated codes. In the proposed cooperative transmission scheme, the relay can reduce the transmission data size because the only parity bits of systematic RS code are transmitted after encoding by CC. But the computational complexity is increased at the relay and the destination.

Bit Split Algorithm for Applying the Multilevel Modulation of Iterative codes (반복부호의 멀티레벨 변조방식 적용을 위한 비트분리 알고리즘)

  • Park, Tae-Doo;Kim, Min-Hyuk;Kim, Nam-Soo;Jung, Ji-Won
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.12 no.9
    • /
    • pp.1654-1665
    • /
    • 2008
  • This paper presents bit splitting methods to apply multilevel modulation to iterative codes such as turbo code, low density parity check code and turbo product code. Log-likelihood ratio method splits multilevel symbols to soft decision symbols using the received in-phase and quadrature component based on Gaussian approximation. However it is too complicate to calculate and to implement hardware due to exponential and logarithm calculation. Therefore this paper presents Euclidean, MAX, sector and center focusing method to reduce the high complexity of LLR method. Also, this paper proposes optimal soft symbol split method for three kind of iterative codes. Futhermore, 16-APSK modulator method with double ring structure for applying DVB-S2 system and 16-QAM modulator method with lattice structure for T-DMB system are also analyzed.

A Study on the Neural Network for the Character Recognition (문자인식을 위한 신경망컴퓨터에 관한 연구)

  • 이창기;전병실
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.29B no.8
    • /
    • pp.1-6
    • /
    • 1992
  • This paper proposed a neural computer architecture for the learning of script character pattern recognition categories. Oriented filter with complex cells preprocess about the input script character, abstracts contour from the character. This contour normalized and inputed to the ART. Top-down attentional and matching mechanisms are critical in self-stabilizing of the code learning process. The architecture embodies a parallel search scheme that updates itself adaptively as the learning process unfolds. After learning ART self-stabilizes, recognition time does not grow as a function of code complexity. Vigilance level shows the similarity between learned patterns and new input patterns. This character recognition system is designed to adaptable. The simulation of this system showed satisfied result in the recognition of the hand written characters.

  • PDF

Low Complexity Ordered Successive Cancellation Algorithm for Multi-user STBC Systems

  • Le, Van-Hien;Yang, Qing-Hai;Kwak, Kyung-Sup
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.2A
    • /
    • pp.162-168
    • /
    • 2007
  • This paper proposes two detection algorithms for Multi-user Space Time Block Code systems. The first one is linear detection Gaussian Elimination algorithm, and then it combined with Ordered Successive Cancellation to get better performance. The comparisons between receiver and other popular receivers, including linear receivers are provided. It will be shown that the performance of Gaussian Elimination receiver is similar but more simplicity than linear detection algorithms and performance of Gaussian Elimination Ordered Successive Cancellation superior as compared to other linear detection method.

A Subthreshold PMOS Analog Cortex Decoder for the (8, 4, 4) Hamming Code

  • Perez-Chamorro, Jorge;Lahuec, Cyril;Seguin, Fabrice;Le Mestre, Gerald;Jezequel, Michel
    • ETRI Journal
    • /
    • v.31 no.5
    • /
    • pp.585-592
    • /
    • 2009
  • This paper presents a method for decoding high minimal distance ($d_{min}$) short codes, termed Cortex codes. These codes are systematic block codes of rate 1/2 and can have higher$d_{min}$ than turbo codes. Despite this characteristic, these codes have been impossible to decode with good performance because, to reach high $d_{min}$, several encoding stages are connected through interleavers. This generates a large number of hidden variables and increases the complexity of the scheduling and initialization. However, the structure of the encoder is well suited for analog decoding. A proof-of-concept Cortex decoder for the (8, 4, 4) Hamming code is implemented in subthreshold 0.25-${\mu}m$ CMOS. It outperforms an equivalent LDPC-like decoder by 1 dB at BER=$10^{-5}$ and is 44 percent smaller and consumes 28 percent less energy per decoded bit.

FPGA Implementation of PN Code Searcher with a Shared Architecture for CDMA PCS mobile Station (공유구조를 가지는 CDMA 이동국용 PN 부호 탐색기의 FPGA 구현)

  • 이장희;이성주김재석이문기
    • Proceedings of the IEEK Conference
    • /
    • 1998.10a
    • /
    • pp.1109-1112
    • /
    • 1998
  • In this paper, we propose a new architecture of the PN code acquistion system which has some shared blocks in order to reduce the hardware complexity. The proposed system has an energy calculation block which is shared by two active correlators. Our system is designed suitable for IS-95 based CDMA PCS. The new architecture was designed and simulated using VHDL. Also, We implemented it with Altera FPGA, and verified our system. The gate count is about 7,500. Our proposed architecture is also useful for multi-carrier system which uses the multiple searcher.

  • PDF

Performance of Iterative Multiuser Detector and Turbo Decoder in WCDMA System (WCDMA 시스템에l서 반복 다중사용자 검출기 및 터보 복호기의 성능)

  • Kim, Jeong-Goo
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.11 no.4
    • /
    • pp.40-46
    • /
    • 2006
  • The performance of iterative multiuser detector and turbo decoder is presented to provide high quality multimedia services in WCDMA (wideband code division multiple access) system in this paper. Especially the relationship between the local iteration of turbo decoder and the global iteration of multiuser detector including the turbo decoder is analyzed. As a result, three local iterations and three global iterations are considered to be sufficient to provide satisfactory error performance with resonable complexity. The interference cancellation capability of global iteration is improved when the number of users is increased.

  • PDF

On the Proper Use of Char Reaction Kinetic Model in CFD Code for Oxy-PC Combustion (순산소 미분탄 연소 CFD 연구에 사용되는 촤 반응속도 모델의 적절한 사용에 대한 연구)

  • Kim, Daehee;Choi, Sangmin
    • 한국연소학회:학술대회논문집
    • /
    • 2012.11a
    • /
    • pp.67-70
    • /
    • 2012
  • Many computational fluid dynamic (CFD) simulations have treated the coal kinetics poorly due to large physical domain sizes and high computational complexity, particularly for the recent oxy-coal boilers. Furthermore, some modelers' lack of understanding of the kinetic rate model seems to worsen the simulation accuracy. This study is to suggest the importance of proper use of single-film global kinetic model generally used in CFD code to describe the oxy-fuel combustion of coal char through simple char burnout calculation.

  • PDF

Pseudo-Orthogonal Space-Time Block Codes for MIMO-OFDM Systems over Frequency-Selective Channels

  • Lee, Heun-Chul;Park, Seok-Hwan;Lee, In-Kyu
    • Journal of IKEEE
    • /
    • v.11 no.4
    • /
    • pp.340-347
    • /
    • 2007
  • This paper proposes a new class of Space-Time Block Codes, which is manipulated from the existing transmit diversity schemes. We analyze the performance and the receiver complexity of the proposed scheme and confirm that the new diversity scheme can yield performance gain over other existing four-transmit antenna cases. By relaxing the diversity criterion on code designs, the proposed space-time code provides a full transmission rate for four-transmit antennas and makes it possible to approach the open-loop Shannon channel capacity. Outage capacity and simulation results are used to show that substantial improvements in performance while maintaining a simple linear processing receiver structure are obtained in frequency selective channels.

  • PDF

Performance Improvement of Turbo Code in low SNR and short frame sizes (낮은 SNR과 짧은 프레임에서 터보코드 성능 개선)

  • 정상연;이용식;심우성;허도근
    • Proceedings of the IEEK Conference
    • /
    • 1999.06a
    • /
    • pp.61-64
    • /
    • 1999
  • The turbo code appropriate to IMT-2000 is known to have a good performance whenever the size of frame increases. But it is not appropriate to a sort of video service to need real time because of decoding complexity and long delay time by the size of frame. Therefore this paper proposes decoding decision algorithm of short frame in which soft output is weighted according to iteration number in turbo decoder. Performance of the proposed algorithm is analysed in the AWGN channel when short length of frame is 100, 256, 640. As the result. it is appeared that the proposed decoding decision algorithm has improved in BER other than in the existing MAP decoding algorithm.

  • PDF