• Title/Summary/Keyword: Decoding algorithm

Search Result 684, Processing Time 0.026 seconds

Study on algorithm of blind modulation detector in EDGE systems (EDGE 시스템에서 블라인드 변조 검출기의 알고리즘에 관한 연구)

  • Park, Hong-Won;Moon, Hong-Youl;Woo, Sung-Hyun;Kim, Jin-Hee
    • Aerospace Engineering and Technology
    • /
    • v.9 no.1
    • /
    • pp.67-71
    • /
    • 2010
  • In this study, an algorithm for blind modulation detection in EDGE systems is presented. EDGE introduces an 8PSK modulation to provide high-speed data rates in addition to the existing GSM system. A transmitter may switch dynamically the modulation and coding schemes for transmission of data according to the channel quality. To decode the data correctly, the receiver has to detect using only training sequence which modulation is being used. Basically the property of one radio block composed of four bursts to detect effectively the modulation scheme even under severe conditions is used. More specifically, the reference value calculated for received burst is accumulated with previous reference value to minimize statistically the false detection probability in one radio block. Also each burst data having different modulation from the modulation of the fourth burst is set to zero to improve the decoding performance because the reference of the fourth burst has the highest reliability.

Error Concealment Method considering Distance and Direction of Motion Vectors in H.264 (움직임벡터의 거리와 방향성을 고려한 H.264 에러 은닉 방법)

  • Son, Nam-Rye;Lee, Guee-Sang
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.1C
    • /
    • pp.37-47
    • /
    • 2009
  • When H.264 encoded video streams are transmitted over wireless network, packet loss is unavoidable. Responding on this environment, we propose methods to recover missed motion vector in the decoder: At first, A candidate vector set for missing macroblock is estimated from high correlation coefficient of neighboring motion vectors and missing block vectors the algorithm clusters candidate vectors through distances amongst motion vectors of neighboring blocks. Then the optimal candidate vector is determined by the median value of the clustered motion vector set. In next stage, from the candidate vector set, the final candidate vector of missing block is determined it has minimum distortion value considering directions of neighboring pixels' boundary. Test results showed that the proposed algorithm decreases the candidate motion vectors $23{\sim}61%$ and reduces $3{\sim}4sec$ on average processing(decoding) time comparing the existing H.264 codec. The PSNR, in terms of visual quality is similar to existing methods.

Design and Implementation of 4D-8PSK TCM Simulator for Satellite Communication Systems (4D-8PSK TCM 위성통신 시스템 시뮬레이터 설계 및 구현)

  • Kim, Dohwook;Kim, Joongpyo;Kim, Sanggoo;Yoon, Dongweon
    • The Journal of Korean Institute of Information Technology
    • /
    • v.17 no.3
    • /
    • pp.31-41
    • /
    • 2019
  • In this paper, we design and implement the simulator for the transmitter and receiver of 4D-8PSK TCM with 2.0, 2.25, 2.5, and 2.75 bits/symbol-channel transmission efficiency recommended by the CCSDS for satellite communications, and then analyze the BER performance of 4D-8PSK TCM system in AWGN channel. The transmitter of 4D-8PSK TCM is designed in accordance with the recommendation in the CCSDS standard. Meanwhile, for the receiver design of 4D-8PSK TCM, we design the differential decoder generalizing the differential encoder/decoder scheme. The trellis decoding algorithm is designed by applying the auxiliary trellis information and the Viterbi algorithm, and an 8-dimensional constellation mapper equation given in the CCSDS standard is deconstructed to design constellation mapper. Especially, we present the optimized receiver for 4D-8PSK TCM system by investigating the BER performances for the traceback lengths in the Viterbi decoder through computer simulations..

Spatial Correlation-based Resource Sharing in Cognitive Radio SWIPT Networks

  • Rong, Mei;Liang, Zhonghua
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.9
    • /
    • pp.3172-3193
    • /
    • 2022
  • Cognitive radio-simultaneous wireless information and power transfer (CR-SWIPT) has attracted much interest since it can improve both the spectrum and energy efficiency of wireless networks. This paper focuses on the resource sharing between a point-to-point primary system (PRS) and a multiuser multi-antenna cellular cognitive radio system (CRS) containing a large number of cognitive users (CUs). The resource sharing optimization problem is formulated by jointly scheduling CUs and adjusting the transmit power at the cognitive base station (CBS). The effect of accessing CUs' spatial channel correlation on the possible transmit power of the CBS is investigated. Accordingly, we provide a low-complexity suboptimal approach termed the semi-correlated semi-orthogonal user selection (SC-SOUS) algorithm to enhance the spectrum efficiency. In the proposed algorithm, CUs that are highly correlated to the information decoding primary receiver (IPR) and mutually near orthogonal are selected for simultaneous transmission to reduce the interference to the IPR and increase the sum rate of the CRS. We further develop a spatial correlation-based resource sharing (SC-RS) strategy to improve energy sharing performance. CUs nearly orthogonal to the energy harvesting primary receiver (EPR) are chosen as candidates for user selection. Therefore, the EPR can harvest more energy from the CBS so that the energy utilization of the network can improve. Besides, zero-forcing precoding and power control are adopted to eliminate interference within the CRS and meet the transmit power constraints. Simulation results and analysis show that, compared with the existing CU selection methods, the proposed low-complex strategy can enhance both the achievable sum rate of the CRS and the energy sharing capability of the network.

