A Novel Method of Reducing the Decoding Complexity for High-Rate Turbo Codes
スポンサーリンク
概要
- 論文の詳細を見る
This paper considers a high-rate turbo code which employs high-rate convolutional codes as component codes, and presents a novel method of reducing the decoding complexity of the codes. By eliminating some of branches that have the lowest reliabilities among all the branches entering each node, the proposed algorithm reduces the complexity in the process of the add-compare-select (ACS) between the consecutive stages of iterative decoding. That is, the complexity gradually decreases as the number of iterations increases. We compare the unpunctured high-rate turbo code with a classical punctured high-rate turbo code in terms of performance/complexity trade-off under the same code rate. Simulation results show that the proposed approach with a good trade-off provides an alternative coding scheme to the classical punctured high-rate turbo coding for the application to high-data-rate wireless communication systems.
- 一般社団法人電子情報通信学会の論文
- 2001-08-01
著者
-
Minowa Tadashi
Institute Of Industrial Science The University Of Tokyo
-
Imai Hideki
Institute Of Industrial Science Interfaculty Initiative For Information Studies University Of Tokyo
関連論文
- Efficient Algorithms for Tate Pairing(Elliptic Curve Cryptography, Cryptography and Information Security)
- Coded Modulation for Satellite Broadcasting Based on Unconventional Partitionings (Special Section on Information Theory and Its Applications)
- Shared Pseudo-Random Secret Generation Protocols (Special Section on Discrete Mathematics and Its Applications)
- A Simple Leakage-Resilient Authenticated Key Establishment Protocol, Its Extensions, and Applications(Information Security)
- The MAC-based Construction of Strong Multiple Encryption
- Efficient Strong Multiple Encryption from Relaxed Conditions
- ID-based Encryption for Directed Acyclic Graph Hierarchies : Unification of Key-evolving Encryption Primitives (Extended Abstract)
- Shielding Asymmetric Cryptosystems from Decryption Failures
- A Bandwidth-Saving Public Key Encryption Conversion Scheme
- Towards Removing Random Oracles from OAEP
- Best Truncated and Impossible Differentials of Feistel Block Ciphers with S-D (Substitution and Diffusion) or D-S Round Functions(Special Section on Cryptography and Information Security)
- A Novel Approach to Algebraic and Fast Correlation Attacks for Cryptanalysis of Certain Keystream Generators
- Relations among Notions of Security for Identity Based Encryption Schemes (特集:ユビキタス社会を支えるコンピュータセキュリティ技術)
- Towards Security Enhancement with Efficient Reduction for Identity Based Encryption
- A Remark on GEM
- A New Anonymous Routing Scheme and its Aptitude for Ad-hoc Networks
- Subset Incremental Chain Based Broadcast Encryption with Shorter Ciphertext
- Personal Entropy from Graphical Passwords : Methods for Quantification and Practical Key Generation(Cryptography and Information Security)(Information Theory and Its Applications)
- On Evaluating the Entropy of Graphical Passwords
- Discussions on Unconditionally Secure VSS Robust against Dishonest Majority
- Discussions on Unconditionally Secure VSS Robust against Dishonest Majority
- Implementation of an Industrial R/C System Using a Hybrid DS/FH Spread Spectrum Technique (Special Issue on Spread Spectrum Techniques and Applications)
- Unconditionally Secure Authenticated Encryption(Discrete Mathematics and Its Applications)
- On the oblivious transfer capacity of the erasure channel
- MFSK/FH-CDMA System with Two-Stage Address Coding and Error Correcting Coding and Decoding
- An Error-Controlling Scheme according to the Importance of Individual Segments of Model-Based Coded Facial Images (Special Section on Information Theory and Its Applications)
- Variable Error Controlling Schemes for Intelligent Error Controlling Systems (Special Section on Information Theory and Its Applications)
- A Provably Secure Refreshable Partially Anonymous Token and Its Applications(Discrete Mathematics and Its Applications)
- Traceability Schemes against Illegal Distribution of Signed Documents(Discrete Mathematics and Its Applications)
- Efficient Reliability-Based Turbo Decoding
- Relation between the XL Algorithm and Grobner Basis Algorithms(Symmetric Key Cryptography, Cryptography and Information Security)
- An Efficient Group Signature Scheme from Bilinear Maps(Discrete Mathematics and Its Applications)
- Effect of Noisy Estimation on Turbo-Coded Modulation over Rayleigh Fading Channel
- Block Coding Scheme Based on Complementary Sequences for Multicarrier Signals
- Integrated Co-channel Interference Cancellation and Decoding Scheme over Fading Multipath Channel for CDMA
- Quantum Bit Commitment Robust against Noise and Multiple-photons
- A Simple Method to Control Indirect Information Flows (Special Section of Letters Selected from the 1994 IEICE Spring Conference)
- Pretty-Simple Password-Authenticated Key-Exchange Protocol Proven to be Secure in the Standard Model(Special Section on Information Theory and Its Applications)
- Constructing c-Secure CRT Codes Using Polynomials over Finite Fields(Information Security)
- Effect of Noisy Estimation on Turbo-Coded Modulation over Flat Rayleigh Fading Channels(Special Section on Information Theory and Its Applications)
- Improvements On Security Proofs of Some Identity Based Encryption Schemes
- Bifurcation from Classical to Quantum distinguishability(3) Chaos and nonlinear dynamics in dissipative systems(including BEC and pattern formations), Chaos and Nonlinear Dynamics in Quantum-Mechanical and Macroscopic Systems)
- Multilevel RLL (D, K, I) Constrained Sequences (Special Section on Information Theory and Its Applications)
- Security Protocols Protection Based on Anomaly Detection(Intrusion Detection, New Technologies and their Applications of the Internet III)
- Multihopping and Decoding of Error-Correcting Code for MFSK/FH-SSMA Systems (Special Issue on Spread Spectrum Techniques and Applications)
- Pretty Simple Password-Authenticated Key-Exchange Protocol
- Irregular Low-Density Parity-Check Code Design Based on Euclidean Geometries(Coding Theory)
- Security Analysis on the Proactivized System against Latent Virus Attacks (特集 情報セキュリティの理論と応用)
- Secure Architecture For Distributed Intrusion Detection Systems
- Optimal multibit commitment Information theoretical reductions to weak bit commitments
- Revocable Anonymous Schemes for User's Privacy in Intrusion Detection Systems
- An Image Correction Scheme for Video Watermarking Extraction
- An Embedded Interleaver for Turbo Codes Based on Prime-Field
- A Novel Method of Reducing the Decoding Complexity for High-Rate Turbo Codes
- A Flexible-Revocation Scheme for Efficient Public-Key Black-Box Traitor Tracing(Information Security)
- Cooperative agents for Intrusion Detection systems
- Privacy Enhanced RFID tags with One-Time-Recordable-Memory
- LDPC coded Hybrid Type II ARQ System
- A-7-6 A Public-Key Revocation Scheme Preserving Receiver Privacy
- Relations among Notions of Security for Identity Based Encryption Schemes
- Relations among Notions of Security for Identity Based Encryption Schemes