• Title/Summary/Keyword: successive decoding

Search Result 46, Processing Time 0.028 seconds

Transform domain Wyner-Ziv video coding with successively improving side information based on decoding reliability (복호 신뢰도에 기반하여 점진적으로 보조정보를 향상시키는 변환영역 Wyner-Ziv 부호화 방법)

  • Ko, Bong-Hyuck;Shim, Hiuk-Jae;Jeon, Byeung-Woo
    • Journal of Broadcast Engineering
    • /
    • v.13 no.6
    • /
    • pp.892-904
    • /
    • 2008
  • As a video encoding in resource constrained environments such as sensor networks has become an important issue, DVC(Distributed Video Coding) has been intensively investigated as a solution for light weighted video encoding problem. Known as one of the representative schemes of DVC, the Wyner-Ziv coding generates side information of current frame only at decoder, using correlation among frames, and reconstructs video through noise elimination on the side information using channel code. Accordingly, the better quality of side information brings less channel noise, thus attains better coding performance of the Wyner-Ziv coder. However, since it is hard for decoder to generate an accurate side information without any information of original frame, a method to successively improve side information using successively decoded original frame, based on decoding reliability, was previously developed. However, to improve side information from decoding results, not only an error rate of the decoding result as a reliability, but also the amount of reliable information from the decoding result is important. Therefore, we propose TDWZ(Transform-domain Wyner-Ziv coding) with successively improving side information based on decoding reliability considering not only an error rate but also the amount of reliable information of the decoding results. Our experiment shows the proposed method gains average PSNR up to 1.7 dB over the previous TDWZ, that is without successive side information improvement.

An Efficient FTN Decoding Method using Separation of LDPC Decoding Symbol in Next Generation Satellite Broadcasting System (차세대 위성 방송 시스템에서 LDPC 복호 신호 분리를 통한 효율적인 FTN 복호 방법)

  • Sung, Hahyun;Jung, Jiwon
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.16 no.2
    • /
    • pp.63-70
    • /
    • 2016
  • To increase throughput efficiency and improve performance, FTN(Faster Than Nyquist) method and LDPC(Low Density Parity Code) codes are employed in DVB-S3 system. In this paper, we proposed efficient turbo equalization model to minimize inter symbol interference induced by FTN transmission. This paper introduces two conventional scheme employing SIC(Successive Interference Cancellation) and BCJR equalizer. Then, we proposed new scheme to resolve problems in this two conventional scheme. To make performance improved in turbo equalization model, the outputs of LDPC and BCJR equalizer are iteratively exchange probabilistic information. In fed LDPC outputs as extrinsic informa tion of BCJR equalizer. we split LDPC output to separate bit probabilities. We compare performance of proposed scheme to that of conventional methods through using simulation in AWGN(Additive White Gaussian Noise) channel. We confirmed that performance was improved compared to conventional methods as increasing throughput parameters of FTN.

Analyses on Achievable Data Rate for Single-User Decoding(SUD) Receiver: with Application to CIS NOMA Strong Channel User (SUD 수신기의 획득가능한 전송률 분석: 상관 정보원 비직교 다중 접속의 강 채널 사용자에 대한 응용)

  • Chung, Kyu-Hyuk
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.15 no.6
    • /
    • pp.1003-1010
    • /
    • 2020
  • This paper investigates the achievable data rate for the single-user decoding(SUD) receiver, which does not perform successive interference cancellation(SIC), in contrast to the conventional SIC non-orthogonal multiple access(NOMA) scheme. First, the closed-form expression for the achievable data rate of SUD NOMA with correlated information sources(CIS) is derived, for the stronger channel user. Then it is shown that for the stronger channel user, the achievable data rate of SUD NOMA with independent information sources(IIS) is generally inferior to that of conventional SIC NOMA with IIS. However, for especially highly CIS, we show that the achievable data rate of SUD NOMA is greatly superior to that of conventional SIC NOMA. In addition, to verify the impact of CIS on the achievable data rate of SUD, the extensive comparisons of the achievable data rates for the SUD receiver and the SIC receiver are compared for various correlation coefficients.

Improvement of the Sphere Decoding Complexity through an Adaptive OSIC-SD System (Adaptive OSIC-SD 시스템을 통한 SD 복호기 복잡도 개선)

  • Portugal, Sherlie;Yoon, Gil-Sang;Seo, Chang-Woo;Hwang, In-Tae
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.48 no.3
    • /
    • pp.13-18
    • /
    • 2011
  • Sphere Decoding (SD) is a decoding technique able to achieve the Maximum Likelihood (ML) performance in fading environments; nevertheless, the main disadvantage of this technique is its high complexity, especially in poor channel conditions. In this paper, we present an adaptive hybrid algorithm which reduces the conventional Sphere Decoder's complexity and keeps the ML performance. The system called Adaptive OSIC-SD modifies its operation based on Signal to Noise Ratio (SNR) information and achieves an optimal performance in terms of Bit Error Rate (BER) and complexity. Through simulations, we probe that the proposed system maintains almost the same bit error rate performance of the conventional SD, and exhibits a lower, quasi-constant complexity.

