Binary Orthogonal Code Generation for Multi-User Communication Using n-Bit Gray and Inverse Gray Codes
Binary Orthogonal Code Generation for Multi-User Communication Using n-Bit Gray and Inverse Gray Codes
复制标题
使用 n 位格雷码和反格雷码生成多用户通信的二进制正交码
DOI：
--
复制
发表时间：
2012
期刊：
影响因子：
--
通讯作者：
K. J. Sankar
中科院分区：
文献类型：
--
作者：
K. Usha;K. J. Sankar
本文提出了一种使用格雷码和反格雷码生成二进制正交码的技术。正交码和伪随机噪声码被用作多用户通信中的扩频序列。扩频码也称为扩频序列。沃尔什码、黄金码、最大长度序列、巴克码和卡萨米码是常用的正交码。本文提出了利用格雷码及其逆得到的正交码。 n 位循环格雷码是所有 2 n 位串的循环列表，使得连续的码字仅在一位位置上不同。 “n”位逆格雷码的定义与格雷码完全相反，它是每个长度为“n”的所有 2 n 位字符串的循环列表，使得连续的码字在 (n-1) 位位置上不同。本文讨论的用于生成格雷码和反格雷码的算法结果为 n！组合。本文中解释的方法使我们能够生成六位和八位长度的二进制正交码以及其偶数倍长度的代码。当前的工作中还介绍了这些代码以及 8、16 长度沃尔什代码的自相关和互相关属性。
This paper presents a technique for the generation of Binary Orthogonal Codes using Gray and Inverse Gray codes. Orthogonal codes and Pseudo random Noise codes are used as spreading sequences in multi-user communications. The Spreading codes are also referred to as spreading sequences. Walsh Codes, Gold Codes, Maximal Length sequences, Barker Codes and Kasami codes are commonly used orthogonal codes. In this paper orthogonal codes obtained using Gray code and its inverse are presented. An n-bit Cyclic Gray Code is a circular list of all 2 n bit strings such that successive code words differ in only one bit position. An 'n' bit Inverse Gray Code , is defined exactly opposite to Gray code, it is a circular list of all 2 n bit strings of length 'n' each, such that successive code words differ in (n-1) bit positions. Algorithms discussed in this paper for the generation of Gray and Inverse Gray codes result in n! combinations. The method explained in this paper enables us to generate six and eight length Binary Orthogonal Codes and also Codes of lengths of their even multiples. The auto and cross correlation properties of these codes along with 8, 16-length Walsh Codes are also presented in the current work.