• Title/Summary/Keyword: block code

Search Result 766, Processing Time 0.024 seconds

Fast Binary Block Inverse Jacket Transform

  • Lee Moon-Ho;Zhang Xiao-Dong;Pokhrel Subash Shree;Choe Chang-Hui;Hwang Gi-Yean
    • Journal of electromagnetic engineering and science
    • /
    • v.6 no.4
    • /
    • pp.244-252
    • /
    • 2006
  • A block Jacket transform and. its block inverse Jacket transformn have recently been reported in the paper 'Fast block inverse Jacket transform'. But the multiplication of the block Jacket transform and the corresponding block inverse Jacket transform is not equal to the identity transform, which does not conform to the mathematical rule. In this paper, new binary block Jacket transforms and the corresponding binary block inverse Jacket transforms of orders $N=2^k,\;3^k\;and\;5^k$ for integer values k are proposed and the mathematical proofs are also presented. With the aid of the Kronecker product of the lower order Jacket matrix and the identity matrix, the fast algorithms for realizing these transforms are obtained. Due to the simple inverse, fast algorithm and prime based $P^k$ order of proposed binary block inverse Jacket transform, it can be applied in communications such as space time block code design, signal processing, LDPC coding and information theory. Application of circular permutation matrix(CPM) binary low density quasi block Jacket matrix is also introduced in this paper which is useful in coding theory.

Design of an Adaptive Reed-Solomon Decoder with Varying Block Length (가변 블록길이를 갖는 적응형 리드솔로몬 복호기의 설계)

  • Song, Moon-Kyou;Kong, Min-Han
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.4C
    • /
    • pp.365-373
    • /
    • 2003
  • In this paper, we design a versatle RS decoder which can decode RS codes of any block length n as well as any message length k, based on a modified Euclid's algorithm (MEA). This unique feature is favorable for a shortened RS code of any block length it eliminates the need to insert zeros before decoding a shortened RS code. Furthermore, the value of error correcting capability t can be changed in real time at every codeword block. Thus, when a return channel is available, the error correcting capability can be adaptiverly altered according to channel state. The decoder permits 4-step pipelined processing : (1) syndrome calculation (2) MEA block (3) error magnitude calculation (4) decoder failure check. Each step is designed to form a structure suitable for decoding a RS code with varying block length. A new architecture is proposed for a MEA block in step (2) and an architecture of outputting in reversed order is employed for a polynomial evaluation in step (3). To maintain to throughput rate with less circuitry, the MEA block uses not only a multiplexing and recursive technique but also an overclocking technique. The adaptive RS decoder over GF($2^8$) with the maximal error correcting capability of 10 has been designed in VHDL, and successfully synthesized in a FPGA.

Development of Block-based Code Generation and Recommendation Model Using Natural Language Processing Model (자연어 처리 모델을 활용한 블록 코드 생성 및 추천 모델 개발)

  • Jeon, In-seong;Song, Ki-Sang
    • Journal of The Korean Association of Information Education
    • /
    • v.26 no.3
    • /
    • pp.197-207
    • /
    • 2022
  • In this paper, we develop a machine learning based block code generation and recommendation model for the purpose of reducing cognitive load of learners during coding education that learns the learner's block that has been made in the block programming environment using natural processing model and fine-tuning and then generates and recommends the selectable blocks for the next step. To develop the model, the training dataset was produced by pre-processing 50 block codes that were on the popular block programming language web site 'Entry'. Also, after dividing the pre-processed blocks into training dataset, verification dataset and test dataset, we developed a model that generates block codes based on LSTM, Seq2Seq, and GPT-2 model. In the results of the performance evaluation of the developed model, GPT-2 showed a higher performance than the LSTM and Seq2Seq model in the BLEU and ROUGE scores which measure sentence similarity. The data results generated through the GPT-2 model, show that the performance was relatively similar in the BLEU and ROUGE scores except for the case where the number of blocks was 1 or 17.

Block Loss Recovery Using Fractal Extrapolation for Fractal Coded Images (프랙탈 외삽을 이용한 프랙탈 부호화 영상에서의 블록 손실 복구)

  • 노윤호;소현주;김상현;김남철
    • Journal of Broadcast Engineering
    • /
    • v.4 no.1
    • /
    • pp.76-85
    • /
    • 1999
  • The degradation of image quality by block loss is more serious in fractal coded images with the error propagation due to mapping from the lost blocks than in DCT coded images. Therefore. a new algorithm is presented for recovering the blocks lost in the transmission through the lossy network as A TM network of the images coded by Jacquins fractal coding. Jacquins fractal code is divided into two layers of header code and main code according to its importance. The key technique of the proposed BLRA (block loss recovery algorithm) is a fractal extrapolation that estimates the lost pixels by using the contractive mapping parameters of the neighboring range blocks whose characteristics are similar to a lost block. The proposed BLRA is applied to the lost blocks in the iteration of decoding. Some experimental results show the proposed BLRA yields excellent performance in PSNR as well as subjective quality.

  • PDF

Multimedia Fingerprinting in DCT Block (DCT 블록의 멀티미디어 핑거프린팅)

  • Rhee, Kang-Hyeon
    • Journal of IKEEE
    • /
    • v.15 no.3
    • /
    • pp.241-247
    • /
    • 2011
  • In this paper, it was implemented an algorithm of multimedia fingerprinting in DCT block. For the improvement of the limits of DRM’s ability, the proposed algorithm could be decided a responsibility boundary to judge a traitor who falsified the content according to perform separately a watermarking of content provider and a fingerprinting of content user. At the test image size($128{\times}128$) and block size($8{\times}8$) of the content provider, the measured PSNR is Inf~46.6dB with watermarking strength ${\Theta}=0.5{\sim}1.2$, and at a number of users and user's code length are n=7,15,31,63 and l=7,15,31,64 each, the measured PSNR is Inf~46.1 with fingerprinting code length l=7,15,31,63. Finally, a traitor tracing of the falsified content is approached to a trace ratio 1 which is extended to n-1.

