Computationally efficient methods for analysis and synthesis ofreal signals using FFT and IFFT

The discrete Fourier transform (DFT) and the inverse discrete Fourier transform (IDFT) are used in a wide variety of signal processing applications. Even with the increased speed of modern processors, there is an ongoing need to further develop more efficient methods for computing DFT and IDFT, with a particular effort to reduce the number of complex multiplications. The properties of certain complex sequences are extraordinarily useful in the sense that they lead to data manipulation schemes that result in the sequences to which traditional but much shorter fast Fourier transform (FFT) algorithms may be applied. This is achieved by exploiting a certain regularity in the complex data. The index-reversed complex conjugate sequence and the mirror symmetric complex conjugate sequence were defined. A significant reduction in the number of complex computations is achieved if a sequence in either domain exhibits such symmetry     

基于Intel AVX2的LTE DFT和IDFT快速算法

通用处理器（GPP,General Purpose Processor）技术的快速发展,为LTE基带信号实时处理提供了一条新的途径。在LTE系统中,DFT和IDFT分别是手机上行发送和基站上行接收中的重要模块。根据3GPP协议,LTE DFT和IDFT处理点数是复合数,文章通过混合基算法以取代直接计算算法,并充分利用GPP平台大存储量的优势及Intel AVX2指令进行并行计算能力,最终使得该算法实现平均每处理1点仅耗时2个cycles,接近FPGA硬件处理性能,满足了LTE系统的实时性要求。经验证,基于GPP平台的DFT和IDFT模块运行结果正确,并且耗时极短。     

The integer transforms analogous to discrete trigonometric transforms

The integer transform (such as the Walsh transform) is the discrete transform that all the entries of the transform matrix are integer. It is much easier to implement because the real number multiplication operations can be avoided, but the performance is usually worse. On the other hand, the noninteger transform, such as the DFT and DCT, has a good performance, but real number multiplication is required. W derive the integer transforms analogous to some popular noninteger transforms. These integer transforms retain most of the performance quality of the original transform, but the implementation is much simpler. Especially, for the two-dimensional (2-D) block transform in image/video, the saving can be huge using integer operations. In 1989, Cham had derived the integer cosine transform. Here, we will derive the integer sine, Hartley, and Fourier transforms. We also introduce the general method to derive the integer transform from some noninteger transform. Besides, the integer transform derived by Cham still requires real number multiplication for the inverse transform. We modify the integer transform introduced by Cham and introduce the complete integer transform. It requires no real number multiplication operation, no matter what the forward or inverse transform. The integer transform we derive would be more efficient than the original transform. For example, for the 8-point DFT and IDFT, there are in total four real numbers and eight fixed-point multiplication operations required, but for the forward and inverse 8-point complete integer Fourier transforms, there are totally 20 fixed-point multiplication operations required. However, for the integer transform, the implementation is simpler, and many of the properties of the original transform are kept.     

The generation of correlated Rayleigh random variates by inversediscrete Fourier transform

A number of different algorithms are used for the generation of correlated Rayleigh random variates. This paper presents an analysis of the statistical properties of methods based on the inverse discrete Fourier transform (IDFT). A modification of the algorithm of Smith (1975) is presented, the new method requiring exactly one-half the number of IDPT operations and roughly two-thirds the computer memory of the original method. Evaluations of and comparisons between various variate generation methods using meaningful quantitative measures are believed to be lacking. New quantitative quality measures for random variate generation have been proposed that are, in particular, meaningful and useful for digital communication system simulation. This paper presents the application of these measures to the IDFT method and three other methods of correlated variate generation, comparing the algorithms in terms of the quality of the generated samples and the required computational effort     

一种基于FGN和IDFT的自相似通信量生成算法

对网络模拟中必需的自相似通信量生成方法进行了研究,提出了一种基于分数高斯噪声(FGN,fractionalGaussiannoise)过程和逆离散傅立叶变换(IDFF,inversediscreteFouriertransform)的自相似通信量生成算法--FGN-IDFT算法,并通过仿真实验和比较分析的方法对该算法的精度和计算复杂度进行了大量的实验和分析。研究结果表明,利用FGN-IDFT算法生成的自相似通信量的精度和速度都令人满意,为实际网络模拟的进一步深入研究提供了基础。     

Interconnect Delay Fault Test on Boards and SoCs with Multiple Clock Domains

