首页> 外文会议>2012 International Symposium on Information Theory and its Applications. >Fourier analysis of sequences over a composition algebra of the real number field
【24h】

Fourier analysis of sequences over a composition algebra of the real number field

机译:实数场的合成代数上的序列的傅立叶分析

获取原文
获取原文并翻译 | 示例

摘要

To analyze the structure of a set of perfect sequences over a composition algebra of the real number field, transforms of a set of sequences similar to DFT (discrete Fourier transform) are introduced. Discrete cosine transform, discrete sine transform and generalized discrete Fourier transform (GDFT) of the sequences are defined and the fundamental properties of these transforms are proved. We show that GDFT is bijective and that there exists a relationship between these transforms and a convolution of sequences. Applying these properties to the set of perfect sequences, a parameterization theorem of such sequences is obtained.
机译:为了在实数域的组成代数上分析一组完美序列的结构,引入了类似于DFT的一组序列的变换(离散傅里叶变换)。定义了序列的离散余弦变换,离散正弦变换和广义离散傅里叶变换(GDFT),并证明了这些变换的基本性质。我们表明GDFT是双射的,并且在这些变换和序列卷积之间存在关系。将这些属性应用于一组理想序列,即可获得此类序列的参数化定理。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号