oalib
Search Results: 1 - 10 of 100 matches for " "
All listed articles are free for downloading (OA Articles)
Page 1 /100
Display every page Item
UMT整环上的w-维数  [PDF]
李庆,王芳贵
四川师范大学学报(自然科学版) , 2010,
Abstract: 设R是整环,X是R上的一个未定元,{Xλ}λ∈Λ是R上任意多个未定元的集合.证明了若R是UMT整环,则w-dimR=w-dim(R{Xλ}λ∈Λ).进一步研究了UMT整环上的群环,证明了若R是UMT整环,则w-dimR=w-dimRX;G.
Low-complexity 8-point DCT Approximations Based on Integer Functions  [PDF]
R. J. Cintra,F. M. Bayer,C. J. Tablada
Statistics , 2013, DOI: 10.1016/j.sigpro.2013.12.027
Abstract: In this paper, we propose a collection of approximations for the 8-point discrete cosine transform (DCT) based on integer functions. Approximations could be systematically obtained and several existing approximations were identified as particular cases. Obtained approximations were compared with the DCT and assessed in the context of JPEG-like image compression.
整环的赋值扩环及赋值维数  [PDF]
王芳贵
四川师范大学学报(自然科学版) , 2010,
Abstract: 设R是整环,其商域为K.dimv(R)表示R的赋值维数.证明了(1)dimv(R)是R的维数互异的既是UMT整环,又是DW整环的扩环升链RmRm-1…R1R0=K的长度的上确界;(2)dimv(R/P)≤dimv(R)-htvP,其中P是R的素理想,htvP是P的赋值高度;(3)对于强Milnor方图RDTF,dimv(R)=max{htvM+dimv(D),dimv(T)},其中M是R与T的公共素理想.
四次循环数域的相对整基  [PDF]
冯克勤
科学通报 , 1982,
Abstract: 设E为数域F的n次扩域,所谓E相对于F的整基,或者称作是E/F的相对整基,即是指O_F-模O_E的O_F-基(其中O_E和O_F分別表示数域E和F的整数环),亦即是O_E中的一组元素{b_1,…,b_n},使得O_E=(?)b_iO_F。当F的理想类数是1,即O_F为主理想环时(例如F=Q),O_E为自由O_F-模,从而E/F总有相对整基。但在一般情形下,E/F不一定有相对整基。
Improved 8-point Approximate DCT for Image and Video Compression Requiring Only 14 Additions  [PDF]
U. S. Potluri,A. Madanayake,R. J. Cintra,F. M. Bayer,S. Kulasekera,A. Edirisuriya
Computer Science , 2015, DOI: 10.1109/TCSI.2013.2295022
Abstract: Video processing systems such as HEVC requiring low energy consumption needed for the multimedia market has lead to extensive development in fast algorithms for the efficient approximation of 2-D DCT transforms. The DCT is employed in a multitude of compression standards due to its remarkable energy compaction properties. Multiplier-free approximate DCT transforms have been proposed that offer superior compression performance at very low circuit complexity. Such approximations can be realized in digital VLSI hardware using additions and subtractions only, leading to significant reductions in chip area and power consumption compared to conventional DCTs and integer transforms. In this paper, we introduce a novel 8-point DCT approximation that requires only 14 addition operations and no multiplications. The proposed transform possesses low computational complexity and is compared to state-of-the-art DCT approximations in terms of both algorithm complexity and peak signal-to-noise ratio. The proposed DCT approximation is a candidate for reconfigurable video standards such as HEVC. The proposed transform and several other DCT approximations are mapped to systolic-array digital architectures and physically realized as digital prototype circuits using FPGA technology and mapped to 45 nm CMOS technology.
A Row-parallel 8$\times$8 2-D DCT Architecture Using Algebraic Integer Based Exact Computation  [PDF]
A. Madanayake,R. J. Cintra,D. Onen,V. S. Dimitrov,N. T. Rajapaksha,L. T. Bruton,A. Edirisuriya
Computer Science , 2015, DOI: 10.1109/TCSVT.2011.2181232
Abstract: An algebraic integer (AI) based time-multiplexed row-parallel architecture and two final-reconstruction step (FRS) algorithms are proposed for the implementation of bivariate AI-encoded 2-D discrete cosine transform (DCT). The architecture directly realizes an error-free 2-D DCT without using FRSs between row-column transforms, leading to an 8$\times$8 2-D DCT which is entirely free of quantization errors in AI basis. As a result, the user-selectable accuracy for each of the coefficients in the FRS facilitates each of the 64 coefficients to have its precision set independently of others, avoiding the leakage of quantization noise between channels as is the case for published DCT designs. The proposed FRS uses two approaches based on (i) optimized Dempster-Macleod multipliers and (ii) expansion factor scaling. This architecture enables low-noise high-dynamic range applications in digital video processing that requires full control of the finite-precision computation of the 2-D DCT. The proposed architectures and FRS techniques are experimentally verified and validated using hardware implementations that are physically realized and verified on FPGA chip. Six designs, for 4- and 8-bit input word sizes, using the two proposed FRS schemes, have been designed, simulated, physically implemented and measured. The maximum clock rate and block-rate achieved among 8-bit input designs are 307.787 MHz and 38.47 MHz, respectively, implying a pixel rate of 8$\times$307.787$\approx$2.462 GHz if eventually embedded in a real-time video-processing system. The equivalent frame rate is about 1187.35 Hz for the image size of 1920$\times$1080. All implementations are functional on a Xilinx Virtex-6 XC6VLX240T FPGA device.
VLSI Architecture for 8-Point AI-based Arai DCT having Low Area-Time Complexity and Power at Improved Accuracy  [PDF]
Amila Edirisuriya,Arjuna Madanayake,Vassil S. Dimitrov,Renato J. Cintra,Jithra Adikari
Journal of Low Power Electronics and Applications , 2012, DOI: 10.3390/jlpea2020127
Abstract: A low complexity digital VLSI architecture for the computation of an algebraic integer (AI) based 8-point Arai DCT algorithm is proposed. AI encoding schemes for exact representation of the Arai DCT transform based on a particularly sparse 2-D AI representation is reviewed, leading to the proposed novel architecture based on a new final reconstruction step (FRS) having lower complexity and higher accuracy compared to the state-of-the-art. This FRS is based on an optimization derived from expansion factors that leads to small integer constant-coefficient multiplications, which are realized with common sub-expression elimination (CSE) and Booth encoding. The reference circuit [1] as well as the proposed architectures for two expansion factors α? = 4.5958 and α′ = 167.2309 are implemented. The proposed circuits show 150% and 300% improvements in the number of DCT coefficients having error ≤ 0:1% compared to [1]. The three designs were realized using both 40 nm CMOS Xilinx Virtex-6 FPGAs and synthesized using 65 nm CMOS general purpose standard cells from TSMC. Post synthesis timing analysis of 65 nm CMOS realizations at 900 mV for all three designs of the 8-point DCT core for 8-bit inputs show potential real-time operation at 2.083 GHz clock frequency leading to a combined throughput of 2.083 billion 8-point Arai DCTs per second. The expansion-factor designs show a 43% reduction in area (A) and 29% reduction in dynamic power (PD) for FPGA realizations. An 11% reduction in area is observed for the ASIC design for α? = 4.5958 for an 8% reduction in total power ( PT ). Our second ASIC design having α′ = 167.2309 shows marginal improvements in area and power compared to our reference design but at significantly better accuracy.
积维数为3的3维可换结合代数分类  [PDF]
常秋胜
内蒙古大学学报(自然科学版) , 2015, DOI: 10.13484/j.nmgdxxbzk.20150201
Abstract: 通过讨论复数域上3维可换结合代数的积维数的性质,给出了3维可换结合代数在同构意义下的分类.
分条整经条带成形的剖析与卷绕圈数的确定  [PDF]
纺织学报 , 1984,
Abstract: 本文就分条整经中常见卷装成形疵点的形成与消除进行了探讨。为了做到条带成形正确,提出了设定纱线为椭圆截面时条带纱密系数的确定方法及纱线排列密度的界限值,给出了G121B和G122型分条整经机导条器移动距离和角状板倾角的可调范围。最后讨论了条带卷绕圈数及条带厚度的确定方法。
利用取整函数解决啤酒瓶换啤酒问题
Using Integer Function to Solve the Problem of Replacing Beer Bottle for Beer
 [PDF]

