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.

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.

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.

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.

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.

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.

基于真值表的函数自动生成的神经网络模型

作为目前最常见的程序综合问题,示例编程通过用户提供的输入/输出示例生成程序,为编程能力不足的开发者提供了便利。近年来,示例编程已经被应用于Microsoft Office Excel办公软件的自动编程,以及勘探、测井、航空航天等领域。鉴于目前示例编程鲜有关于二进制流的研究,本文针对基于真值表函数自动生成问题具有函数表达式的语法符号序列中各语法符号的关系与它们的距离大小无关、函数表达式的生成语义规则与布尔向量函数采样的结果长度无关的特点,设计了一种神经网络模型和算法,在程序综合、功能等价和序列匹配的指标上分别取得了70.56%、64.66%、0.6355的结果,分别优于现有最先进的程序综合模型55.07%、49.70%、0.5690。

The establishment of crystal position look-up table for positron emission tomography with block detectors

A method has been developed to establish the crystal position look-up table for positron emission tomography with block detectors. It is based on the principle that the counts in crystal position histogram obey the Gaussian mixture model (GMM). This method has taken full consideration of the characteristics of the GMM and the detector itself. The experimental results have proved that it is simple, reliable, and universal.

CRC Look-up Table Optimization for Single-Bit Error Correction

Many communication systems use the cyclic redundancy code （CRC） technique for protecting key data fields from transmission errors by enabling both single-bit error correction and multi-bit error detection. The look-up table design is very important for the error-correction implementation. This paper presents a CRC look-up table optimization method for single-bit error correction. The optimization method minimizes the address length of the pre-designed look-up table while satisfying certain restrictions. The circuit implementation is also presented to show the feasibility of the method in the application specific integrated circuit design. An application of the optimization method in the generic framing procedure protocol is implemented using field programmable gatearrays. The result shows that the memory address length has been minimized, while keeping a very simple circuit implementation.

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.

Infimum Properties Differ in the Weak Truth-table Degrees and the Turing Degrees

We prove that there are non-recursive r.e.sets A and C with A<T C such that for every set F(?)T A,C∩F≡w(?).

Device and circuit analysis of a sub 20 nm double gate MOSFET with gate stack using a look-up-table-based approach

In this paper, we explore the possibility of mapping devices designed in TCAD environment to its modeled version developed in cadence virtuoso environment using a look-up table （LUT） approach. Circuit simu- lation of newly designed devices in TCAD environment is a very slow and tedious process involving complex scripting. Hence, the LUT based modeling approach has been proposed as a faster and easier alternative in ca- dence environment. The LUTs are prepared by extracting data from the device characteristics obtained from device simulation in TCAD. A comparative study is shown between the TCAD simulation and the LUT-based alternative to showcase the accuracy of modeled devices. Finally the look-up table approach is used to evaluate the perform- ance of circuits implemented using 14 nm nMOSFET.

Accurate and fast table look-up models for leakage current analysis in 65nm CMOS technology

Novel physical models for leakage current analysis in 65 nm technology are proposed. Taking into consideration the process variations and emerging effects in nano-scaled technology, the presented models are capable of accurately estimating the subthreshold leakage current and junction tunneling leakage current in 65 nm technology. Based on the physical models, new table look-up models are developed and first applied to leakage current analysis in pursuit of higher simulation speed. Simulation results show that the novel physical models are in excellent agreement with the data measured from the foundry in the 65 nm process, and the proposed table look-up models can provide great computational efficiency by using suitable interpolation techniques. Compared with the traditional physical-based models, the table look-up models can achieve 2.5X speedup on average on a variety of industry circuits.

改进的工作流合理性验证方法

工作流建模过程中存在的结构冲突很有可能导致整个系统无法正常运行,因此验证工作流中的结构合理性是非常重要的。目前尚无一种简单的算法能够验证循环结构及交叉结构的合理性,为此提出了一种改进的工作流合理性验证方法。该方法基于Pe-tri网模型,将逻辑推导和真值表相结合,能够简单而有效地检测出工作流中的各种结构冲突。应用示例表明了该方法的有效性。

基于粒矩阵的多变量真值表快速约简算法

真值表化简可简化数字逻辑电路的分析与设计.在人工智能理论中,命题逻辑值的判定和复合命题的等值关系判定也需要用到真值表及其化简.文中将真值表定义为逻辑信息系统,用粒矩阵由粗到细描述不同粒度空间下的知识,将真值表化简转化为通过粒矩阵运算实现的逻辑信息系统属性与属性值的约简,从而提出多变量真值表快速约简算法.并将算法应用到发光二极管七段数字显示器的设计中,实验分析表明文中算法的快速性和有效性.

基于真值表变换的可逆逻辑综合算法

为实现将给定的二元可逆函数快速综合为相应电路,并保持其结果的最优或较优,提出一种基于真值表变换的快速综合算法.可逆函数与置换同构,任意置换均可表示为若干对换的乘积,通过将可逆函数转化为一系列对换的乘积,从对换的乘积中综合电路.对于3bit逻辑电路只有28种对换,事先将28种对换的最优电路存入库中生成3bit电路综合基,通过在库中查找快速生成可逆电路.根据逻辑门可交换规则引入优化方法,完成快速综合算法.结果表明,该方法不但可以提高可逆逻辑综合的效率,而且结构简单,易于实现,可以O(4n)的时间效率快速综合任意3bit可逆逻辑电路,实现综合结果达到或接近最优.

更改条件/判定覆盖最小真值表生成算法及其应用

研究了从一个布尔表达式生成最小真值表的算法,阐述了在覆盖测试工具中利用此算法辅助设计测试用例的应用问题,以此提高代码覆盖率.

基于粒矩阵的多输入多输出真值表快速并行约简算法

真值表是表征逻辑输入与输出之间因果关系的重要工具,真值表约简在数字逻辑电路的分析与设计中具有重要意义。该文将真值表看作逻辑信息系统,将真值表约简转化为逻辑信息系统的最简规则获取。采用粒计算分层粒化的思想,在不同粒度下,利用粒矩阵的知识表示形式、粒矩阵中的启发式知识以及粒矩阵运算,设计了多输入多输出真值表快速并行约简算法。以发光二极管七段数字显示器为例进行了算法说明,通过数学证明和算法复杂性分析证明了算法的正确性和有效性。

哲思逻辑的判定问题

在哲思逻辑系统内,有同时遵守矛盾律和排中律的经典否定联结词,有遵守矛盾律而不遵守排中律的构造性否定联结词,有不遵守矛盾律而遵守排中律的弗协调否定联结词,还有既不遵守矛盾律又不遵守排中律的辩证否定联结词。哲思逻辑是可判定的,其判定方法包括分支真值表、分支归谬赋值法和分支树图方法等。

基于命题逻辑的组件约束检测

针对组件约束数量大、复杂度高的问题,提出了一种基于命题逻辑的组件约束检测算法.通过命题符号化的过程,即通过5个联结词将日常语言中的命题转化成数理逻辑中的形式命题.该算法首次使用受限真值表的概念来描述组件约束,清楚、准确地揭示了软件组织结构、动态行为以及组件之间的转换,通过包含、否定和插入等规则来合并真值表,以解决检测组件约束时存在的冗余与冲突问题,并获得期望行为的最小组件集合,从而保证了组件约束之间相互一致.与基于规则模式表方法相比,所提算法克服了人工检测的不确定性,改善了检测的时间性能,并可将冲突错判率降低大约10%,平均处理时间降低大约33%.