Variable Quad Rate ADPCM for Efficient Speech Transmission and Real Time Implementation on DSP (효율적인 음성신호의 전송을 위한 4배속 가변 변환율 ADPCM기법 및 DSP를 이용한 실시간 구현)

  • 한경호
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.18 no.1
    • /
    • pp.129-136
    • /
    • 2004
  • In this paper, we proposed quad variable rates ADPCM coding method for efficient speech transmission and real time porcessing is implemented on TMS320C6711-DSP. The modified ADPCM with four variable coding rates, 16[kbps], 24[kbps], 32[kbps] and 40[kbps] are used for speech window samples for good quality speech transmission at a small data bits and real time encoding and decoding is implemented using DSP. ZCR is used to identify the influence of the noise on the speech signal and to decide the rate change threshold. For noise superior signals, low coding rates are applied to minimize data bit and for noise inferior signals, high coding rates are applied to enhance the speech quality. In most speech telecommunications, silent period takes more than half of the signals, speech quality close to 40[kbps] can be obtained at comparabley low data bits and this is shown by simulation and experiments. TMS320C6711-DSK board has 128K flash memory and performance of 1333MIPS and has meets the requirements for real time implementation of proposed coding algorithm.

Performance Improvement of the battening Effect of the new Asymmetric Turbo Codes (새로운 비대칭 구조를 갖는 터보부호의 Flattening Effect의 성능향상에 관한 연구)

  • 정대호;정성태;김환용
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.6A
    • /
    • pp.533-539
    • /
    • 2002
  • It is well known the fact that turbo lodes has better performance as the number of iteration and the interleaver size increases in the AWGN channel environment. However, as the number of iteration and the interleaver size are increased, it is required much delay and computation for iterative decoding, and caused the flattening effect phenomenon which is very litter BER performance improvement at the arbitrary SNR. In this paper, We proposed the new asymmetric turbo codes, which consist of parallel concatenated turbo codes that use mixed types of component codes with different not only constraint length but also generate polynomial and analyzed its BER performance for log-MAP decoding algorithm with frame size of 128, 256, 512 and 1024 bits, and coding rate of 1/3. As a results of simulation, proposed asymmetric turbo codes verify that its BER performance is superior to conventional symmetric turbo codes. It can be also observed that the flattening effect phenomenon is very reduced by applying the proposed asymmetric turbo codes. It gains respectively 1.7dB ~2.5dB and 2.0dB~2.5dB SNR improvements in the case of short frame(128, 256) and large frame(512, 1024) size for the BER $10_{-4}$>/TEX> region.

Bit Interleaver Design of Ultra High-Order Modulations in DVB-T2 for UHDTV Broadcasting (DVB-T2 기반의 UHDTV 방송을 위한 초고차 성상 변조방식의 비트 인터리버 설계)

  • Kang, In-Woong;Kim, Youngmin;Seo, Jae Hyun;Kim, Heung Mook;Kim, Hyoung-Nam
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39A no.4
    • /
    • pp.195-205
    • /
    • 2014
  • The ultra-high definition television (UHDTV) has been considered as a next generation broadcsating service. However the conventional digital terrestrial transmission system cannot afford the required transmission data rate of UHDTV, and thus adopting ultra-high order constellation, such as 4096-QAM, into the conventional DTT systems has been studied. In particular, when the ultra-high order constellation is adopted into the digital video broadcasting-2nd generation terrestrial (DVB-T2) unequal-error protection (UEP) properties of a codeword of an error correction coding and ultra-high order constellations should be properly matched by bit mapper in order to enhance the decoding performance. Because long codeword results in a heavy computational complexity to design the bit mapper, the DVB-T2 divided it into cascaded blocks, the bit interleaver and the bit-to-cell DEMUX, and there have been many researches related to each block. However, there are few published study related to design methodology of bit interleaver. In this respect, this paper proposes a design methodology of the bit interleaver and presents bit interleavers of 1024-QAM and 4096-QAM according to the proposed design algorithm. The newly designed interleavers improved the decoding performance of the error correction coding by maximally 0.6 dB SNR over both of AWGN and random fading channel.

