Accelerated generation of holograms with ultra-low memory symmetrically high-compressed look-up table

Computer-generated holography technology has been widely applied,and as research in this field deepens,the demand for memory and computational power in small AR and VR devices continues to increase.This paper presents a hologram generation method,i.e.,a symmetrically high-compressed look-up table method,which can reduce memory usage by50%.In offline computing,half of the basic horizontal and vertical modulation factors are stored,halving the memory requirements without affecting inline speed.Currently,its potential extends to various holographic applications,including the production of optical diffraction elements.

Fine Doppler shift acquisition algorithm for BeiDou software receiver by a look-up table

The BeiDou software receiver uses the fast Fourier transform(FFT)to perform the acquisition.The Doppler shift estimation accuracy should be less than 500 Hz to ensure satellite signals to enter a locked state in the tracking loop.Since the frequency step is usually 500 Hz or larger,the Doppler shift estimation accuracy cannot guarantee that satellite signals are brought into a stable tracking state.The straightforward solutions consist in increasing the sampling time and using zero-padding to improve the frequency resolution of the FFT.However,these solutions intensify the complexity and amount of computation.The contradiction between the acquisition accuracy and the computational load leads us to research for a more simple and effective algorithm,which achieves fine acquisition by a look-up table.After coarse acquisition using the parallel frequency acquisition(PFA)algorithm,the proposed algorithm optimizes the Doppler shift estimation through the look-up table method based on the FFT results to improve the acquisition accuracy of the Doppler shift with a minimal additional computing load.When the Doppler shift is within the queryable range of the table,the proposed algorithm can improve the Doppler shift estimation accuracy to 50 Hz for the BeiDou B1I signal.

A general purpose exact Rayleigh scattering look-up table for ocean color remote sensing

The current exact Rayleigh scattering calculation of ocean color remote sensing uses the look-up table （LUT）, which is usually created for a special remote sensor and cannot be applied to other sensors. For practical application, a general purpose Rayleigh scattering LUT which can be applied to all ocean color remote sensors is generated. An adding-doubling method to solve the vector radiative transfer equation in the plane-parallel atmosphere is deduced in detail. Compared with the exact Rayleigh scattering radiance derived from the MODIS exact Rayleigh scattering LUT, it is proved that the relative error of Rayleigh scattering calculation with the adding-doubling method is less than 0.25%, which meets the required accuracy of the atmospheric correction of ocean color remote sensing. Therefore, the adding-doubling method can be used to generate the exact Rayleigh scattering LUT for the ocean color remote sensors. Finally, the general purpose exact Rayleigh scattering LUT is generated using the adding-doubling method. On the basis of the general purpose LUT, the calculated Rayleigh scattering radiance is tested by comparing with the LUTs ofMODIS, SeaWiFS and the other ocean color sensors, showing that the relative errors are all less than 0.5%, and this general purpose LUT can be applied to all ocean color remote sensors.

Performance of global look-up table strategy in digital image correlation with cubic B-spline interpolation and bicubic interpolation

Global look-up table strategy proposed recently has been proven to be an efficient method to accelerate the interpolation, which is the most time-consuming part in the iterative sub-pixel digital image correlation （DIC） algorithms. In this paper, a global look-up table strategy with cubic B-spline interpolation is developed for the DIC method based on the inverse compositional Gauss-Newton （IC-GN） algorithm. The performance of this strategy, including accuracy, precision, and computation efficiency, is evaluated through a theoretical and experimental study, using the one with widely employed bicubic interpolation as a benchmark. The global look-up table strategy with cubic B-spline interpolation improves significantly the accuracy of the IC-GN algorithm-based DIC method compared with the one using the bicubic interpolation, at a trivial price of computation efficiency.

A novel control strategy for reproducing the floor motions of high-rise buildings by earthquake-simulating shake tables

