• Title/Summary/Keyword: 심볼화

Search Result 219, Processing Time 0.031 seconds

Step Size Normalization for Maximum Cross-Correntropy Algorithms (최대 상호코렌트로피 알고리듬을 위한 스텝사이즈 정규화)

  • Kim, Namyong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.9
    • /
    • pp.995-1000
    • /
    • 2016
  • The maximum cross-correntropy (MCC) algorithm with a set of random symbols keeps its optimum weights undisturbed from impulsive noise unlike MSE-based algorithms and its main factor has been known to be the input magnitude controller (IMC) that adjusts the input intensity according to error power. In this paper, a normalization of the step size of the MCC algorithm by the power of IMC output is proposed. The IMC output power is tracked recursively through a single-pole low-pass filter. In the simulation under impulsive noise with two different multipath channels, the steady state MSE and convergence speed of the proposed algorithm is found to be enhanced by about 1 dB and 500 samples, respectively, compared to the conventional MCC algorithm.

Performance Evaluation of Channel Estimation Algorithm for Pilot Symbol-Assisted IMT-2000 System over Multipath Rayleigh Fading Channel (다중경로 레일레이 페이딩 채널에서 파일럿 심볼 구조의 IMT-2000 시스템의 채널추정 알고리즘 성능평가)

  • 구제길;최형진
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.11 no.7
    • /
    • pp.1128-1138
    • /
    • 2000
  • This paper presents two different approaches for channel estimation of IMT-2000 pilot symbol-assisted W-CDMA reverse link over Rayleigh fading channels of one and two paths. By obtaining BER performance through computer simulations, the proposed algorithms of 2-point second-order interpolation and IDD BWMA are compared with the performance of existing interpolation and adaptive algorithms. The BER performance of the proposed algorithms is superior to WMSA, linear and second-order Gaussian interpolation, LMS, and RLS algorithm in fast fading channels. In particular, the BER performance of the IDD BWMA algorithm is nearly insensitive for Doppler frequency within simulation range $E_b/N_0$ = 28 dB. The two proposed algorithms also have relatively simple structure and similar processing delay in comparison to the existing algorithms. Therefore, these algorithms are more suitable for high-speed mobile communication environments.

  • PDF

Implementation of PDF417 Two-Dimensional Barcode Decoder (PDF417 이차원 바코드 디코더의 구현)

  • Hahn Hee Il;Joung Joung Goo
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.41 no.1
    • /
    • pp.77-82
    • /
    • 2004
  • In this paper we present a barcode reader to decode two-dimensional symbology PDF417 and propose a novel method to extract the bar-space Patterns directly from the gray-level barcode image, which employs the location and the distance between extreme points of each row or column of the barcode image. This algerian proves to be very robust from the high convolutional distortion environments such as defocussing and warping, even under badly illuminating condition. If the scanned barcode image is a result of the convolution of a Gaussian-shaped point spread function with a hi-level image, popular image segmentation methods such as image thresholding can not distinguish between very narrow bar-space patterns. The Proposed algorithm shows improved Performance over current barcode readers.

A VLSI Design for High-speed Data Processing of Differential Phase Detectors with Decision Feedback (결정 궤환 구조를 갖는 차동 위상 검출기의 고속 데이터 처리를 위한 VLSI 설계)

  • Kim, Chang-Gon;Jeong, Jeong-Hwa
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.39 no.5
    • /
    • pp.74-86
    • /
    • 2002
  • This paper proposes a VLSI architecture for high-speed data processing of the differential phase detectors with the decision feedback. To improve the BER performance of the conventional differential phase detection, DF-DPD, DPD-RGPR and DFDPD-SA have been proposed. These detection methods have the architecture feedbacking the detected phase to reduce the noise of the previous symbol as phase reference. However, the feedback of the detected phase results in lower data processing speed than that of the conventional differential phase detection. In this paper, the VLSI architecture was proposed for high-speed data processing of the differential phase detectors with decision feedback. The Proposed architecture has the pre-calculation method to previously calculate the results on 'N'th step at 'M-1'th step and the pre-decision feedback method to previously feedback the predicted phases at 'M-1'th step. The architecture proposed in this paper was implemented to RTL using VHDL. The simulation results show that the Proposed architecture obtains the high-speed data processing.

Vision-based Real-Time Two-dimensional Bar Code Detection System at Long Range (비전 기반 실시간 원거리 2차원 바코드 검출 시스템)

  • Yun, In Yong;Kim, Joong Kyu
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.52 no.9
    • /
    • pp.89-95
    • /
    • 2015
  • In this paper, we propose a real-time two-dimensional bar code detection system even at long range using a vision technique. We first perform short-range detection, and then long-range detection if the short-range detection is not successful. First, edge map generation, image binarization, and connect component labeling (CCL) are performed in order to select a region of interest (ROI). After interpolating the selected ROI using bilinear interpolation, a location symbol pattern is detected as the same as for short-range detection. Finally, the symbol pattern is arranged by applying inverse perspective transformation to localize bar codes. Experimental results demonstrate that the proposed system successfully detects bar codes at two or three times longer distance than existing ones even at indoor environment.

