Abstract
A novel design of de-free k-constraint low-density parity-check (LDPC) code is proposed in this study. The input user data is first converted into a k-constraint code using a nibble replacement method. After that, a guided scrambling (GS) technique and a (4,6) balance code are deployed together to construct de-free channel coded sequences. The designed de-free k constrained code is further combined with the LDPC code such that the modulation constraints are satisfied in both the systematic and parity parts. Simulation results show that the proposed design not only provides an improved bit-error-rate (BER) performance, but also achieves significant dc suppression.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