To enable the experimental assessment of the seismic performance of full-scale nonstructural elements with multiple engineering parameters(EDPs),a three-layer testbed named Nonstructural Element Simulator on Shake Table(NEST)has been developed.The testbed consists of three consecutive floors of steel structure.The bottom two floors provide a space to accommodate a full-scale room.To fully explore the flexibility of NEST,we propose a novel control strategy to generate the required shake table input time histories for the testbed to track the target floor motions of the buildings of interest with high accuracy.The control strategy contains two parts:an inverse dynamic compensation via simulation of feedback control systems(IDCS)algorithm and an offline iteration procedure based on a refined nonlinear numerical model of the testbed.The key aspects of the control strategy were introduced in this paper.Experimental tests were conducted to simulate the seismic responses of a full-scale office room on the 21^(st)floor of a 42-story high-rise building.The test results show that the proposed control strategy can reproduce the target floor motions of the building of interest with less than 20%errors within the specified frequency range.

Study on An Absolute Non-Collision Hash and Jumping Table IP Classification Algorithms

In order to classify packet, we propose a novel IP classification based the non-collision hash and jumping table trie-tree (NHJTTT) algorithm, which is based on noncollision hash Trie-tree and Lakshman and Stiliadis proposing a 2-dimensional classification algorithm (LS algorithm). The core of algorithm consists of two parts: structure the non-collision hash function, which is constructed mainly based on destination/source port and protocol type field so that the hash function can avoid space explosion problem; introduce jumping table Trie-tree based LS algorithm in order to reduce time complexity. The test results show that the classification rate of NHJTTT algorithm is up to 1 million packets per second and the maximum memory consumed is 9 MB for 10 000 rules. Key words IP classification - lookup algorithm - trie-tree - non-collision hash - jumping table CLC number TN 393.06 Foundation item: Supported by the Chongqing of Posts and Telecommunications Younger Teacher Fundation (A2003-03).Biography: SHANG Feng-jun (1972-), male, Ph.D. candidate, lecture, research direction: the smart instrument and network.

WinoNet:Reconfigurable look-up table-based Winograd accelerator for arbitrary precision convolutional neural network inference

To solve the hardware deployment problem caused by the vast demanding computational complexity of convolutional layers and limited hardware resources for the hardware network inference,a look-up table(LUT)-based convolution architecture built on a field-programmable gate array using integer multipliers and addition trees is used.With the help of the Winograd algorithm,the optimization of convolution and multiplication is realized to reduce the computational complexity.The LUT-based operator is further optimized to construct a processing unit(PE).Simultaneously optimized storage streams improve memory access efficiency and solve bandwidth constraints.The data toggle rate is reduced to optimize power consumption.The experimental results show that the use of the Winograd algorithm to build basic processing units can significantly reduce the number of multipliers and achieve hardware deployment acceleration,while the time-division multiplexing of processing units improves resource utilization.Under this experimental condition,compared with the traditional convolution method,the architecture optimizes computing resources by 2.25 times and improves the peak throughput by 19.3 times.The LUT-based Winograd accelerator can effectively solve the deployment problem caused by limited hardware resources.

Attribute reduction algorithm based on discernibility for decision table

The attribute reduction algorithms of decision table based on discernible matrix are required to construct discernible matrix, which reduces efficiency of algorithms. In this paper, the relationship between attribute discernible matrix and its discernibility is first established for general information systems. Based on the idea that the equivalent discernible matrix has a same attribute reduction, existing matrices are modified and a formula of attribute discernibility associated with algebraic reduction for decision table is proposed. A heuristic attribute reduction algorithm based on attribute discernibility is presented. Experimental results indicate that the algorithm can more easily explore an optimal or sub-optimal reduction, and is efficient.

Research of NO_(2) vertical profiles with look-up table method based on MAX-DOAS

