DHT of length p<sup>l</sup>q（p is odd and q is arbitrary） is turned into p<sup>l</sup> DHTs of length qand some additional operations, while the additional operations only involves the comput...DHT of length p<sup>l</sup>q（p is odd and q is arbitrary） is turned into p<sup>l</sup> DHTs of length qand some additional operations, while the additional operations only involves the computation ofcos-DFT and sin-DFT with length p. If the length of a DHT is p<sub>1</sub><sup>l<sub>1</sub></sup>…P<sub>N</sub><sup>l<sub>N</sub></sup>2<sup>l</sup>（P<sub>1</sub>…,P<sub>N</sub> are oddprimes）, a fast algorithm is obtained by the similar recursive technique. Therefore, the algorithmcan compute DHT of arbitrary length. The paper also Proves that operations for computingDHT of length N by the algorithm are no more than O（Nlog<sub>2</sub>N）, when the length is N=p<sup>l</sup>,operations of the algorithm are fewer than that of other known algorithms.展开更多
针对光OFDM系统存在高峰均功率比(PAPR),提出了一种基于离散哈特利变换(DHT)的选择映射抑制算法。采用快速哈特利逆变换(IFHT)代替传统的快速傅立叶逆变换(IFFT)和Hermi t i an对称算法,并结合非对称限幅法产生满足光OFDM系统要求的正...针对光OFDM系统存在高峰均功率比(PAPR),提出了一种基于离散哈特利变换(DHT)的选择映射抑制算法。采用快速哈特利逆变换(IFHT)代替传统的快速傅立叶逆变换(IFFT)和Hermi t i an对称算法,并结合非对称限幅法产生满足光OFDM系统要求的正、实值信号送入光纤信道。展开更多
文摘DHT of length p<sup>l</sup>q（p is odd and q is arbitrary） is turned into p<sup>l</sup> DHTs of length qand some additional operations, while the additional operations only involves the computation ofcos-DFT and sin-DFT with length p. If the length of a DHT is p<sub>1</sub><sup>l<sub>1</sub></sup>…P<sub>N</sub><sup>l<sub>N</sub></sup>2<sup>l</sup>（P<sub>1</sub>…,P<sub>N</sub> are oddprimes）, a fast algorithm is obtained by the similar recursive technique. Therefore, the algorithmcan compute DHT of arbitrary length. The paper also Proves that operations for computingDHT of length N by the algorithm are no more than O（Nlog<sub>2</sub>N）, when the length is N=p<sup>l</sup>,operations of the algorithm are fewer than that of other known algorithms.
