HB of an order F Hadamard matrix and an order B Hadamard matrix, then transformation by HN may be implemented by a fast Hadamard transform at coarse scale followed by fast Hadamard transforms at fine scale. Alternatively, transformation by HN may be achieved by performing order B transforms on columns of a two-dimensional array and order B transforms on rows of the array. As another alternative, transformation by HN may be achieved by computing intermediate values based on linear combinations of input elements and then computing linear combinations of the intermediate values. For compressive signal acquisition, any row of HN may be generated by concatenating selectively modified copies of a corresponding row of HB. Thus, modulation patterns may be generated on the fly."/> Efficient transforms and efficient row generation for Kronecker products of Hadamard matrices
首页> 外国专利> Efficient transforms and efficient row generation for Kronecker products of Hadamard matrices

Efficient transforms and efficient row generation for Kronecker products of Hadamard matrices

机译:Hadamard矩阵的Kronecker积的高效转换和行生成

摘要

If a Hadamard matrix HN of order N=BF is a Kronecker product HFcustom characterHB of an order F Hadamard matrix and an order B Hadamard matrix, then transformation by HN may be implemented by a fast Hadamard transform at coarse scale followed by fast Hadamard transforms at fine scale. Alternatively, transformation by HN may be achieved by performing order B transforms on columns of a two-dimensional array and order B transforms on rows of the array. As another alternative, transformation by HN may be achieved by computing intermediate values based on linear combinations of input elements and then computing linear combinations of the intermediate values. For compressive signal acquisition, any row of HN may be generated by concatenating selectively modified copies of a corresponding row of HB. Thus, modulation patterns may be generated on the fly.
机译:如果顺序N = BF的Hadamard矩阵H N 是Kronecker乘积H F “自定义字符” H B 的一个F哈达玛矩阵和一个阶B Hadamard矩阵,然后通过H N 进行的变换可以通过在粗尺度上进行快速Hadamard变换,然后在细尺度上进行快速Hadamard变换来实现。或者,可以通过对二维数组的列执行B阶变换和对数组的行进行B阶变换来实现H N 的变换。作为另一种选择,可以通过基于输入元素的线性组合计算中间值,然后计算中间值的线性组合,来实现H N 的变换。对于压缩信号采集,可以通过将H B 对应行的选择性修改后的副本进行级联来生成H N 的任何行。因此,可以动态地生成调制模式。

著录项

  • 公开/公告号US9081731B2

    专利类型

  • 公开/公告日2015-07-14

    原文格式PDF

  • 申请/专利权人 INVIEW TECHNOLOGY CORPORATION;

    申请/专利号US201414169903

  • 发明设计人 TYLER H. WESTON;MATTHEW A. HERMAN;

    申请日2014-01-31

  • 分类号H04N19/112;G06F17/14;G06T9/00;G06T1/00;H04N5/232;

  • 国家 US

  • 入库时间 2022-08-21 15:21:06

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号