Obtaining the vertical distribution profile of trace gas is of great significance for studying the diffusion procedure of air pollution.In this article,a look-up table method based on multi-axis differential optical absorption spectroscopy(MAX-DOAS)technology is established for retrieving the tropospheric NO_(2) vertical distribution profiles.This method retrieves the aerosol extinction profiles with minimum cost function.Then,the aerosol extinction profiles and the atmospheric radiation transfer model(RTM)are employed to establish the look-up table for retrieving the NO_(2) vertical column densities(VCDs)and profiles.The measured NO_(2) differential slant column densities(DSCDs)are compared with the NO_(2) DSCDs simulated by the atmospheric RTM,and the NO_(2) VCDs,the weight factor of NO_(2) in the boundary layer,and the boundary layer height are obtained by the minimization process.The look-up table is established to retrieve NO_(2) VCDs based on MAX-DOAS measurements in Huaibei area,and the results are compared with the data from Copernicus Atmospheric Monitoring Service(CAMS)model.It is found that there are nearly consistent and the correlation coefficient R2 is more than 0.86.The results show that this technology provides a more convenient and accurate retrieval method for the stereoscopic monitoring of atmospheric environment.

VCA Direct-Drive High Speed and Precision XY Table

In order to compensate for the limitation of conventional XY table used in semiconductor integrated circuits(IC) packaging and improve its speed and accuracy, a voice coil actuator (VCA) direct-drive high-speed and precision positioning XY table used in wire bonder was proposed. Also, a novel flexible decoupling mechanism was used in the positioning table, and the small moving mass enabled the positioning table to move at high speed and precision. XY table deformation interference caused by assembly error and instant interference generated by dynamic load moving with high speed and acceleration can be eliminated through the flexible decoupling mechanism. Considering the positioning table as lumped mass spring system,the dynamic equations of the mechanical system and the VCA were built according to the Newton mechanics principle and electromagnetic theory. Then the electromechanical coupling control model of the system was created through Laplace transform. Based on displacement PID controller, the loop-locked controlling algorithm of the positioning system was investigated. The dynamic control algorithm effectively improved the system dynamic performance. The precision test of the prototype machine was carried out, and the results validated the correctness of the model and the theory. Compared with traditional XY table, the table has higher speed, acceleration and positioning accuracy.

Visualizing Data Tree-Table Based on the Database

The data tree table is a type of data structure consisting of data tree and table, which has a wide field of applications. The visual and dynamic growing algorithm of data tree table and its software method are presented based on the theory of the data structure and visual technology of software. The method of the expression and management of data tree table with relational mode are explored.

Differential Spatial Modulation Mapping Algorithms

Differential spatial modulation(DSM)is a multiple-input multiple-output(MIMO)transmission scheme.It has attracted extensive research interest due to its ability to transmit additional data without increasing any radio frequency chain.In this paper,DSM is investigated using two mapping algorithms:Look-Up Table Order(LUTO)and Permutation Method(PM).Then,the bit error rate(BER)performance and complexity of the two mapping algorithms in various antennas and modulation methods are verified by simulation experiments.The results show that PM has a lower BER than the LUTO mapping algorithm,and the latter has lower complexity than the former.

软件定义网络下的计算机精准流表匹配算法技术

文章深入探讨了软件定义网络下的计算机精准流表匹配算法。首先,阐述了该领域的技术现状,包括基于哈希表、树结构、布隆过滤器和正则表达式的流表匹配算法;其次,分析了性能、可扩展性及安全性等方面的挑战。针对这些挑战,提出了相应对策,包括算法改进、硬件加速和缓存机制等性能优化策略,分布式架构、动态调整及负载均衡等可扩展性提升措施,以及访问控制、加密技术与安全监测等安全保障机制。通过对这些内容的研究,为软件定义网络下的流表匹配算法发展提供了理论支持和实践指导。

基于SSA算法的TTE静态调度表求解方法

当前网络实时系统飞速发展,为了能达到更高效的通信,网络资源的调度问题受到专家学者的广泛关注。本文所研究的静态调度表求解方法是配置网络资源的有效解决方案,是国内外相关领域的研究重点。自2002年TTE(TimeTriggered Ethernet,时间触发以太网)问世以来,由于应用领域和具体使用场景的不同,TTE网络静态调度表求解方法也在不断改进创新。随着各类算法的不断优化,静态调度表的生成效果越来越理想,但方案仍然不能很好地应用于工程实践。本文首次提出选用SSA算法(Sparrow Search Algorithm,麻雀搜索算法),并在个体最优位置中加入扰动,使得适应度函数的收敛效率有了明显改善,避免陷入局部最优,达到了求解TTE静态调度表的目的。