A Double Helix DNA Structure Based on the Block Circulant Matrix (I) (블록순환 행렬에 의한 이중나선 DNA 구조 (I))

  • Lee, Sung-Kook;Park, Ju-Yong;Lee, Moon-Ho
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.16 no.3
    • /
    • pp.203-211
    • /
    • 2016
  • The genetic code is a key to bio-informatics and to a science of biological self-organizing on the whole. Modern science faces the necessity of understanding and systematically explaining mysterious features of ensembles of molecular structures of the genetic code. This paper is devoted to symmetrical analysis for genetic systems. Mathematical theories of noise-immunity coding and discrete signal processing are based on Jacket matrix methods of representation and analysis of information. Both of the RNA and Jacket Matrix property also have the Element(Block) - wise Inverse Matrices. These matrix methods, which are connected closely with relations of symmetry, are borrowed for a matrix analysis of ensembles of molecular elements of the genetic code. This method is presented for its simplicity and the clarity with which it decomposes a Jacket Matrix in terms of the genetic RNA Codon.

Detection of Colluded Multimedia Fingerprint using LDPC and BIBD (LDPC와 BIBD를 이용한 공모된 멀티미디어 핑거프린트의 검출)

  • Rhee Kang-Hyeon
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.43 no.5 s.311
    • /
    • pp.68-75
    • /
    • 2006
  • Multimedia fingerprinting protects multimedia content from illegal redistribution by uniquely marking every copy of the content distributed to each user. Differ from a symmetric/asymmetric scheme, fingerprinting schemes, only regular user can know the inserted fingerprint data and the scheme guarantee an anonymous before recontributed data. In this paper, we present a scheme which is the algorithm using LDPC(Low Density Parity Check) for detection of colluded multimedia fingerprint and correcting errors. This proposed scheme is consists of the LDPC block, Hopfield Network and the algorithm of anti-collusion code generation. Anti-collusion code based on BIBD(Balanced Incomplete Block Design) was made 100% collusion code detection rate about the linear collusion attack(average, AND and OR) and LD% block for the error bits correction confirmed that can correct error until AWGN 0dB.

A Closed Loop Orthogonal Space-Time Block Code for Maximal Channel Gains (최대의 채널 이득을 위한 폐루프 직교 시공간 블록 부호)

  • Lee, Ki-Ho;Kim, San-Hae;Shin, Yo-An
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.45 no.12
    • /
    • pp.13-19
    • /
    • 2008
  • In this paper, we propose a new CL-OSTBC (Closed Loop Orthogonal Space-Time Block Code) scheme for four transmit antennas and compare the scheme with existing closed loop schemes on the performance of BER (Bit Error Rate). In the proposed scheme, a transmitter receives channel feedback information and combines modulated symbols by the symbol combiner, and transmits the symbols encoded by the space-time block encoder. As a result, the proposed scheme achieves full-rate and maximal channel gains by more efficient utilization of the channel feedback information. Moreover, the scheme can reduce computation complexity by using a linear detector. Simulation results on the BER performance show that the proposed CL-OSTBC scheme outperforms existing CL-OSTBC schemes.

Allowing a Large Access Timing Offset in OFDM-CDMA Using ZCZ Code and Block Spreading (ZCZ 부호와 블록 확산을 이용한 사용자 동기화 경감 OFDM-CDMA)

  • Na, Donj-jun;Choi, Kwonhue
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.1
    • /
    • pp.23-36
    • /
    • 2016
  • We propose a new type of OFDM-CDMA scheme which allows large inter-user timing offset using zero correlation zone(ZCZ) code in conjunction with block spreading technique. Moreover to maximize spectral efficiency, the proposed OFDMA does not have guard time(GT). This is opposite to the trends in the conventional schemes where GT are supposed to be larger to allow larger inter-user timing offset. It is remarkable that the proposed GT-free OFDM-CDMA scheme completely cancels inter-user interference in the multipath fading simply by despreading process. This inter-user interference-free feature still remains even there exist inter-user timing offsets as large as multiple OFDM symbols. Although the self-user interference exists due to no GT, it can be effectively suppressed by simple successive interference cancellation(SIC) from the first symbol in spread block as it is free from inter symbol interference(ISI).

3/4-rate SFBC SSB SC FDMA System with 4 Transmit Antennas (4개의 송신 안테나를 갖는 3/4 비율의 주파수 공간 블록 부호 단일 측대 파형 SC FDMA 시스템)

  • Won, HuiChul
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.26 no.6
    • /
    • pp.1-9
    • /
    • 2021
  • In order to increase frequency transmission efficiency, single side band(SSB) transmission systems with the complex conjugate symmetry characteristics on a frequency domain have been studied. In addition, orthogonal block codes(space-time or space-frequency block code(SFBC)) for the diversity performance gain of transmission systems have been widely researched. In this paper, we implement a 3/4-rate SFBC SSB single-carrier(SC) frequency division multiple access(FDMA) system with 4 transmit antennas. It can be shown from the simulation results that the proposed SFBC SSB SC FDMA system using the 3/4-rate 4×4 orthogonal block code outperforms the conventional SSB SC FDMA system and the 2×2 SFBC SSB SC FDMA system with 2 transmit antennas.