The Combined AMC-MIMO System with Optimal Turbo Coded V-BLAST Technique to Improve Throughput and SNR (전송률 향상 및 SNR 개선을 위한 최적의 터보 부호화된 V-BLAST 기법을 적용한 AMC-MIMO 결합시스템)

  • Ryoo, Sang-Jin;Lee, Kyung-Hwan;Choi, Kwang-Wook;Lee, Keun-Hong;Hwang, In-Tae;Kim, Cheol-Sung
    • Journal of Internet Computing and Services
    • /
    • v.8 no.4
    • /
    • pp.61-70
    • /
    • 2007
  • In this paper, we propose and observe the Adaptive Modulation system with optimal Turbo Coded V-BLAST(Vertical-Bell-lab Layered Space-Time) technique that is applied the extrinsic information from MAP Decoder in decoding Algorithm of V-BLAST: ordering and slicing. And comparing the proposed system with the Adaptive Modulation system using conventional Turbo Coded V-BLAST technique that is simply combined V-BLAST with Turbo Coding scheme, we observe how much throughput performance and SNR has been improved. In addition, we show that the proposed system using STD(Selection Transmit Diversity) scheme results in on improved result, By using simulation and comparing to conventional Turbo Coded V-BLAST technique with the Adaptive Modulation systems, the optimal Turbo Coded V-BLAST technique with the Adaptive Modulation systems has SNR gain over all SNR range and better throughput gain that is about 350Kbps in 11dB SNR range. Also, comparing with the conventional Turbo Coded V-BLAST technique using 2 transmit and 2 receive antennas, the proposed system with STD scheme show that the improvement of maximum throughput is about 1.77Mbps in the same SNR range and the SNR gain is about 5.88dB to satisfy 4Mbps throughput performance.

  • PDF

Multiple Description Coding of H.264/AVC Motion Vector under Data Partitioning Structure and Decoding Using Multiple Description Matching (데이터 분할구조에서의 H.264/AVC 움직임 벡터의 다중표현 부호화와 다중표현 정합을 이용한 복호화)

  • Yang, Jung-Youp;Jeon, Byeung-Woo
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.44 no.6
    • /
    • pp.100-110
    • /
    • 2007
  • When compressed video data is transmitted over error-prone network such as wireless channel, data is likely to be lost, so the quality of reconstructed picture is severely decreased. It is specially so in case that important information such as motion vector or macroblock mode is lost. H.264/AVC standard includes DP as error resilient technique for protecting important information from error in which data is labeled according to its relative importance. But DP technique requires a network that supports different reliabilities of transmitted data. In general, the benefits of UEP is sought by sending multiple times of same packets corresponding to important information. In this paper, we propose MDC technique based on data partitioning technique. The proposed method encodes motion vector of H.264/AVC standard into multiple parts using MDC and transmits each part as independent packet. Even if partial packet is lost, the proposed scheme can decode the compressed bitstream by using estimated motion vector with partial packets correctly transmitted, so that achieving improved performance of error concealment with minimal effect of channel error. Also in decoding process, the proposed multiple description matching increases the accuracy of estimated lost motion vector and quality of reconstructed video.

8.1 Gbps High-Throughput and Multi-Mode QC-LDPC Decoder based on Fully Parallel Structure (전 병렬구조 기반 8.1 Gbps 고속 및 다중 모드 QC-LDPC 복호기)

  • Jung, Yongmin;Jung, Yunho;Lee, Seongjoo;Kim, Jaeseok
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.11
    • /
    • pp.78-89
    • /
    • 2013
  • This paper proposes a high-throughput and multi-mode quasi-cyclic (QC) low-density parity-check (LDPC) decoder based on a fully parallel structure. The proposed QC-LDPC decoder employs the fully parallel structure to provide very high throughput. The high interconnection complexity, which is the general problem in the fully parallel structure, is solved by using a broadcasting-based sum-product algorithm and proposing a low-complexity cyclic shift network. The high complexity problem, which is caused by using a large amount of check node processors and variable node processors, is solved by proposing a combined check and variable node processor (CCVP). The proposed QC-LDPC decoder can support the multi-mode decoding by proposing a routing-based interconnection network, the flexible CCVP and the flexible cyclic shift network. The proposed QC-LDPC decoder is operated at 100 MHz clock frequency. The proposed QC-LDPC decoder supports multi-mode decoding and provides 8.1 Gbps throughput for a (1944, 1620) QC-LDPC code.