共查询到20条相似文献,搜索用时 0 毫秒
1.
2.
《IEEE transactions on information theory / Professional Technical Group on Information Theory》2009,55(3):977-996
3.
It is shown that a convolutional code can be decoded with a sliding-block decoder, a time-invariant nonlinear digital filter with finite memory and delay. If the memory and delay are small, then the sliding-block decoder can be implemented as a table lookup procedure in ROM, resulting in a low cost, high speed, and high reliability decoder. 相似文献
4.
《IEEE transactions on information theory / Professional Technical Group on Information Theory》2005,51(9):3209-3220
This paper describes the design and analysis of low-density parity-check (LDPC) codes over rings and shows how these codes, when mapped onto appropriate signal constellations, can be used to effect bandwidth-efficient modulation. Specifically, LDPC codes are constructed over the integer rings$BBZ_m$ and$BBG_m^2$ and mapped onto phase-shift keying (PSK)-type signal sets to yield geometrically uniform signal space codes. This paper identifies and addresses the design issues that affect code performance. Examples of codes over$BBZ_8$ and$BBG_64$ mapped onto$8$ -ary and$64$ -ary signal sets at a spectral efficiency of 1.5 and 2.0 bits per second per hertz (b/s/Hz) illustrate the approach; simulation of these codes over the additive white Gaussian noise (AWGN) channel demonstrates that this approach is a good alternative to bandwidth-efficient techniques based on binary LDPC codes—e.g., bit-interleaved coded modulation. 相似文献
5.
介绍了正交空时分组码的模型,自干扰,性能;并由此提出了一种高速率准正交空时分组码的闭环模式,保证MIMO系统获得较高的速率,同时减少由于正交性减弱而引起的性能下降.其中反馈的方法就是根据发射端能够获得部分信道状态信息而提出的,这种自适应模式的性能在瑞利衰落信道下通过仿真得到了验证. 相似文献
6.
As the basis for secure public-key encryption under various cases, the learning with errors (LWE) problem has proved to be versatile for encryption schemes. Unfortunately, it tends not to be efficient enough for practical applications. For improving the efficiency issues and quickening the practical applications of the lattice-based public-key cryptosystems, an efficient homomorphic encryption scheme is presented in this paper, which is based on the learning with errors over rings (R-LWE) assumption, and its security is reducible to the hardness of the shortest vector problem in the worst case on ideal lattices. Furthermore, the scheme possesses homomorphism feature that encryption operations are consistent with message operations. The security analysis shows that the proposed encryption scheme is secure against chosen-plaintext attacks in the standard model. At the same time, the efficiency analysis and simulation results indicate that the scheme is much more efficient than previous lattice-based cryptosystems. 相似文献
7.
介绍了神经网络与线性分组码之间的关系,并在文献[1]的基础上证明了软判决译码与求解能量函数最大值之间的等价性,然后以(7,4,3)汉明码为例介绍了神经网络在循环码硬判决、软判决译码中的应用。 相似文献
8.
9.
Sole P. Sison V. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》2007,53(6):2270-2273
In this correspondence, bounds are derived on the minimum homogeneous distance of the image of a linear block code over the Galois ring GR(pr,m), with respect to any basis of GR(pr,m). These bounds depend on the parameters of GR(pr ,m), the minimum Hamming distance of the block code, and the average value of the homogeneous weight applied on the base ring Zopf p r. Examples are given of Galois ring codes that meet these bounds 相似文献
10.
《IEEE transactions on information theory / Professional Technical Group on Information Theory》2008,54(3):1061-1072
11.
The common subexpression elimination (CSE) method has been applied to reduce the computational cost of the parallel syndrome generators, which are essential components for decoding of linear block codes. In this work, we present an alternative expression for the parallel syndrome generation formula, with which CSE is able to search redundant computations in a maximally expanded space to achieve a significantly higher optimization efficiency. In particular, two search space expansion schemes are studied for syndrome generators of BCH and RS codes. Experiments demonstrate at most 81 % of area savings using the proposed optimization schemes, and the post-layout results show the power saving of 41 ~ 45 % compared to a straightforward design. 相似文献
12.
空时分组码能够实现MIMO系统的完全发射分集,但不能实现任何的编码增益.对此,提出了线性分组码与空时分组码级联的MIMO系统,该系统能够同时实现完全发射分集和编码增益.仿真结果表明,在比特误码率为10-5时,与未进行前向纠错的空时分组码系统相比,该系统能提供了大约2.7dB的编码增益. 相似文献
13.
数字信号在传输过程中受到干扰的影响,降低了其传输的可靠性,线性分组码作为一种常用的信道编码,在通信传输系统中应用广泛。在对线性分组码的编译码规则研究基础上,讨论了生成矩阵、监督矩阵与错误图样集之间的关系,在Max+PlusⅡ开发环境中,用VHDL语言设计线性分组码编译码器,对其各项设计功能进行了仿真和验证。结果表明,该设计正确,其功能符合线性分组码编译码器的要求。 相似文献
14.
Martinez C. Beivide R. Gabidulin E.M. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》2009,55(8):3552-3562
The search for perfect error-correcting codes has received intense interest since the seminal work by Hamming. Decades ago, Golomb and Welch studied perfect codes for the Lee metric in multidimensional torus constellations. In this work, we focus our attention on a new class of four-dimensional signal spaces which include tori as subcases. Our constellations are modeled by means of Cayley graphs defined over quotient rings of Lipschitz integers. Previously unexplored perfect codes of length one will be provided in a constructive way by solving a typical problem of vertices domination in graph theory. The codewords of such perfect codes are constituted by the elements of a principal (left) ideal of the considered quotient ring. The generalization of these techniques for higher dimensional spaces is also considered in this work by modeling their signal sets through Cayley-Dickson algebras. 相似文献
15.
ARQ methods of error control can considerably improve the reliablity of data transmission in such areas as satellite communications, computer networks, etc. A number of ARQ schemes using both block and convolutional codes have appeared in the literature. In this paper, the following problem is addressed. Given two different implementations of an ARQ scheme, one using a block code and the other using a convolutional code, such that the bit error probability of both implementations does not exceed some specific value, which implementation has the higher throughput and under what conditions will it be attained? The comparison is made for three basic retransmission schemes using both hybrid and pure ARQ: stop-and-wait, go-back-N , and selective repeat. Numerical estimates of the throughput were obtained using approximate theoretical expressions for BCH codes and simulation results for sequential decoding of rate 1/2 convolutional codes. Parameters optimizing the performance of both block and convolutional codes for different channel conditions and round trip delays were found and were used to obtain these numerical estimates. Comparison of the quantitative results indicates a trend toward preferring convolutional codes as delay and/or block length increases. A binary symmetric channel with noiseless feedback was assumed. Possible implications for the Gaussian channel are also discussed. 相似文献
16.
17.
针对纠正两个随机错误的线性分组码,采用重复查表译码法,通过多次查询含一个错误的伴随式与错误图样的译码表,实现了一种占有很少存储空间的查表译码算法。该算法在码长较短时译码的计算量较少,可适用于利用单片机等低运算能力情况下的通信应用中。文中对纠正2个错误的(26,16)缩短循环码的译码进行了实现,验证了算法的可行性。 相似文献
18.
两类新的线性分组码的译码 总被引:1,自引:0,他引:1
本文推广了Pless由四元线性分组码构造Golay码和由三元(4,2,3)线性分组码构造三元(12,6,6)Golay码的投影方法,给出了由四元(n,k,d)线性分组码构造的二元(4n,n+2k,≥min(8,n,2d)线性分组码和由三元(n,k,d)线性分组码构造的三元(3n,n+k,≥min(n,2d,6)线性分组码,并根据所得码的结构给出了有效的最大似然译码算法。 相似文献
19.
The coding gain of linear binary block codes on the AWGN channel is studied. Antipodal signaling and hard decision demodulation are assumed. Simple asymptotic expressions for the gain at high and low energy to noise spectral density ratios are derived. Monotonicity of the coding gain is also discussed. 相似文献
20.
低码率二进制线性分组码的盲识别 总被引:5,自引:0,他引:5
针对信息截获领域中的低码率二进制分组码的盲识别问题,提出了根据码重分布距离估计码长的方法,进而通过改进传统的矩阵化简方法获得生成矩阵,实现了对低码率二进制线性分组码的盲识别。理论推算和数据仿真都表明,本算法在较高误码率的情况下,也可以得到很好的识别效果。 相似文献