This paper introduces an interconnect delay fault test (IDFT) controller on boards and system‐on‐chips (SoCs) with IEEE 1149.1 and IEEE 1500 wrappers. By capturing the transition signals launched during one system clock, interconnect delay faults operated by different system clocks can be simultaneously tested with our technique. The proposed IDFT technique does not require any modification on boundary scan cells. Instead, a small number of logic gates needs to be plugged around the test access port controller. The IDFT controller is compatible with the IEEE 1149.1 and IEEE 1500 standards. The superiority of our approach is verified by implementation of the controller with benchmark SoCs with IEEE 1500 wrapped cores.     

Collision mitigation by log-likelihood ratio (LLR) conversion in orthogonal code-hopping multiplexing

Log-likelihood ratio (LLR) conversion schemes are proposed to mitigate the effect of collisions (or perforations) that occur in orthogonal code-hopping multiplexing (OCHM), which was previously proposed to accommodate more downlink channels than the number of orthogonal codewords. The proposed LLR conversion schemes greatly reduce the required SNR in channel decoding even when the perforation probability is high. The perforation probability in some LLR conversion schemes is estimated and several estimation methods are proposed. An LLR conversion scheme without estimation of the perforation probability is also proposed to avoid accurate estimation. The performance of the proposed schemes is evaluated by simulation in terms of the required E/sub b//N/sub 0/ for a 1% block error rate (BLER).     

Joint detection with low computational complexity for hybridTD-CDMA systems

In the hybrid multiple access technique time division-code division multiple access (TD-CDMA), both multiple-access interference and intersymbol interference (ISI) arise. In order to combat the overall interference, we propose four efficient joint detection schemes based on zero-forcing and minimum-mean square error criteria. By exploiting the Toeplitz-block structure of matrices and the asymptotic equivalence between finite-order Toeplitz matrices and circulant matrices, most computations can be carried out very efficiently through extensive use of discrete Fourier transform (DFT) and independent DFT (IDFT) transforms. Performance results based on the UMTS scenario are presented     

New radar clutter suppression schemes using modified multisegment MEM

New radar clutter suppression schemes which assume high correlation of several successive range rings are presented by modifying the multisegment MEM (maximum entropy method) developed by Haykin et al. Experimental results using real ground, sea and weather clutters have proved that the new schemes are superior to the Zhang and Haykin schemes.     

Simulation analyses of weighted fair bandwidth‐on‐demand (WFBoD) process for broadband multimedia geostationary satellite systems

Advanced resource management schemes are required for broadband multimedia satellite networks to provide efficient and fair resource allocation while delivering guaranteed quality of service (QoS) to a potentially very large number of users. Such resource management schemes must provide well‐defined service segregation to the different traffic flows of the satellite network, and they must be integrated with some connection admission control (CAC) process at least for the flows requiring QoS guarantees. Weighted fair bandwidth‐on‐demand (WFBoD) is a resource management process for broadband multimedia geostationary (GEO) satellite systems that provides fair and efficient resource allocation coupled with a well‐defined MAC‐level QoS framework (compatible with ATM and IP QoS frameworks) and a multi‐level service segregation to a large number of users with diverse characteristics. WFBoD is also integrated with the CAC process. In this paper, we analyse via extensive simulations the WFBoD process in a bent‐pipe satellite network. Our results show that WFBoD can be used to provide guaranteed QoS for both non‐real‐time and real‐time variable bit rate (VBR) flows. Our results also show how to choose the main parameters of the WFBoD process depending on the system parameters and on the traffic characteristics of the flows. Copyright © 2005 John Wiley & Sons, Ltd.     

Channel estimation techniques based on pilot arrangement in OFDM systems

Channel estimation techniques for OFDM systems based on a pilot arrangement are investigated. Channel estimation based on a comb type pilot arrangement is studied through different algorithms for both estimating the channel at pilot frequencies and interpolating the channel. Channel estimation at pilot frequencies is based on LS and LMS methods while channel interpolation is done using linear interpolation, second order interpolation, low-pass interpolation, spline cubic interpolation, and time domain interpolation. Time-domain interpolation is obtained by passing to the time domain by means of IDFT (inverse discrete Fourier transform), zero padding and going back to the frequency domain by DFT (discrete Fourier transform). In addition, channel estimation based on a block type pilot arrangement is performed by sending pilots in every sub-channel and using this estimation for a specific number of following symbols. We have also implemented a decision feedback equalizer for all sub-channels followed by periodic block-type pilots. We have compared the performances of all schemes by measuring bit error rates with 16QAM, QPSK, DQPSK and BPSK as modulation schemes, and multipath Rayleigh fading and AR based fading channels as channel models.     