李树璟, 刘南南
Pure Mathematics (PM) , 2019, DOI: 10.12677/PM.2019.96090
Abstract:
取整函数是一种常见的函数,它的形式简单,性质非常独特,在求极限、求导、求积分等的问题上都有广泛应用。应用取整函数的性质,建立一个啤酒瓶换啤酒的实数集到整数集的一个映射,将任意实数转化成整数,解决如何更加优化地买啤酒。通过把超市促销活动啤酒瓶换啤酒问题转化为数学模型,根据取整函数的性质,导出一些结果;并且对这个数学模型进行理论深入探讨与延伸,从而得到一般性的结论。结合我们得到的结论,进一步对结论进行应用,简化实际问题。
The rounding function is a common function. Its form is simple, its nature is very unique, and it is widely used in the problems of seeking limits, seeking and integrating. Applying the nature of the rounding function, a mapping of the real number set of the beer bottle to the beer to a set of inte-gers is established, and any real number is converted into an integer to solve how to optimize the beer. By transforming the problem of beer bottle change for beer in supermarket promotion into a mathematical model, some results are derived according to the nature of the rounding function; and the mathematical model is deeply explored and extended theoretically, and a general conclu-sion is obtained. Combined with the conclusions we have obtained, the conclusions are further ap-plied to simplify the actual problems.
Page 1 /100
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.