An extensible complex fast Fourier transform processor chip for real-time spectrum analysis and measurement

This paper describes in detail the design of a CMOS custom fast Fourier transform (FFT) processor for computing a 256-point complex FFT. The FFT is well-suited for real-time spectrum analysis in instrumentation and measurement applications. The FFT butterfly processor reported here consists of one parallel-parallel multiplier and two adders. It is capable of computing one butterfly computation every 100 ns thus it can compute a 256-point complex FFT in 102.4 μs excluding data input and output processes.

Consumers' perceptions of speciality foods and therural mail-order business

Many rural-based farm and food businesses are relatively small but successful companies. They face severe constraints in terms of finance, marketing and distribution. However, marketing food by mail order presents the opportunity for these firms to gain access to national or even international markets. The achievement of commercial success requires that these companies become marketing oriented. Thus, the critical issue for these firms is to identify the needs of existing or potential customers. The objectives of the paper are to establish a profile of the characteristics, behaviour and attitudes of mail order customers.

Validation of a fast method for quantification of intra-abdominal and subcutaneous adipose tissue for large-scale human studies

Central obesity is the hallmark of a number of non-inheritable disorders. The advent of imaging techniques such asMRI has allowed for a fast and accurate assessment of body fat content and distribution. However, image analysis continues to be one of the major obstacles to the use of MRI in large-scale studies. In this study we assess the validity of the recently proposed fat–muscle quantitation system (AMRATM Profiler) for the quantification of intra-abdominal adipose tissue (IAAT) and abdominal subcutaneous adipose tissue (ASAT) from abdominal MR images. Abdominal MR images were acquired from 23 volunteers with a broad range of BMIs and analysed using sliceOmatic, the current gold-standard, and the AMRATM Profiler based on a non-rigid image registration of a library of segmented atlases. The results show that there was a highly significant correlation between the fat volumes generated by the two analysis methods, (Pearson correlation r = 0.97, p < 0.001), with the AMRATM Profiler analysis being significantly faster (~3 min) than the conventional sliceOmatic approach (~40 min). There was also excellent agreement between the methods for the quantification of IAAT (AMRA 4.73 ± 1.99 versus sliceOmatic 4.73 ± 1.75 l, p = 0.97). For the AMRATM Profiler analysis, the intra-observer coefficient of variation was 1.6% for IAAT and 1.1% for ASAT, the inter-observer coefficient of variationwas 1.4%for IAAT and 1.2%for ASAT, the intra-observer correlationwas 0.998 for IAAT and 0.999 for ASAT, and the inter-observer correlation was 0.999 for both IAAT and ASAT. These results indicate that precise and accurate measures of body fat content and distribution can be obtained in a fast and reliable form by the AMRATM Profiler, opening up the possibility of large-scale human phenotypic studies.

Preconditioning 2D Integer Data for Fast Convex Hull Computations

In order to accelerate computing the convex hull on a set of n points, a heuristic procedure is often applied to reduce the number of points to a set of s points, s ≤ n, which also contains the same hull. We present an algorithm to precondition 2D data with integer coordinates bounded by a box of size p × q before building a 2D convex hull, with three distinct advantages. First, we prove that under the condition min(p, q) ≤ n the algorithm executes in time within O(n); second, no explicit sorting of data is required; and third, the reduced set of s points forms a simple polygonal chain and thus can be directly pipelined into an O(n) time convex hull algorithm. This paper empirically evaluates and quantifies the speed up gained by preconditioning a set of points by a method based on the proposed algorithm before using common convex hull algorithms to build the final hull. A speedup factor of at least four is consistently found from experiments on various datasets when the condition min(p, q) ≤ n holds; the smaller the ratio min(p, q)/n is in the dataset, the greater the speedup factor achieved.