• Title/Summary/Keyword: coding space

Search Result 368, Processing Time 0.026 seconds

Performance Comparison of Space Time block coded Frequency Domain Equalization transmission Scheme in Underwater Acoustic Communication Channel (수중음향 통신채널 환경에서 시공간 블록부호를 적용한 주파수영역 등화기법의 성능평가)

  • Hwang, Hoseon;Lee, Seokwoo;Kang, Yeongsik;Choi, Jaehoon
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.20 no.4
    • /
    • pp.177-185
    • /
    • 2019
  • In this paper, we propose and evaluate a FDE combined with STBC transmission structure to cancellation of ISI in underwater acoustic communication. To achieve this purpose, underwater acoustic channels are modeled and the simulation results are presented. In case of STBC-FDE, the transmission rate is less about 4% than STBC-OFDM, but the SER performance is better than STBC-OFDM that is larger from 4.4% to 16.8% at the SNR of 15dB than STBC-OFDM.

Blind adaptive receiver for uplink multiuser massive MIMO systems

  • Shin, Joonwoo;Seo, Bangwon
    • ETRI Journal
    • /
    • v.42 no.1
    • /
    • pp.26-35
    • /
    • 2020
  • Herein, we consider uplink multiuser massive multiple-input multiple-output systems when multiple users transmit information symbols to a base station (BS) by applying simple space-time block coding (STBC). At the BS receiver, two detection filters for each user are used to detect the STBC information symbols. One of these filters is for odd-indexed symbols and the other for even-indexed symbols. Using constrained output variance metric minimization, we first derive a special relation between the closed-form optimal solutions for the two detection filters. Then, using the derived special relation, we propose a new blind adaptive algorithm for implementing the minimum output variance-based optimal filters. In the proposed adaptive algorithm, filter weight vectors are updated only in the region satisfying the special relation. Through a theoretical analysis of the convergence speed and a computer simulation, we demonstrate that the proposed scheme exhibits faster convergence speed and lower steady-state bit error rate than the conventional scheme.

Resource Allocation Scheme for Real-Time Traffic in MIMO-OFDMA Systems (MIMO-OFDMA 시스템에서 실시간 트래픽 적용을 위한 자원 할당 기법)

  • Lee, Jang-Uk;Yang, Suk-Chel;Shin, Yo-An
    • Proceedings of the IEEK Conference
    • /
    • 2005.11a
    • /
    • pp.301-306
    • /
    • 2005
  • In this paper, we propose P-SRA (Proposed Simplified Resource Allocation) algorithm for efficient resource allocation for real time traffic in MIMO-OFDMA (Multiple Input Multiple Output - Orthogonal Frequency Division Multiple Access) systems with V-BLAST (Vertical-Bell laboratories LAyered Space-Time coding) detector. The proposed P-SRA scheme employs efficient 3 step resource allocation algorithm with plain V-BLAST and no H-ARQ, however it achieves comparable performance of a MIMO-OFDMA system utilizing error compensated V-BLAST and H-ARQ IR scheme.

  • PDF

Statistical Extraction of Speech Features Using Independent Component Analysis and Its Application to Speaker Identification

  • Jang, Gil-Jin;Oh, Yung-Hwan
    • The Journal of the Acoustical Society of Korea
    • /
    • v.21 no.4E
    • /
    • pp.156-163
    • /
    • 2002
  • We apply independent component analysis (ICA) for extracting an optimal basis to the problem of finding efficient features for representing speech signals of a given speaker The speech segments are assumed to be generated by a linear combination of the basis functions, thus the distribution of speech segments of a speaker is modeled by adapting the basis functions so that each source component is statistically independent. The learned basis functions are oriented and localized in both space and frequency, bearing a resemblance to Gabor wavelets. These features are speaker dependent characteristics and to assess their efficiency we performed speaker identification experiments and compared our results with the conventional Fourier-basis. Our results show that the proposed method is more efficient than the conventional Fourier-based features in that they can obtain a higher speaker identification rate.

An Efficient Bit-Level Lossless Grayscale Image Compression Based on Adaptive Source Mapping

  • Al-Dmour, Ayman;Abuhelaleh, Mohammed;Musa, Ahmed;Al-Shalabi, Hasan
    • Journal of Information Processing Systems
    • /
    • v.12 no.2
    • /
    • pp.322-331
    • /
    • 2016
  • Image compression is an essential technique for saving time and storage space for the gigantic amount of data generated by images. This paper introduces an adaptive source-mapping scheme that greatly improves bit-level lossless grayscale image compression. In the proposed mapping scheme, the frequency of occurrence of each symbol in the original image is computed. According to their corresponding frequencies, these symbols are sorted in descending order. Based on this order, each symbol is replaced by an 8-bit weighted fixed-length code. This replacement will generate an equivalent binary source with an increased length of successive identical symbols (0s or 1s). Different experiments using Lempel-Ziv lossless image compression algorithms have been conducted on the generated binary source. Results show that the newly proposed mapping scheme achieves some dramatic improvements in regards to compression ratios.

