Implementation of low-density parity-check codes decoder for CCSDS standard

The complexity/performance balanced decoder for low-density parity-check （LDPC） codes is preferred in practical wireless communication systems. A low complexity LDPC decoder for the Consultative Committee for Space Data Systems （CCSDS） standard is achieved in DSP. An ap- proximate decoding algorithm, normalized rain-sum algorithm, is used in the implementation for its low amounts of computation. To reduce the performance loss caused by the approximation, the pa- rameters of the normalized min-sum algorithm are determined by calculating and finding the mini- mum value of thresholds through density evolution. The minimum value which indicates the best per- formance of the decoding algorithm is corresponding with the optimized parameters. In implementa- tion, the memory cost is saved by decomposing the parity-check matrix into submatrices to store and the computation of passing message in decoding is accelerated by using the intrinsic function of DSP. The performance of the decoder with optimized factors is simulated and compared with the ideal BP decoder. The result shows they have about the same performance.

Reconfigurable design of deblocking filter for variable block sizes

Based on the flexible quadtree partition structure of coding tree units(CTUs),the deblocking filter(DBF)in high efficiency video coding(HEVC)consumes a lot of resources when implemen-ted by hardware.It is difficult to achieve flexible switching between different sizes of coding blocks.Aiming at this problem,a reconfigurable implementation of DBF is proposed.Based on the dynamic programmable reconfigurable video array processor(DPRAP)with context switch reconfiguration mechanism,the runtime flexible switching of two coding block sizes is realized.The experimental results show that the highest work-frequency reaches 151.4 MHz.Compared with the dedicated hardware architecture scheme,the resource consumption can be reduced by 28.1%while realizing the dynamic switching between algorithms of two coding block sizes.Compared with the results of HM16.0,by using a complete I-frame for testing,the average peak signal-to-noise ratio(PSNR)of the reconfigurable implementation proposed in this paper has increased by 3.0508 dB,the coding quality has improved to a certain extent.

Reconstructing the Framework for Determining and Compensating Dual Risk-Based Damage to Personal Information

Abstract:In the era of big data,the dual risk-based damage associated with personal information leakage presents unique chal-lenges.The unrealistic nature of objective risk-based damage without benchmarks and the high threshold for determining subjective risk-based damage have become obstacles for information subjects seek-ing compensation.Traditional approaches to supporting risk-based damage are inadequate in the realm of personal information.The theoretical support and compensation mechanisms for dual risk-based damage to personal information need re-exploration.The information subject’s control over the value of personal information assets based on the right to know forms the theoretical basis for objective risk-based damage.Additionally,the independence of mental suffering and the relaxation of the“serious”standard allow for a broader in-terpretation of subjective risk-based damage.In addressing claims by information subjects,first,courts need to assess and quantify the level of risk-based damage;second,legislation should introduce a statutory compensation system to define the range of personal information asset value,with a focus on the fault of personal information processors in civil liability;finally,establishing a special representative litigation mechanism can effectively address collective disputes over personal information infringement and alleviate the litigation burden on infor-mation subjects.