FAST UPDATE ALGORITHM FOR TCAM-BASED ROUTING LOOKUPS

Routing technology has been forced to evolve towards higher capacity and per port packet processing speed. The ability to achieve high forwarding speed is due to either software or hardware technology. TCAM (Ternary Content Addressable Memory) provides a performance advantage over other software or hardware search algorithms, often resulting in an order of magnitude reduction of search time. But slow updates may affect the performance of TCAM based routing lookup. So the key is to design a table management algorithm, which supports high speed updates in TCAMs. This paper presented three table management algorithms, and then compared their performance. Finally, the optimal one after comparing was given.

A Plant Image Compression Algorithm Based on Wireless Sensor Network

This paper designs and implements an image transmission algorithm applied to plant information collection based on the wireless sensor network. It can effectively reduce the volume of transmitted data, low-energy, high-availability image compression algorithm. This algorithm mainly has two aspects of improvement measures: the first is to reduce the number of pixels that transmit images, from interlaced scanning to interlaced neighbor scanning;the second is to use JPEG image compression algorithm [1], changing the value of the quantization table in the algorithm [2]. After image compression, the image data volume is greatly reduced;the transmission efficiency is improved;and the problem of excessive data volume during image transmission is effectively solved.

Granularity of Knowledge Computed by Genetic Algorithms Based on Rough Sets Theory

Rough set philosophy hinges on the granularity of data, which is used to build all its basic concepts, like approximations, dependencies, reduction etc. Genetic Algorithms provides a general frame to optimize problem solution of complex system without depending on the domain of problem.It is robust to many kinds of problems.The paper combines Genetic Algorithms and rough sets theory to compute granular of knowledge through an example of information table. The combination enable us to compute granular of knowledge effectively.It is also useful for computer auto-computing and information processing.

Interference Cancellation Algorithm for 2×2 MIMO System without Pilot in LTE

Interference cancellation system (ICS) for 3GPP/LTE system is the broadband cancellation system, which receives forward signal through the donor antenna. We proposed new algorithm of received signal with pilot and non-pilot design. Although repeater design needs our project, so in this paper we discuss about interference cancellation algorithm for 2x2 MIMO systems without pilot in LTE. First explain the general principle structure of 3GPP/LTE, next determine our new design and algorithm. Finally, we simulated our mathematic extraction of proposed new algorithm on MATLAB.

迭代算法与柔性结构对离心机振动台控制性能影响

目前迭代算法和柔性结构对离心机振动台控制性能的影响尚缺乏认识,尤其铰接装置作为柔性连接结构在许多离心机振动台上得到应用,以减小离心力荷载下台面和吊篮变形对作动器安全带来的危险。以一套负载1500 kg离心机振动台为样本,采用不同强度、频带的典型地震波为控制目标,探讨了有无迭代算法、柔性结构条件对离心机振动台的控制性能影响。结果表明:20~200 Hz频宽范围内,迭代算法对最大峰值误差、平均峰值误差、平均谱面积误差的影响可忽略。采用迭代算法前后平均峰值误差分别为5.90%,6.15%,平均谱面积误差分别为5.02%,4.94%。柔性结构对于加速度峰值≤7.5g地震波的复现精度有显著影响,尤其是80~150 Hz高频段;对于加速度峰值≥20g地震波的复现精度影响,在频宽20~120 Hz可忽略,但对于120~170 Hz频段的小幅值成分的复现能力影响不容忽略,逊于无柔性结构条件。同时,在无柔性结构条件下对比了不同负载、同一输入荷载的实测输出波,发现两输出波的峰值误差与谱面积误差均无明显差异,证明了离心机振动台具有良好的重复性和稳定性。研究方法和结论,对提高离心机振动台控制性能的影响因素认识和改进设计方法,具有重要指导价值和科学意义。