EXIT charts analysis of a root-like bit mapping for LDPC-coded QAM systems

2017 ◽  
Vol 70 ◽  
pp. 39-48
Author(s):  
Fernanda Smith ◽  
Evaldo Pelaes ◽  
Bartolomeu F. Uchôa-Filho
Keyword(s):  
Exit Charts ◽  
Bit Mapping

A Novel Low-Complexity Adaptive Bit Mapping Scheme for Spatial Modulation

2018 ◽  
Vol 67 (4) ◽  
pp. 3674-3678 ◽  
Author(s):  
Husam Elfadil ◽  
Mehdi Maleki ◽  
Hamid Reza Bahrami
Keyword(s):  
Low Complexity ◽  
Spatial Modulation ◽  
Bit Mapping ◽  
Mapping Scheme

An Improved Belief Propagation Decoding of Concatenated Polar Codes With Bit Mapping

2018 ◽  
Vol 22 (6) ◽  
pp. 1160-1163 ◽  
Author(s):  
Qing-Ping Yu ◽  
Zhi-Ping Shi ◽  
Li Deng ◽  
Xingwang Li
Keyword(s):  
Belief Propagation ◽  
Polar Codes ◽  
Bit Mapping

EXIT-Aided Bit Mapping Design for LDPC Coded Modulation with APSK Constellations

2012 ◽  
Vol 16 (6) ◽  
pp. 777-780 ◽  
Author(s):  
Tao Cheng ◽  
Kewu Peng ◽  
Jian Song ◽  
Keqian Yan
Keyword(s):  
Coded Modulation ◽  
Bit Mapping

Improved design of bit mapping based on EXIT-chart analysis for DVB-T2 system

2011 ◽  
Vol 57 (4) ◽  
pp. 1579-1585 ◽  
Author(s):  
Keqian Yan ◽  
Tao Cheng ◽  
Fang Yang ◽  
Kewu Peng ◽  
Jian Song
Keyword(s):  
Exit Chart ◽  
Improved Design ◽  
Bit Mapping

A Lossless Watermarking for 3D STL Model Based on Entity Rearrangement and Bit Mapping

2017 ◽  
Vol 9 (2) ◽  
pp. 25-37 ◽  
Author(s):  
Juan Chen ◽  
Fei Peng ◽  
Jie Li ◽  
Min Long
Keyword(s):  
Copyright Protection ◽  
High Capacity ◽  
Good Efficiency ◽  
Stl Model ◽  
Optimal Capacity ◽  
Secret Communication ◽  
Content Security ◽  
Lossless Watermarking ◽  
Bit Mapping ◽  
Watermarking Scheme

With the wide application of 3D STL model in 3D printing, much attention has been paid to its content security and copyright protection. Based on entity rearrangement and bit mapping, a lossless and high capacity watermarking scheme is proposed for 3D STL model. Experimental results and analysis show that the average capacity is improved 0.71bits/facet compared with the original entity rearrangement method, and the capacity is 0.247 bits/entity larger than that of the optimal capacity of the standard entity rearrangement method. It can achieve good efficiency and it is robust against translation, rotation and even scaling. It has potential application in secret communication and copyright protection of 3D STL model.

scholarly journals Analysis of Near-Capacity Iterative Decoding Schemes for Wireless Communication Using EXIT Charts

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 124424-124436 ◽  
Author(s):  
Nasru Minallah ◽  
Muhammad Fasih Uddin Butt ◽  
Imran Ullah Khan ◽  
Ishtiaque Ahmed ◽  
Khurram S. Khattak ◽  
...  
Keyword(s):  
Wireless Communication ◽  
Iterative Decoding ◽  
Exit Charts
Sign in / Sign up

Export Citation Format

Share Document