The optimal and suboptimal structured algorithms of linear block codes from the geometrical perspective are represented.The minimum distance and weight property lemmas and the theorem are proved for the generator matr...The optimal and suboptimal structured algorithms of linear block codes from the geometrical perspective are represented.The minimum distance and weight property lemmas and the theorem are proved for the generator matrix.Based upon the property of generator matrix,the structured algorithms of linear block codes are demonstrated.Since the complexity of optimal structured algorithm is very high,the binary linear block codes is searched by using the suboptimal structured algorithm.The comparison with Bose-Chaudhuri-Hocquenqhem（BCH） codes shows that the searched linear block codes are equivalent on minimum distance and can be designed for more block lengths.Because the linear block codes are used widely in communication systems and digital applications,the optimal and suboptimal structured algorithms must have great future being widely used in many applications and perspectives.展开更多
Genetic algorithms offer very good performances for solving large optimization problems, especially in the domain of error-correcting codes. However, they have a major drawback related to the time complexity and memor...Genetic algorithms offer very good performances for solving large optimization problems, especially in the domain of error-correcting codes. However, they have a major drawback related to the time complexity and memory occupation when running on a uniprocessor computer. This paper proposes a parallel decoder for linear block codes, using parallel genetic algorithms (PGA). The good performance and time complexity are confirmed by theoretical study and by simulations on BCH(63,30,14) codes over both AWGN and flat Rayleigh fading channels. The simulation results show that the coding gain between parallel and single genetic algorithm is about 0.7 dB at BER = 10﹣5 with only 4 processors.展开更多
This study proposes a novel multi-fractal spectrumbasedapproach to distinguish linear block codes from its selfsynchronousscrambled codes. Given that the linear block codeand self-synchronous scrambled linear block co...This study proposes a novel multi-fractal spectrumbasedapproach to distinguish linear block codes from its selfsynchronousscrambled codes. Given that the linear block codeand self-synchronous scrambled linear block code share the propertyof linear correlation, the existing linear correlation-basedidentification method is invalid for this case. This drawback can becircumvented by introducing a novel multi-fractal spectrum-basedmethod. Simulation results show that the new method has highrobustness and under the same conditions of bit error, the lowerthe code rate, the higher the recognition rate. Thus, the methodhas significant potential for future application in engineering.展开更多
A new architecture of space-time codes as a combination of orthogonal space-time block codes （OSTBC） and linear dispersion codes （LDC） is proposed in order to improve the bit error rate（BER） performance of OSTBC...A new architecture of space-time codes as a combination of orthogonal space-time block codes （OSTBC） and linear dispersion codes （LDC） is proposed in order to improve the bit error rate（BER） performance of OSTBC.The scheme proposed is named linear dispersion orthogonal space-time block codes （LDOSTBC）.In LDOSTBC scheme,firstly,the data is coded into LDC codewords.Then,the coded LDC substreams are coded into OSTBC codewords again.The decoding algorithm of LDOSTBC combines linear decoding of OSTBC and ML decoding or suboptimum detection algorithms of LDC.Compared with OSTBC scheme when the rate of LDC is MtR,the performance of LDOSTBC scheme can be improved without decreasing the data rate,where Mt is the number of transmit antennas and R is the spectral efficiency of the modulation constellation.If some rate penalty is allowed,when the rate of LDC is less than MtR the performance of LDOSTBC can be improved further.展开更多
The definition of good codes for error-detection is given. It is proved that a (n, k) linear block code in GF(q) are the good code for error-detection, if and only if its dual code is also. A series of new results abo...The definition of good codes for error-detection is given. It is proved that a (n, k) linear block code in GF(q) are the good code for error-detection, if and only if its dual code is also. A series of new results about the good codes for error-detection are derived. New lower bounds for undetected error probabilities are obtained, which are relative to n and k only, and not the weight structure of the codes.展开更多
Visible light(VL)plays an important role in achieving high-precision positioning and low bit error radio(BER)data communication.However,most VL-based systems can not achieve positioning and communication,simultaneousl...Visible light(VL)plays an important role in achieving high-precision positioning and low bit error radio(BER)data communication.However,most VL-based systems can not achieve positioning and communication,simultaneously.There are two problems:1)the hybrid systems are difficult to extract distinguishable positioning beacon features without affecting communication performance,2)in the hybrid systems,the lost data bits in the inter-frame gap(IFG)are hard to recover,which affects positioning and communication performance.Therefore,in this article,we propose a novel VL-based hybrid positioning and communication system,named HY-PC system,to solve the above problems.First,we propose the robust T-W mapping for recognizing specific Light Emitting Diodes(LEDs),which can provide stable LED recognition accuracy without adding extra beacon data and does not decrease the communication rate.Furthermore,we also propose the novel linear block coding and bit interleaving mechanism,which can recover the lost data bits in the IFG and improve data communication performance.Finally,we use commercial off-the-shelf devices to implement our HY-PC system,extensive experimental results show that our HY-PC system can achieve consistent high-precision positioning and low-BER data communication,simultaneously.展开更多
针对非合作信号处理中的线性分组码盲识别问题,提出了一种基于有限域傅里叶变换(Galois field Fourier transform,GFFT)的检测识别方法。该方法对接收码序列按不同长度进行分段,对分段码字进行有限域上的傅里叶变换并计算其频谱的累积...针对非合作信号处理中的线性分组码盲识别问题,提出了一种基于有限域傅里叶变换(Galois field Fourier transform,GFFT)的检测识别方法。该方法对接收码序列按不同长度进行分段,对分段码字进行有限域上的傅里叶变换并计算其频谱的累积量。通过频谱累积量的不同分布情况,可以估计出正确的分组码长度。同时从频谱累积量中找出码字生成多项式的根,进而得到码字的生成多项式。仿真实验验证了算法的有效性,并对算法的误码适应能力和计算复杂度进行了仿真分析,最后给出了在不同误码环境下最优的频谱累积次数。展开更多
文摘The optimal and suboptimal structured algorithms of linear block codes from the geometrical perspective are represented.The minimum distance and weight property lemmas and the theorem are proved for the generator matrix.Based upon the property of generator matrix,the structured algorithms of linear block codes are demonstrated.Since the complexity of optimal structured algorithm is very high,the binary linear block codes is searched by using the suboptimal structured algorithm.The comparison with Bose-Chaudhuri-Hocquenqhem（BCH） codes shows that the searched linear block codes are equivalent on minimum distance and can be designed for more block lengths.Because the linear block codes are used widely in communication systems and digital applications,the optimal and suboptimal structured algorithms must have great future being widely used in many applications and perspectives.
文摘Genetic algorithms offer very good performances for solving large optimization problems, especially in the domain of error-correcting codes. However, they have a major drawback related to the time complexity and memory occupation when running on a uniprocessor computer. This paper proposes a parallel decoder for linear block codes, using parallel genetic algorithms (PGA). The good performance and time complexity are confirmed by theoretical study and by simulations on BCH(63,30,14) codes over both AWGN and flat Rayleigh fading channels. The simulation results show that the coding gain between parallel and single genetic algorithm is about 0.7 dB at BER = 10﹣5 with only 4 processors.
基金supported by the National Natural Science Foundation of China(61171170) the Natural Science Foundation of Anhui Province(1408085QF115)
文摘This study proposes a novel multi-fractal spectrumbasedapproach to distinguish linear block codes from its selfsynchronousscrambled codes. Given that the linear block codeand self-synchronous scrambled linear block code share the propertyof linear correlation, the existing linear correlation-basedidentification method is invalid for this case. This drawback can becircumvented by introducing a novel multi-fractal spectrum-basedmethod. Simulation results show that the new method has highrobustness and under the same conditions of bit error, the lowerthe code rate, the higher the recognition rate. Thus, the methodhas significant potential for future application in engineering.
基金Sponsored by the "111" Project of China (B08038)Important National Science & Technology Specific Projects (2009ZX03003-003+2 种基金2009ZX03003-004) the NSFC-Guangdong (U0635003)Program for Changjiang Scholars and Innovative Research Team in University(IRT0852)
文摘A new architecture of space-time codes as a combination of orthogonal space-time block codes （OSTBC） and linear dispersion codes （LDC） is proposed in order to improve the bit error rate（BER） performance of OSTBC.The scheme proposed is named linear dispersion orthogonal space-time block codes （LDOSTBC）.In LDOSTBC scheme,firstly,the data is coded into LDC codewords.Then,the coded LDC substreams are coded into OSTBC codewords again.The decoding algorithm of LDOSTBC combines linear decoding of OSTBC and ML decoding or suboptimum detection algorithms of LDC.Compared with OSTBC scheme when the rate of LDC is MtR,the performance of LDOSTBC scheme can be improved without decreasing the data rate,where Mt is the number of transmit antennas and R is the spectral efficiency of the modulation constellation.If some rate penalty is allowed,when the rate of LDC is less than MtR the performance of LDOSTBC can be improved further.
文摘The definition of good codes for error-detection is given. It is proved that a (n, k) linear block code in GF(q) are the good code for error-detection, if and only if its dual code is also. A series of new results about the good codes for error-detection are derived. New lower bounds for undetected error probabilities are obtained, which are relative to n and k only, and not the weight structure of the codes.
基金supported by the Guangdong Basic and Applied Basic Research Foundation No.2021A1515110958National Natural Science Foundation of China No.62202215+2 种基金SYLU introduced high-level talents scientific research support planChongqing University Innovation Research Group(CXQT21019)Chongqing Talents Project(CQYC201903048)。
文摘Visible light(VL)plays an important role in achieving high-precision positioning and low bit error radio(BER)data communication.However,most VL-based systems can not achieve positioning and communication,simultaneously.There are two problems:1)the hybrid systems are difficult to extract distinguishable positioning beacon features without affecting communication performance,2)in the hybrid systems,the lost data bits in the inter-frame gap(IFG)are hard to recover,which affects positioning and communication performance.Therefore,in this article,we propose a novel VL-based hybrid positioning and communication system,named HY-PC system,to solve the above problems.First,we propose the robust T-W mapping for recognizing specific Light Emitting Diodes(LEDs),which can provide stable LED recognition accuracy without adding extra beacon data and does not decrease the communication rate.Furthermore,we also propose the novel linear block coding and bit interleaving mechanism,which can recover the lost data bits in the IFG and improve data communication performance.Finally,we use commercial off-the-shelf devices to implement our HY-PC system,extensive experimental results show that our HY-PC system can achieve consistent high-precision positioning and low-BER data communication,simultaneously.
文摘针对非合作信号处理中的线性分组码盲识别问题,提出了一种基于有限域傅里叶变换(Galois field Fourier transform,GFFT)的检测识别方法。该方法对接收码序列按不同长度进行分段,对分段码字进行有限域上的傅里叶变换并计算其频谱的累积量。通过频谱累积量的不同分布情况,可以估计出正确的分组码长度。同时从频谱累积量中找出码字生成多项式的根,进而得到码字的生成多项式。仿真实验验证了算法的有效性,并对算法的误码适应能力和计算复杂度进行了仿真分析,最后给出了在不同误码环境下最优的频谱累积次数。