Efficient Multi-way Tree Search Algorithm for Huffman Decoder

  • Cha, Hyungtai;Woo, Kwanghee
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.4 no.1
    • /
    • pp.34-39
    • /
    • 2004
  • Huffman coding which has been used in many data compression algorithms is a popular data compression technique used to reduce statistical redundancy of a signal. It has been proposed that the Huffman algorithm can decode efficiently using characteristics of the Huffman tables and patterns of the Huffman codeword. We propose a new Huffman decoding algorithm which used a multi way tree search and present an efficient hardware implementation method. This algorithm has a small logic area and memory space and is optimized for high speed decoding. The proposed Huffman decoding algorithm can be applied for many multimedia systems such as MPEG audio decoder.

A Study on the Improvement of Compression Method Using Hilbert Curve Scanning for the Medical Images (Hilbert 곡선 Scan 방법을 이용한 의학 영상의 압축 방법에 관한 연구)

  • 지영준;박광석
    • Journal of Biomedical Engineering Research
    • /
    • v.14 no.1
    • /
    • pp.9-16
    • /
    • 1993
  • For efficient storage and transmission of medical images, the requirement of image com pression is increasing. Because differences between reconstructed images and original images are related with errors In the diagnosis, lossless compression is generally preferred in mod- ical images. in Run Length Coding which is one of the lossless compression method, we have applied modified scanning direction based on the Hilbert curve, which is a kind of space fill ins curve. We have substituted the traditional raster scanning by Hilbert curve direction scanning. Using this method, we have studied enhancement of compression efficiency for medical images.

  • PDF

Observer-Teacher-Learner-Based Optimization: An enhanced meta-heuristic for structural sizing design

  • Shahrouzi, Mohsen;Aghabaglou, Mahdi;Rafiee, Fataneh
    • Structural Engineering and Mechanics
    • /
    • v.62 no.5
    • /
    • pp.537-550
    • /
    • 2017
  • Structural sizing is a rewarding task due to its non-convex constrained nature in the design space. In order to provide both global exploration and proper search refinement, a hybrid method is developed here based on outstanding features of Evolutionary Computing and Teaching-Learning-Based Optimization. The new method introduces an observer phase for memory exploitation in addition to vector-sum movements in the original teacher and learner phases. Proper integer coding is suited and applied for structural size optimization together with a fly-to-boundary technique and an elitism strategy. Performance of the proposed method is further evaluated treating a number of truss examples compared with teaching-learning-based optimization. The results show enhanced capability of the method in efficient and stable convergence toward the optimum and effective capturing of high quality solutions in discrete structural sizing problems.

Technologies for Next Generation Wireless LAN (차세대 무선 LAN 기술 동향)

  • Kim, Y.J.;Kim, M.S.;Lee, S.K.;Hwang, S.K.
    • Electronics and Telecommunications Trends
    • /
    • v.19 no.3 s.87
    • /
    • pp.84-95
    • /
    • 2004
  • 홈 네트워크, 기업의 무선 네트워크 그리고 핫스폿 등과 같은 다양한 환경이 가능하면서 무선 LAN 기술 및 무선 LAN 제품에 대한 요구는 더욱더 증가하고 있으며, 기존 제품과의 호환성을 바탕으로 고속으로 무선 데이터 서비스를 지원할 수 있는 차세대 무선 LAN 기술에 대한 관심이 집중되고 있다. 본 논문에서는 현재 표준화가 진행중인 IEEE 802.11n의 차세대 무선 LAN 기술에 있어 주요하게 언급되고 있는 MAC 프로토콜 및 전송방식들에 대하여 소개한다. IEEE 802.11n은 IEEE 802.11e에서 논의중인 EDCA 및 HCCA를 기반으로 QoS를 보장하고 고속의 무선 LAN 서비스를 지원하기 위해 보다 개선된 MAC 프로토콜의 요구사항을 정의하여 물리계층의 관점에서 MIMO, spatial division multiplexing, space-time block coding 등과 같은 다중 안테나 방안을 고려하고 있다. 또한 주파수의 효율을 증가시키는 방식, 대역폭을 증가하는 방식 그리고 적응 변조를 적용하는 방식 등을 차세대 무선 LAN 전송 방식으로 논의하고 있다.

An algorithm for the multi-view image improvement with the restricted number of images in texture extraction (텍스쳐 추출시 제한된 수의 참여 영상을 이용한 multi-view 영상 개선 알고리즘)

  • 김도현;양영일
    • Proceedings of the IEEK Conference
    • /
    • 1998.06a
    • /
    • pp.773-776
    • /
    • 1998
  • In this paper, we propose an efficient multi-view images coding algorithm which finds the optimal texture from the restricted number of multi-view images. The X-Y plane of the normalized object space is divided into triangular patches. The depth value of the node is determined by applying the block based disparity compensation method and then the texture of the each patch is extracted by applying the affine transformation patch is extracted by applying the affine transformation based disparity compensation method to the multi-view images. We restricted the number of images contributed to determining the texture comapred to traditional methods which use all the multi-view images in the texture extraction. Experimental results show that the SNR of images encoded by the proposed algorithm is better than that of imaes encoded by the traditional method by the amount about 0.2dB for the test sets of multi-view images called dragon, kid, city and santa. The recovered images from the encoded data by the proposed method show the better visual images than the recovered images from the encoded data by the traditional methods.

  • PDF