Embedded Zerotree Wavelet Image Compression using Daubechies Filtering (Daubechies Filtering을 이용한 EZW 영상 압축)

  • Kim, Jang-Won;Song, Dae-Geon
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.2 no.4
    • /
    • pp.19-28
    • /
    • 2009
  • This paper is a study on method that the EZW algorithm is proposed effective compression technique of wavelet transformed image. The EZW algorithm is encoded by zerotree coding technique using self-similarity of wavelet coefficients. If the coefficient is larger than the threshold a POS coded, if the coefficients is smaller than minus the threshold a NEG is coded. If the coefficient is the root of a zerotree than a ZTR is coded and finally, if the coefficient is smaller then the threshold but it is not the root of a zerotree, than an IZ is coded. This process is repeated until all the wavelet coefficients have been encoded completely. This paper was compared to EZW algorithm and a widely available version of JPEG. As the results of compare, it is shown that the PSNR of the EZW algorithm is better than JPEG.

  • PDF

A Study on Clustered OFCDM with Transmit Antenna Diversity and Coding Associated with Frequency Spreading over Frequency Selective Fading Channel (주파수 선택적 페이딩 채널에서 주파수 확산과 결합된 코딩과 송신안테나 다이버시티를 가진 Clustered OFCDM 시스템에 관한 연구)

  • Ryu Kwan-Woong;Park Yong-Wan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.3A
    • /
    • pp.267-273
    • /
    • 2006
  • This paper improves the effects of clustered OFCDM scheme considering the frequency diversity effect over a frequency selective fading channel. In OFCDM with frequency domain spreading compared to OFDM, we can increase uncorrelated symbols by frequency allocation method of correspondent symbols over the same antenna and different antenna after spreading. The simulation results show that the performance of proposed system is improved by approximately 4 dB in ${\sigma}=0.02{\mu}sec$, the performance is improved by approximately 2.5dB in large delay spread in a 12-path Rayleigh fading channel with overall the root mean squared delay spread and the maximum Doppler frequency of 20 Hz. Also, the required average received Eb/No at the average BER of $10^{-3}$ by optimum method is improved by approximately 2.0 dB, compared to that of STA-OFCDM with frequency rearrange. The new method does not require any bandwidth expansion any feedback from the receiver to the transmitter and its computation complexity is similar to clustered OFCDM.

VLSI Architecture of High Performance Huffman Codec (고성능 허프만 코덱의 VLSI 구조)

  • Choi, Hyun-Jun;Seo, Young-Ho;Kim, Dong-Wook
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.2
    • /
    • pp.439-446
    • /
    • 2011
  • In this paper, we proposed and implemented a dedicated hardware for Huffman coding which is a method of entropy coding to use compressing multimedia data with video coding. The proposed Huffman codec consists Huffman encoder and decoder. The Huffman encoder converts symbols to Huffman codes using look-up table. The Huffman code which has a variable length is packetized to a data format with 32 bits in data packeting block and then sequentially output in unit of a frame. The Huffman decoder converts serial bitstream to original symbols without buffering using FSM(finite state machine) which has a tree structure. The proposed hardware has a flexible operational property to program encoding and decoding hardware, so it can operate various Huffman coding. The implemented hardware was implemented in Cyclone III FPGA of Altera Inc., and it uses 3725 LUTs in the operational frequency of 365MHz

Extracting Scheme of Compiler Information using Convolutional Neural Networks in Stripped Binaries (스트립 바이너리에서 합성곱 신경망을 이용한 컴파일러 정보 추출 기법)

  • Lee, Jungsoo;Choi, Hyunwoong;Heo, Junyeong
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.21 no.4
    • /
    • pp.25-29
    • /
    • 2021
  • The strip binary is a binary from which debug symbol information has been deleted, and therefore it is difficult to analyze the binary through techniques such as reverse engineering. Traditional binary analysis tools rely on debug symbolic information to analyze binaries, making it difficult to detect or analyze malicious code with features of these strip binaries. In order to solve this problem, the need for a technology capable of effectively extracting the information of the strip binary has emerged. In this paper, focusing on the fact that the byte code of the binary file is generated very differently depending on compiler version, optimazer level, etc. For effective compiler version extraction, the entire byte code is read and imaged as the target of the stripped binaries and this is applied to the convolution neural network. Finally, we achieve an accuracy of 93.5%, and we provide an opportunity to analyze stripped binary more effectively than before.

Human Gesture Recognition Technology Based on User Experience for Multimedia Contents Control (멀티미디어 콘텐츠 제어를 위한 사용자 경험 기반 동작 인식 기술)

  • Kim, Yun-Sik;Park, Sang-Yun;Ok, Soo-Yol;Lee, Suk-Hwan;Lee, Eung-Joo
    • Journal of Korea Multimedia Society
    • /
    • v.15 no.10
    • /
    • pp.1196-1204
    • /
    • 2012
  • In this paper, a series of algorithms are proposed for controlling different kinds of multimedia contents and realizing interact between human and computer by using single input device. Human gesture recognition based on NUI is presented firstly in my paper. Since the image information we get it from camera is not sensitive for further processing, we transform it to YCbCr color space, and then morphological processing algorithm is used to delete unuseful noise. Boundary Energy and depth information is extracted for hand detection. After we receive the image of hand detection, PCA algorithm is used to recognize hand posture, difference image and moment method are used to detect hand centroid and extract trajectory of hand movement. 8 direction codes are defined for quantifying gesture trajectory, so the symbol value will be affirmed. Furthermore, HMM algorithm is used for hand gesture recognition based on the symbol value. According to series of methods we presented, we can control multimedia contents by using human gesture recognition. Through large numbers of experiments, the algorithms we presented have satisfying performance, hand detection rate is up to 94.25%, gesture recognition rate exceed 92.6%, hand posture recognition rate can achieve 85.86%, and face detection rate is up to 89.58%. According to these experiment results, we can control many kinds of multimedia contents on computer effectively, such as video player, MP3, e-book and so on.