Transient scattering from two-dimensional dielectric cylinders ofarbitrary shape

The problem of transient scattering by arbitrarily shaped two-dimensional dielectric cylinders is solved using the marching-on-in-time technique. The dielectric problem is approached via the surface equivalence principle. Two coupled integral equations are derived by enforcing the continuity of the electric and magnetic fields which are solved by using the method of moments. Numerical results are presented for two cross sections, viz. a circle and a square, and compared with inverse discrete Fourier transform (IDFT) techniques. In each case, good agreement is obtained with the IDFT solution     

Analysis of diversity schemes employing antenna selection in the presence of channel estimation errors and feedback delay

The main objective of this paper is to provide an extensive and complete examination on the effect of practical impairments such as channel estimation errors (CEEs) and feedback delay (FD) on the performance of diversity schemes over Nakagami‐m fading channels. Under erroneous channel estimation and outdated feedback cases, statistical expressions and several performance metrics related to the post‐processing signal‐to‐noise ratio (SNR) are derived for four different diversity schemes: transmit antenna selection (TAS)/orthogonal space–time block coding, TAS/maximal‐ratio transmission (MRT), MRT/receive antenna selection (RAS), and joint transmit and RAS. Exact analytical expressions for outage probability and average error rates of M‐ary modulations are derived in order to provide insightful perspectives on the capacity and error performance of diversity schemes that experience both CEE and FD. The asymptotic diversity order of the investigated diversity schemes are derived via a high‐SNR approximation approach. In order to assess the real‐world performance of the investigated diversity schemes and to observe their robustness or sensitivities in practical imperfections, various configurations are considered together with several performance comparisons. Also, Monte Carlo simulations are performed in order to validate the theoretical results. Copyright © 2014 John Wiley & Sons, Ltd.     

认知NC-OFDM系统一种改进的信道估计

介绍了认知无线电NC-OFDM系统中的信道估计技术,着重分析了随机插入导频模式和迭代IDFT变换域降噪方法。通过引入转换分解算法,对迭代IDFT变换域降噪方法进行改进,改进的信道估计算法与迭代IDFT变换域降噪方法有相同的估计性能,但改进的信道估计算法运算量少,估计器复杂度低,提高了硬件资源的利用,具有实用性。     

Characterization of in-building UHF wireless radio communicationchannels using spectral energy measurements

A simple, cost-effective means is developed to estimate the time-invariant wireless radio channel impulse response h(t) using only the magnitude of the channel transfer function, H(jw). The Hilbert transform is used to calculate the phase of H(jw) from its magnitude. Inverse discrete Fourier transformation (IDFT) of H(jw) yields h(t). The Hilbert transform relation is applicable provided H(jw) is a minimum phase transfer function. An experimental in-building wireless channel testbed was established, for which h(t) was determined over the 1000-2500 MHz range. Both line of sight (LOS) and non-LOS transmission was investigated. Good agreement was observed between values of h(t) calculated from measured values of H(jw) and from those based only on [H(jw)] and its Hilbert transform. Even when the minimum phase condition is violated, h(t) as calculated from [H(jw)] and its Hilbert transform provides a useful lower bound on the time-spread of h(t). The measurement of [H(jw)] is easily implemented using a signal source, receiving antenna, and spectrum analyzer. A personal computer and software are required to calculate the phase of H(jw) and its IDTF. Existing frequency-domain measurement schemes utilize a vector network analyzer to measure H(jw) (magnitude and phase angle). Such equipment is expensive, subject to transmitter-receiver crosstalk, and restrictive as to the relative locations of the transmitting and receiving antenna     

TD-EFIE分析任意几何形状导体的瞬态特性

应用时域电场积分方程方法分析了各类天线和散射体的瞬态电磁响应.在分析中,激励源的形式和导体的几何形状可以任意.首先探讨了不同时域基函数对计算结果的影响,同时为了消除后期振荡,而且保持计算结果的准确性,还提出了一种新的均衡方案.计算了一系列的实例,并将计算结果与采用离散傅立叶反变换法计算得到的结果进行了比较.它们之间良好的一致性说明了本文所提方法的正确性和有效性.     

