期刊文献+
共找到1,599篇文章
< 1 2 80 >
每页显示 20 50 100
Construction of LDPC Codes for the Layered Decoding Algorithm 被引量:4
1
作者 Wang Da Dong Mingke +2 位作者 Chen Chen Jin Ye Xiang Haige 《China Communications》 SCIE CSCD 2012年第7期99-107,共9页
Abstract: The layered decoding algorithm has been widely used in the implementation of Low Density Parity Check (LDPC) decoders, due to its high convergence speed. However, the pipeline operation of the layered dec... Abstract: The layered decoding algorithm has been widely used in the implementation of Low Density Parity Check (LDPC) decoders, due to its high convergence speed. However, the pipeline operation of the layered decoder may introduce memory access conflicts, which heavily deteriorates the decoder throughput. To essentially deal with the issue of memory access conflicts, 展开更多
关键词 LDPC codes construction algorithm PEG algorithm layered decoding algorithm memory access conflicts
在线阅读 下载PDF
Jointly-check iterative decoding algorithm for quantum sparse graph codes 被引量:1
2
作者 邵军虎 白宝明 +1 位作者 林伟 周林 《Chinese Physics B》 SCIE EI CAS CSCD 2010年第8期116-122,共7页
For quantum sparse graph codes with stabilizer formalism, the unavoidable girth-four cycles in their Tanner graphs greatly degrade the iterative decoding performance with standard belief-propagation (BP) algorithm. ... For quantum sparse graph codes with stabilizer formalism, the unavoidable girth-four cycles in their Tanner graphs greatly degrade the iterative decoding performance with standard belief-propagation (BP) algorithm. In this paper, we present a jointly-check iterative algorithm suitable for decoding quantum sparse graph codes efficiently. Numerical simulations show that this modified method outperforms standard BP algorithm with an obvious performance improvement. 展开更多
关键词 quantum error correction sparse graph code iterative decoding belief-propagation algorithm
在线阅读 下载PDF
Adaptive Decoding Algorithm Based on Multiplicity of Candidate Sequences for Block Turbo Codes
3
作者 DANG Xiaoyu TAN Min YU Xiangbin 《China Communications》 SCIE CSCD 2014年第A01期9-15,共7页
It is known that Block Turbo Codes (BTC) can be nearly optimally decoded by Chase-II algorithm, in which the Least Reliable Bits (LRBs) are chosen empirically to keep the size of the test patterns (sequences) re... It is known that Block Turbo Codes (BTC) can be nearly optimally decoded by Chase-II algorithm, in which the Least Reliable Bits (LRBs) are chosen empirically to keep the size of the test patterns (sequences) relatively small and to reduce the decoding complexity. While there are also other adaptive techniques, where the decoder's LRBs adapt to the external parameter of the decoder like SNR (Signal Noise Ratio) level, a novel adaptive algorithm for BTC based on the statistics of an internal variable of the decoder itself is proposed in this paper. Different from the previous reported results, it collects the statistics of the multiplicity of the candidate sequences, i.e., the number of the same candidate sequences with the same minimum squared Euclidean distance resulted from the decoding of test sequences. It is shown by Monte Carlo simulations that the proposed adaptive algorithm has only about 0.02dB coding loss but the average complexity of the proposed algorithm is about 42% less compared with Pyndiah's iterative decoding algorithm using the fixed LRBs parameter. 展开更多
关键词 block turbo codes adaptive algorithm least reliable bits bit error rate (BER) complexity
在线阅读 下载PDF
Technique of Error Concealment for Block-Based Image Coding Using Genetic Algorithm
4
作者 杨守义 罗伟雄 《Journal of Beijing Institute of Technology》 EI CAS 2002年第2期164-168,共5页
Since real world communication channels are not error free, the coded data transmitted on them may be corrupted, and block based image coding systems are vulnerable to transmission impairment. So the best neighborh... Since real world communication channels are not error free, the coded data transmitted on them may be corrupted, and block based image coding systems are vulnerable to transmission impairment. So the best neighborhood match method using genetic algorithm is used to conceal the error blocks. Experimental results show that the searching space can be greatly reduced by using genetic algorithm compared with exhaustive searching method, and good image quality is achieved. The peak signal noise ratios(PSNRs) of the restored images are increased greatly. 展开更多
关键词 block based image coding genetic algorithm error concealment
在线阅读 下载PDF
PERFORMANCE OF SIMPLE-ENCODING IRREGULAR LDPC CODES BASED ON SPARSE GENERATOR MATRIX
5
作者 唐蕾 仰枫帆 《Transactions of Nanjing University of Aeronautics and Astronautics》 EI 2006年第3期202-207,共6页
A new method for the construction of the high performance systematic irregular low-density paritycheck (LDPC) codes based on the sparse generator matrix (G-LDPC) is introduced. The code can greatly reduce the enco... A new method for the construction of the high performance systematic irregular low-density paritycheck (LDPC) codes based on the sparse generator matrix (G-LDPC) is introduced. The code can greatly reduce the encoding complexity while maintaining the same decoding complexity as traditional regular LDPC (H-LDPC) codes defined by the sparse parity check matrix. Simulation results show that the performance of the proposed irregular LDPC codes can offer significant gains over traditional LDPC codes in low SNRs with a few decoding iterations over an additive white Gaussian noise (AWGN) channel. 展开更多
关键词 belief propagation iterative decoding algorithm sparse parity-check matrix sparse generator matrix H LDPC codes G-LDPC codes
在线阅读 下载PDF
Improved Reduced Latency Soft-Cancellation Algorithm for Polar Decoding 被引量:2
6
作者 Xiumin Wang Rui Gu +1 位作者 Jun Li Qiangqiang Ma 《China Communications》 SCIE CSCD 2020年第5期65-77,共13页
Soft-cancellation(SCAN) is a soft output iterative algorithm widely used in polar decoding. This algorithm has better decoding performance than reduced latency soft-cancellation(RLSC) algorithm, which can effectively ... Soft-cancellation(SCAN) is a soft output iterative algorithm widely used in polar decoding. This algorithm has better decoding performance than reduced latency soft-cancellation(RLSC) algorithm, which can effectively reduce the decoding delay of SCAN algorithm by 50% but has obvious performance loss. A modified reduced latency soft-cancellation(MRLSC) algorithm is presented in the paper. Compared with RLSC algorithm, LLR information storage required in MRLSC algorithm can be reduced by about 50%, and better decoding performance can be achieved with only a small increase in decoding delay. The simulation results show that MRLSC algorithm can achieve a maximum block error rate(BLER) performance gain of about 0.4 dB compared with RLSC algorithm when code length is 2048. At the same time, compared with the performance of several other algorithms under(1024, 512) polar codes, the results show that the throughput of proposed MRLSC algorithm has the advantage at the low and medium signal-to-noise ratio(SNR) and better BLER performance at the high SNR. 展开更多
关键词 polar codes belief propagation SCAN algorithm RLSC algorithm ITERATION
在线阅读 下载PDF
Improved Adaptive Random Convolutional Network Coding Algorithm 被引量:2
7
作者 Guo Wangmei Cai Ning Wang Xiao 《China Communications》 SCIE CSCD 2012年第11期63-69,共7页
To address the issue of field size in random network coding, we propose an Improved Adaptive Random Convolutional Network Coding (IARCNC) algorithm to considerably reduce the amount of occupied memory. The operation o... To address the issue of field size in random network coding, we propose an Improved Adaptive Random Convolutional Network Coding (IARCNC) algorithm to considerably reduce the amount of occupied memory. The operation of IARCNC is similar to that of Adaptive Random Convolutional Network Coding (ARCNC), with the coefficients of local encoding kernels chosen uniformly at random over a small finite field. The difference is that the length of the local encoding kernels at the nodes used by IARCNC is constrained by the depth; meanwhile, increases until all the related sink nodes can be decoded. This restriction can make the code length distribution more reasonable. Therefore, IARCNC retains the advantages of ARCNC, such as a small decoding delay and partial adaptation to an unknown topology without an early estimation of the field size. In addition, it has its own advantage, that is, a higher reduction in memory use. The simulation and the example show the effectiveness of the proposed algorithm. 展开更多
关键词 convolutional network coding adaptive network coding algorithm random coding
在线阅读 下载PDF
A Novel Method for Identifying Recursive Systematic Convolutional Encoders Based on the Cuckoo Search Algorithm 被引量:1
8
作者 Shunan Han Peng Liu Guang Huang 《China Communications》 SCIE CSCD 2022年第12期64-72,共9页
The existing methods for identifying recursive systematic convolutional encoders with high robustness require to test all the candidate generator matrixes in the search space exhaustively.With the increase of the code... The existing methods for identifying recursive systematic convolutional encoders with high robustness require to test all the candidate generator matrixes in the search space exhaustively.With the increase of the codeword length and constraint length,the search space expands exponentially,and thus it limits the application of these methods in practice.To overcome the limitation,a novel identification method,which gets rid of exhaustive test,is proposed based on the cuckoo search algorithm by using soft-decision data.Firstly,by using soft-decision data,the probability that a parity check equation holds is derived.Thus,solving the parity check equations is converted to maximize the joint probability that parity check equations hold.Secondly,based on the standard cuckoo search algorithm,the established cost function is optimized.According to the final solution of the optimization problem,the generator matrix of recursive systematic convolutional code is estimated.Compared with the existing methods,our proposed method does not need to search for the generator matrix exhaustively and has high robustness.Additionally,it does not require the prior knowledge of the constraint length and is applicable in any modulation type. 展开更多
关键词 RSC code blind identification softdecision cuckoo search algorithm
在线阅读 下载PDF
Low-Complexity Detection and Decoding Scheme for LDPC-Coded MLC NAND Flash Memory 被引量:1
9
作者 Xusheng Lin Guojun Han +2 位作者 Shijie Ouyang Yanfu Li Yi Fang 《China Communications》 SCIE CSCD 2018年第6期58-67,共10页
With the development of manufacture technology, the multi-level cell(MLC)technique dramatically increases the storage density of NAND flash memory. As the result,cell-to-cell interference(CCI) becomes more serious and... With the development of manufacture technology, the multi-level cell(MLC)technique dramatically increases the storage density of NAND flash memory. As the result,cell-to-cell interference(CCI) becomes more serious and hence causes an increase in the raw bit error rate of data stored in the cells.Recently, low-density parity-check(LDPC)codes have appeared to be a promising solution to combat the interference of MLC NAND flash memory. However, the decoding complexity of the sum-product algorithm(SPA) is extremely high. In this paper, to improve the accuracy of the log likelihood ratio(LLR) information of each bit in each NAND flash memory cell, we adopt a non-uniform detection(N-UD) which uses the average maximum mutual information to determine the value of the soft-decision reference voltages.Furthermore, with an aim to reduce the decoding complexity and improve the decoding performance, we propose a modified soft reliabilitybased iterative majority-logic decoding(MSRBI-MLGD) algorithm, which uses a non-uniform quantizer based on power function to decode LDPC codes. Simulation results show that our design can offer a desirable trade-off between the performance and complexity for high-column-weight LDPC-coded MLC NAND flash memory. 展开更多
关键词 Cell-to-cell interference(CCI) LDPC codes MLC NAND flash memory non-uniform detection(N-UD) modified soft reliability-based iterative majority-logic decoding(MSRBI-MLGD) algorithm
在线阅读 下载PDF
Genetic Searching Algorithm for Optimal Runlength-Limited Codes with Error Control 被引量:5
10
作者 RenQingsheng YeZhongxing 《通信学报》 EI CSCD 北大核心 1997年第3期54-59,共6页
GeneticSearchingAlgorithmforOptimalRunlength┐LimitedCodeswithErrorControl**ThisworkwassupportedbytheChineseK... GeneticSearchingAlgorithmforOptimalRunlength┐LimitedCodeswithErrorControl**ThisworkwassupportedbytheChineseKeyProjectofFundam... 展开更多
关键词 基因算法 分组码 信号处理
在线阅读 下载PDF
Pseudo-Random Coding Side-Lobe Suppression Method Based on CLEAN Algorithm
11
作者 Liyu Tian Lianjuan Zhang Jiaying Li 《Journal of Beijing Institute of Technology》 EI CAS 2017年第3期375-380,共6页
A pseudo-random coding side-lobe suppression method based on CLEAN algorithm is introduced.The CLEAN algorithm mainly processes pulse compression results of a pseudo-random coding,and estimates a target's distance by... A pseudo-random coding side-lobe suppression method based on CLEAN algorithm is introduced.The CLEAN algorithm mainly processes pulse compression results of a pseudo-random coding,and estimates a target's distance by a method named interpolation method,so that we can get an ideal pulse compression result of the target,and then use the adjusted ideal pulse compression side-lobe to cut the actual pulse compression result,so as to achieve the remarkable performance of side-lobe suppression for large targets,and let the adjacent small targets appear.The computer simulations by MATLAB with this method analyze the effect of side-lobe suppression in an ideal or noisy environment.It is proved that this method can effectively solve the problem due to the side-lobe of pseudo-random coding being too high,and can enhance the radar's multi-target detection ability. 展开更多
关键词 CLEAN algorithm pseudo-random coding pulse compression interpolation method
在线阅读 下载PDF
Efficient Lubytransform encodingalgorithm based on short cycle elimination
12
作者 曹聪哲 费泽松 匡镜明 《Journal of Beijing Institute of Technology》 EI CAS 2014年第3期407-412,共6页
An effective Luby transform (LT) encoding algorithm based on short cycle elimination is proposed to improve decoding probabilities of short length LT codes. By searching the generator ma- trix, some special encoded ... An effective Luby transform (LT) encoding algorithm based on short cycle elimination is proposed to improve decoding probabilities of short length LT codes. By searching the generator ma- trix, some special encoded symbols are generated by the encoder to effectively break the short cycles that have negative effect on the performance of LT codes. Analysis and numerical results show that by employing the proposed algorithm, the encoding complexity decreases and the decoding probabili- ties improve both in binary erasure channels (BECs) and additive white gauss noise (AWGN) chan- nels. 展开更多
关键词 Luby transform (LT) codes short cycle encoding algorithm
在线阅读 下载PDF
An MMSE Decoding Algorithm without Matrix Inversion in QSTBC 被引量:1
13
作者 刘于 何子述 《Journal of Electronic Science and Technology of China》 2005年第4期325-327,共3页
The matrix inversion operation is needed in the MMSE decoding algorithm of orthogonal space-time block coding (OSTBC) proposed by Papadias and Foschini. In this paper, an minimum mean square error (MMSE) decoding ... The matrix inversion operation is needed in the MMSE decoding algorithm of orthogonal space-time block coding (OSTBC) proposed by Papadias and Foschini. In this paper, an minimum mean square error (MMSE) decoding algorithm without matrix inversion is proposed, by which the computational complexity can be reduced directly but the decoding performance is not affected. 展开更多
关键词 quasi-orthogonal space-time block coding (QSTBC) multiple input multiple output (MIMO) channel minimum mean square error (MMSE) decoding algorithm
在线阅读 下载PDF
Image encryption algorithm based on multiple chaotic systems and improved Joseph block scrambling
14
作者 Dingkang Mou Yumin Dong 《Chinese Physics B》 SCIE EI CAS CSCD 2024年第10期248-257,共10页
With the rapid development of digital information technology,images are increasingly used in various fields.To ensure the security of image data,prevent unauthorized tampering and leakage,maintain personal privacy,and... With the rapid development of digital information technology,images are increasingly used in various fields.To ensure the security of image data,prevent unauthorized tampering and leakage,maintain personal privacy,and protect intellectual property rights,this study proposes an innovative color image encryption algorithm.Initially,the Mersenne Twister algorithm is utilized to generate high-quality pseudo-random numbers,establishing a robust basis for subsequent operations.Subsequently,two distinct chaotic systems,the autonomous non-Hamiltonian chaotic system and the tentlogistic-cosine chaotic mapping,are employed to produce chaotic random sequences.These chaotic sequences are used to control the encoding and decoding process of the DNA,effectively scrambling the image pixels.Furthermore,the complexity of the encryption process is enhanced through improved Joseph block scrambling.Thorough experimental verification,research,and analysis,the average value of the information entropy test data reaches as high as 7.999.Additionally,the average value of the number of pixels change rate(NPCR)test data is 99.6101%,which closely approaches the ideal value of 99.6094%.This algorithm not only guarantees image quality but also substantially raises the difficulty of decryption. 展开更多
关键词 mersenne twister algorithm DNA coding confusion pixel XOR operation improved Joseph block scrambling
在线阅读 下载PDF
一种基于链码的农村公路线形比对与筛选算法
15
作者 范文涛 孙翠羽 +2 位作者 崔应寿 刘柳杨 龙佳宁 《交通运输研究》 2025年第1期102-110,共9页
为提升农村公路电子地图数据校核的效率和精确性,提出一种基于链码技术的农村公路线形比对与筛选算法模型。首先,引入链码技术对农村公路电子地图中的路线进行识别和提取,获得路线的起点、拐点及方向变化等线形特征信息,并实现不同地理... 为提升农村公路电子地图数据校核的效率和精确性,提出一种基于链码技术的农村公路线形比对与筛选算法模型。首先,引入链码技术对农村公路电子地图中的路线进行识别和提取,获得路线的起点、拐点及方向变化等线形特征信息,并实现不同地理区域和时间维度下的路线线形链码特征信息的精确匹配。其次,选取我国东部、中部、西部区域中典型区县的2022及2023年农村公路线形数据,对算法模型进行训练,得出路线线形链码差异的不同参数阈值;对于超出阈值的农村公路路线数据,再运用卷积神经网络算法从遥感影像中提取路线线形并获取线形链码特征信息进行比对筛选以及影像评价。最后,将该算法应用于2023年度全国农村公路电子地图中459.9万km的路线数据进行解算验证。结果表明,与传统“全重叠”方法相比,该算法效率提升了72.1%,识别率从64.5%提升至90.6%,准确率从95.7%提升到97.3%。研究证明,该算法显著提高了电子地图线形数据处理的效率和准确率,可为农村公路基础数据入库提供技术支撑,提升农村公路数字化发展水平。 展开更多
关键词 链码算法 线形比对 农村公路 遥感影像 卷积神经网络
在线阅读 下载PDF
基于帧时隙ALOHA的物联网RFID广播信道防碰撞算法研究
16
作者 曾凤生 李影 《吉林大学学报(信息科学版)》 2025年第1期8-13,共6页
针对射频识别(RFID:Radio Frequency Identification)系统的信道资源有限,当多个标签竞争同一个频率或时间槽时,会导致发生碰撞和冲突的问题,为优化广播信道的通信效率,对基于帧时隙ALOHA的物联网RFID广播信道防碰撞算法进行了研究。该... 针对射频识别(RFID:Radio Frequency Identification)系统的信道资源有限,当多个标签竞争同一个频率或时间槽时,会导致发生碰撞和冲突的问题,为优化广播信道的通信效率,对基于帧时隙ALOHA的物联网RFID广播信道防碰撞算法进行了研究。该方法引入帧时隙概念,对通信时间进行时间段划分;通过时隙内空闲、成功识别以及碰撞3种状态的发生概率分析,得到广播信道内的碰撞原因。结合贝叶斯算法与泊松分布规则,通过标签数目概率分布计算,实现读写器作用范围内标签数量的估计,并根据标签数量计算结果调整下一帧帧长。若调整后的帧时隙范围内仍存在标签碰撞问题,则通过FastICA(Indcpendent Component Analysis)独立主成分分析法,将帧时隙内的标签识别问题,转化为EPC(Electronic Product Code)编码生成问题,进而实现统一时隙内多标签的并行识别,避免发生碰撞。实验表明,所提方的标签数量的估算准确,能在保证通信信道稳定性的前提下,提高时隙内标签识别率,有效提高广播信道的传播效率。 展开更多
关键词 贝叶斯算法 泊松分布规则 FastICA独立主成分分析法 EPC编码
在线阅读 下载PDF
采用改进编码遗传算法的空间桁架阻尼杆配置优化
17
作者 董治成 苗雪阳 +3 位作者 张梅升 姜东 张大海 费庆国 《宇航学报》 北大核心 2025年第1期181-192,共12页
为最大化发挥阻尼杆在桁架减振中的作用,提出一种改进编码方式,依据桁架结构中杆的位置编码,改进了基本遗传算法的相关流程。进一步针对某实际空间桁架结构建立隔振器的力学模型,并以此建立安有隔振器的阻尼杆的等效力学模型和安有阻尼... 为最大化发挥阻尼杆在桁架减振中的作用,提出一种改进编码方式,依据桁架结构中杆的位置编码,改进了基本遗传算法的相关流程。进一步针对某实际空间桁架结构建立隔振器的力学模型,并以此建立安有隔振器的阻尼杆的等效力学模型和安有阻尼杆的空间桁架结构动力学模型。最后针对两种空间桁架模型,以最大化阻尼杆的减振效果为原则,利用仿真模型开展动力学响应求解和基于改进编码遗传算法的阻尼杆配置优化。结果显示,优化后目标位置的振幅均衰减80%以上,好于优化前的结果,并且算法相较于采用二进制编码的基本遗传算法,收敛速度和稳定性均得到提升。 展开更多
关键词 空间桁架 阻尼杆 改进编码 遗传算法 配置优化
在线阅读 下载PDF
面向特殊节点的低延时Polar码构造研究
18
作者 符川东 赵明敏 +2 位作者 李荣鹏 李旻 赵民建 《移动通信》 2025年第2期43-50,共8页
现有的Polar码构造研究主要集中在提升码序列的译码性能方面。然而,在基于特殊节点的快速译码器当中,码序列不仅影响译码性能,还通过决定特殊节点的分布影响译码时延。基于此,提出一种低时延码构造方案,通过优化特殊节点分布的方式降低... 现有的Polar码构造研究主要集中在提升码序列的译码性能方面。然而,在基于特殊节点的快速译码器当中,码序列不仅影响译码性能,还通过决定特殊节点的分布影响译码时延。基于此,提出一种低时延码构造方案,通过优化特殊节点分布的方式降低快速译码器的译码时延。所提出的方案基于遗传算法,采用了分步优化策略:先提升码序列的译码性能,再优化特殊节点分布以降低译码时延。仿真结果表明,与现有码序列相比,通过低时延码构造方案获得的码序列译码性能不退化,并且译码时延有了最大50%的降低。 展开更多
关键词 Polar码 码构造 特殊节点 低时延 遗传算法
在线阅读 下载PDF
基于改进RT-DETR的航拍图像小目标检测算法
19
作者 宣岁寒 罗印升 宋伟 《电光与控制》 北大核心 2025年第4期44-51,共8页
实时、准确地定位与识别航拍图像中飞机、轮船和车辆等目标是进一步决策的根本基础,针对航拍图像中小目标检测存在的效率和精度低等问题,提出了一种基于改进RT-DETR的航拍图像小目标检测算法。首先,通过构建高效的CCFM-P2ASF尺度序列特... 实时、准确地定位与识别航拍图像中飞机、轮船和车辆等目标是进一步决策的根本基础,针对航拍图像中小目标检测存在的效率和精度低等问题,提出了一种基于改进RT-DETR的航拍图像小目标检测算法。首先,通过构建高效的CCFM-P2ASF尺度序列特征融合模块,获得更丰富的语义信息,同时提高对小目标的敏感度;其次,集成灵活性更强的可学习的位置编码,提供更清晰的位置界定;然后,设计更高效的边界框损失函数,减小对目标位置预测的偏差,提供更准确的边界框信息;最后,构建EMA重参数响应模块,从而更有效地提取输入图像特征。实验结果表明:改进后的RT-DETR模型较原始模型参数量减少38.3%,精确率、mAP50和mAP50∶95指标分别提升5.1、5.0和2.2个百分点。对比其他同类主流算法模型,在航拍小目标检测任务中具有更好的检测效果。 展开更多
关键词 小目标检测 RT-DETR算法 特征融合 定位损失 位置编码
在线阅读 下载PDF
基于安全便捷加密芯片的加密通话系统设计
20
作者 林锭扬 梁梓辰 黄一平 《电子设计工程》 2025年第1期146-153,共8页
通过研究语音通话系统的安全现状及密钥存储安全性问题,该文设计了一种基于安全便捷加密芯片的加密通话系统。以自主可控的安全便捷加密芯片对密钥进行安全存储并实现加解密、加签验签等功能,通过安全中间件实现客户端与安全便捷加密芯... 通过研究语音通话系统的安全现状及密钥存储安全性问题,该文设计了一种基于安全便捷加密芯片的加密通话系统。以自主可控的安全便捷加密芯片对密钥进行安全存储并实现加解密、加签验签等功能,通过安全中间件实现客户端与安全便捷加密芯片之间的数据安全传输。该系统以PKI安全体系为设计核心,在语音加密过程,利用国密SM2算法,以数字信封的方式实现密钥同步;利用Opus编码算法先对音频数据进行压缩编码,减小传输带宽;利用密钥对编码后的音频数据进行SM4加密,实现密文传输,确保语音通话过程的实时性和安全性。通过性能测试和安全性分析结果可以看出,该系统在保证通话流畅的同时,大大提高了用户通话过程的安全性,具有较好的应用前景。 展开更多
关键词 安全便捷加密芯片 国密算法 安全中间件 Opus编码 语音加密
在线阅读 下载PDF
上一页 1 2 80 下一页 到第
使用帮助 返回顶部