Layer Selective Cooperation Using Superposition Coding for Reduction of Expected Distortion (평균 왜곡 감소를 위한 중첩 부호화 기반 레이어 선택적 협력 전송)

  • Wang, Jin-Soo;Park, Jin-Bae;Kim, Yun-Hee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.7B
    • /
    • pp.517-527
    • /
    • 2012
  • This paper considers a cooperative communication system with a single relay node, where two-layer superposition coding and successive decoding is employed to reduce the expected distortion of a Gaussian source delivered. For the system, we propose a relay scheme which forwards an appropriate relay signal at the relay node, based on the local decoding result of layers and the decoding result of layers at the destination node fed back to the relay node. In the scheme, the relay signal is designed not only by applying decode-and-forward but also by applying amplify-and-forward to reduce the outage probability in final decoding of each layer. The performance of the proposed scheme is evaluated numerically in terms of the expected distortion at various relay locations using outage probabilities derived. The results show that the proposed scheme outperforms the conventional schemes in most cases of the relay location and the gain gets larger when the relay node is closer to the source node in particular.

Successive MAP Detection with Soft Interference Cancellation for Iterative Receivers in Hierarchical M-ary QAM Systems (M-레벨 QAM 계층 변조 시스템에서 연 간섭 제거를 이용한 연속 MAP 판정 기법)

  • Kim, Jong-Kyung;Seo, Jong-Soo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.3C
    • /
    • pp.304-310
    • /
    • 2009
  • This paper proposes a successive MAP (maximum a posteriori probability) detection scheme with SoIC(soft interference cancellation) to reduce the receiver complexity of hierarchical M-ary QAM system. For the successive MAP detection, modulation symbols generated from the other data streams are treated as Gaussian noise or eliminated as the soft interference according to their priorities. The log-likelihood ratio of the a posteriori probability (LAPRP) of each bit is calculated by the MAP detector with an adjusted noise variance in order to take the elimination and Gaussian assumption effect into account. By separating the detection process into the successive steps, the detection complexity is reduced to increase linearly with the number of bits per hierarchical M-ary QAM symbol. Simulation results show that the proposed detection provides a small performance degradation as compared to the optimal MAP detection.

Performance and Construction of Polar Codes with Fixed Code Rate (고정 부호율 극 부호의 성능 및 설계 방법)

  • Kim, Jong-Hwan;Kang, Jin-Whan;Kim, Sang-Hyo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.6C
    • /
    • pp.337-342
    • /
    • 2011
  • In 2009, polar codes, proposed by Arikan, are theoretically proven codes to achieve capacity with acceptable encoding and decoding complexity. Currently, polar codes using channel polarization phenomenon are studied in security and data compression fields etc. In this paper, we consider the practical communication system and propose the construction method of polar codes with finite length and fixed code rate. Also, we show the outstanding performance and corresponding construction method of polar codes found by heuristic simulation.

Cell Loss Recovery Algorithm for ATM Networks (ATM 망에서의 셀 손실 복구 기법에 관한 연구)

  • Shim, Yun-Sup;Chun, Sang-Hun;Kwak, Kyung-Sup
    • Journal of IKEEE
    • /
    • v.3 no.1 s.4
    • /
    • pp.22-28
    • /
    • 1999
  • The existing CREG-VP, a technique to compensate the successive cell losses caused by traffic congestion using the FEC method on the Vp, has the merits of the short average encoding decoding time and the compatibility with the ATM standard cell format, but it has the restriction in the number of regenerable cells. In this thesis, we propose a scheme to efficiently regenerate the cell losses even in the burst traffic property by the expansion of the CREG-VP. The proposed scheme improves the detection capability of the lost cells by changing the CRP and the regeneration performance of the successive cells by using the interleaved parity cell. The simulation result shows that the proposed method produces much improvements compared with the existing ones in the cell loss rate reduction factor.

  • PDF

Iterative MIMO Reception Based on Low Complexity Soft Detection (저연산 연판정 기반의 다중 안테나 반복검출 기법)

  • Shin, Sang-Sik;Choi, Ji-Woong
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.8
    • /
    • pp.61-66
    • /
    • 2013
  • In this paper, we propose an iterative soft dimension reduction based multi-input multi-output (MIMO) detection for coded spatial multiplexing system. In spite of better performance of iterative MIMO detection, its computational complexity gives a significant burden to the receivers. To mitigate this problem, we propose a scheme employing all ordering successive interference cancellation (AOSIC) for hard-decision detection and dimension reduction soft demodulator (DRSD) with iterative decoding for soft-decision detectors, respectively. This scheme can reduce complexity of iterative soft MIMO detection and provide better performance than other conventional detectors.

Joint Demodulation and Decoding System for FTN (FTN 시스템을 위한 동시 복조 및 복호 기법)

  • Kang, Donghoon;Oh, Wangrok
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.52 no.1
    • /
    • pp.17-23
    • /
    • 2015
  • In this paper, we propose an efficient joint demodulation and decoding scheme for FTN (Faster than Nyquist) systems. Several previous works have demonstrated that ISI (Inter Symbol Interference) cancellation schemes based on BCJR (Bahl-Cocke-Jelinek-Raviv) algorithm are suitable for FTN systems. Unfortunately, required complexity of the previous ISI cancellation schemes is very high, especially when a multi-level modulation scheme is employed. In this paper, we propose a joint demodulation and decoding scheme for FTN systems with an iteratively decodable channel coding scheme and a multi-level modulation. Compared with the previously proposed schemes, the proposed scheme not only offers reliable performance but also requires relatively low complexity. Also, the proposed scheme can be easily applied to the FTN system with a multi-level modulation with a minor modification.