首页> 外文会议>IEEE Wireless Communications and Networking Conference >A New Construction of Golay Complementary Sets of Non-Power-of-Two Length Based on Boolean Functions
【24h】

A New Construction of Golay Complementary Sets of Non-Power-of-Two Length Based on Boolean Functions

机译:基于布尔函数的非二乘幂长度的Golay互补集的新构造

获取原文

摘要

Golay complementary sets have found many applications in communications, e.g., they have been proposed to control the high peak-to-average power ratio (PAPR) of orthogonal frequency division multiplexing (OFDM) signals. The relationship between Golay complementary sets and generalized Reed-Muller codes have been proposed to construct Golay complementary sets of length 2^m based on generalized Boolean functions. However, the number of used subcarriers is usually non-power-of-two in practical wireless OFDM-based communication systems. In this paper, a new construction of Golay complementary sets of length not equal to 2^m based on generalized Boolean functions is proposed. The constructed Golay complementary sets exist for various lengths not equal to 2^m and have PAPRs upper bounded by the set size.
机译:Golay互补集已经在通信中找到了许多应用,例如,已经提出了它们用于控制正交频分复用(OFDM)信号的高峰均功率比(PAPR)。提出了Golay互补集和广义Reed-Muller码之间的关系,以基于广义布尔函数构造长度为2 ^ m的Golay互补集。然而,在实际的基于无线OFDM的通信系统中,所使用的子载波的数量通常不是二的幂。本文提出了一种基于广义布尔函数的长度不等于2 ^ m的Golay互补集的新构造。构造的Golay互补集存在各种长度(不等于2 ^ m),并且PAPR的上限由集合大小限制。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号