Improved NSGA-II optimizing coding-link cost trade-offs for multicast routing in WDM networks

The present study proposed a high-data-rate underwater optical wireless communication (UOWC) system to propagate the laser blue–green waves through water. The presented study not only focuses on analysis of challenges in UOWC link including attenuation, absorption, scattering and turbulence model, but also investigates the performance of the proposed system using two different methods of balanced modulation schemes. Spectrum efficiency of the system can be improved by using appropriate modulation formats. Return-to-zero differential phase shift keying (RZ-DPSK) and non-return-to-zero differential phase shift keying (NRZ-DPSK) schemes are two modulation formats that we investigate them to improve the characteristics of the proposed UOWC system. The paper explains a real model and exhaustive analysis for advanced UOWC works by using channel model and modulation formats for presented underwater link. Performance of the proposed system under different modulation schemes and physical aspects of UOWC is studied with several parameters like max quality factor, min bit error rate (BER) and eye diagram. For clear ocean, the performance of the proposed system is good and min BER less than 10^?90 for two modulation formats. Generally, results at different condition show that the operation of NRZ-DPSK modulation has better performance than RZ-DPSK scheme.     

On Optimal$p$-Cycle-Based Protection in WDM Optical Networks With Sparse-Partial Wavelength Conversion

We study the optimal configuration of$p$-cycles in survivable wavelength division multiplexing (WDM) optical mesh networks with sparse-partial wavelength conversion while 100% restorability is guaranteed against any single failures. We formulate the problem as two integer linear programs (Optimization Models I, and II) which have the same constraints, but different objective functions.$p$-cycles and wavelength converters are optimally determined subject to the constraint that only a given number of nodes have wavelength conversion capability, and the maximum number of wavelength converters that can be placed at such nodes is limited. Optimization Model I has a composite sequential objective function that first (G1) minimizes the cost of link capacity used by all$p$-cycles in order to accommodate a set of traffic demands; and then (G2) minimizes the total number of wavelength converters used in the entire network. In Optimization Model II, the cost of one wavelength converter is measured as the cost of a deployed wavelength link with a length of$alpha$units; and the objective is to minimize the total cost of link capacity & wavelength converters required by$p$-cycle configuration. During$p$-cycle configuration, our schemes fully takes into account wavelength converter sharing, which reduces the number of converters required while attaining a satisfactory level of performance. Our simulation results indicate that the proposed schemes significantly outperform existing approaches in terms of protection cost, number of wavelength conversion sites, and number of wavelength converters needed.     

A compact 2-D full-wave finite-difference frequency-domain methodfor general guided wave structures

A compact two-dimensional (2-D) full-wave finite-difference frequency-domain method is proposed for the analysis of dispersion characteristics of a general guided wave structure. Because the longitudinal field components are eliminated in the proposed method, only four transverse field components are involved in the final resulting eigen equation. This feature considerably reduces the required CPU time as compared to the existing approaches by which six field components are comprised. Additionally, unlike other 2-D finite-difference schemes that determine the eigenfrequency for a given propagation constant, the new method finds the propagation constant β for a given k_o (frequency). The new method has been verified by examining the computed results of a number of typical guided wave structures with the published results. Very good agreement is achieved     

TCP smart framing: a segmentation algorithm to reduce TCP latency

TCP Smart Framing, or TCP-SF for short, enables the Fast Retransmit/Recovery algorithms even when the congestion window is small. Without modifying the TCP congestion control based on the additive-increase/multiplicative-decrease paradigm, TCP-SF adopts a novel segmentation algorithm: while Classic TCP always tries to send full-sized segments, a TCP-SF source adopts a more flexible segmentation algorithm to try and always have a number of in-flight segments larger than 3 so as to enable Fast Recovery. We motivate this choice by real traffic measurements, which indicate that today's traffic is populated by short-lived flows, whose only means to recover from a packet loss is by triggering a Retransmission Timeout. The key idea of TCP-SF can be implemented on top of any TCP flavor, from Tahoe to SACK, and requires modifications to the server TCP stack only, and can be easily coupled with recent TCP enhancements. The performance of the proposed TCP modification were studied by means of simulations, live measurements and an analytical model. In addition, the analytical model we have devised has a general scope, making it a valid tool for TCP performance evaluation in the small window region. Improvements are remarkable under several buffer management schemes, and maximized by byte-oriented schemes.