Rateless Codes with Progressive Recovery for Layered Multimedia Delivery

This paper proposes a novel approach, based on unequal error protection, to enhance rateless codes with progressive recovery for layered multimedia delivery. With a parallel encoding structure, the proposed Progressive Rateless codes (PRC) assign unequal redundancy to each layer in accordance with their importance. Each output symbol contains information from all layers, and thus the stream layers can be recovered progressively at the expected received ratios of output symbols. Furthermore, the dependency between layers is naturally considered. The performance of the PRC is evaluated and compared with some related UEP approaches. Results show that our PRC approach provides better recovery performance with lower overhead both theoretically and numerically

Secure resource allocation in hybrid energy-harvesting relay and full-duplex receiver

Taking into account the wireless physical layer security in energy-constrained relaying systems,a secure resource allocation scheme was proposed under simultaneous wireless information and power transfer (SWIPT) protocol.The utility optimization problem was considered aiming to maximize the secrecy rate by jointly optimizing the power splitting (PS) ratio and the transmit powers under the constraint of the transmit powers of the nodes and the harvested energy of the relay.The objective problem,which is non-convex,was decoupled into two subproblems.One was to optimize the PS ratio,another was to optimize the transmit powers.The optimal solution of the subproblems can be obtained in the closed-form.Then,the suboptimal solution is obtained with the proposed convergent iterative algorithm.Simulation results show the effects of artificial noise signal,residual self-interference signal,transmit power of nodes,amplification factor of relay and other factors on the security performance.Compared with the traditional gradient descent algorithm,the proposed algorithm can reduce more than 80% of the computational load,while the algorithm has the slightly better performance

Design and Analysis of Adaptive Message Coding on LDPC Decoder with Faulty Storage

Unreliable message storage severely degrades the performance of LDPC decoders. This paper discusses the impacts of message errors on LDPC decoders and schemes improving the robustness. Firstly, we develop a discrete density evolution analysis for faulty LDPC decoders, which indicates that protecting the sign bits of messages is effective enough for finite-precision LDPC decoders. Secondly, we analyze the effects of quantization precision loss for static sign bit protection and propose an embedded dynamic coding scheme by adaptively employing the least significant bits (LSBs) to protect the sign bits. Thirdly, we give a construction of Hamming product code for the adaptive coding and present low complexity decoding algorithms. Theoretic analysis indicates that the proposed scheme outperforms traditional triple modular redundancy (TMR) scheme in decoding both threshold and residual errors, while Monte Carlo simulations show that the performance loss is less than 0.2 dB when the storage error probability varies from 10-3 to 10-4

Code-Hopping Based Transmission Scheme for Wireless Physical-Layer Security

Due to the broadcast and time-varying natures of wireless channels, traditional communication systems that provide data encryption at the application layer suffer many challenges such as error diffusion. In this paper, we propose a code-hopping based secrecy transmission scheme that uses dynamic nonsystematic low-density parity-check (LDPC) codes and automatic repeat-request (ARQ) mechanism to jointly encode and encrypt source messages at the physical layer. In this scheme, secret keys at the transmitter and the legitimate receiver are generated dynamically upon the source messages that have been transmitted successfully. During the transmission, each source message is jointly encoded and encrypted by a parity-check matrix, which is dynamically selected from a set of LDPC matrices based on the shared dynamic secret key. As for the eavesdropper (Eve), the uncorrectable decoding errors prevent her from generating the same secret key as the legitimate parties. Thus she cannot select the correct LDPC matrix to recover the source message. We demonstrate that our scheme can be compatible with traditional cryptosystems and enhance the security without sacrificing the error-correction performance. Numerical results show that the bit error rate (BER) of Eve approaches 0.5 as the number of transmitted source messages increases and the security gap of the system is small