Full-diversity, high-rate space-time block codes from division algebras

We present some general techniques for constructing full-rank, minimal-delay, rate at least one space-time block codes (STBCs) over a variety of signal sets for arbitrary number of transmit antennas using commutative division algebras (field extensions) as well as using noncommutative division algebras of the rational field /spl Qopf/ embedded in matrix rings. The first half of the paper deals with constructions using field extensions of /spl Qopf/. Working with cyclotomic field extensions, we construct several families of STBCs over a wide range of signal sets that are of full rank, minimal delay, and rate at least one appropriate for any number of transmit antennas. We study the coding gain and capacity of these codes. Using transcendental extensions we construct arbitrary rate codes that are full rank for arbitrary number of antennas. We also present a method of constructing STBCs using noncyclotomic field extensions. In the later half of the paper, we discuss two ways of embedding noncommutative division algebras into matrices: left regular representation, and representation over maximal cyclic subfields. The 4/spl times/4 real orthogonal design is obtained by the left regular representation of quaternions. Alamouti's (1998) code is just a special case of the construction using representation over maximal cyclic subfields and we observe certain algebraic uniqueness characteristics of it. Also, we discuss a general principle for constructing cyclic division algebras using the nth root of a transcendental element and study the capacity of the STBCs obtained from this construction. Another family of cyclic division algebras discovered by Brauer (1933) is discussed and several examples of STBCs derived from each of these constructions are presented.     

2-D symmetry: theory and filter design applications

In this comprehensive review article, we present the theory of symmetry in two-dimensional (2-D) filter functions and in 2-D Fourier transforms. It is shown that when a filter frequency response possesses symmetry, the realization problem becomes relatively simple. Further, when the frequency response has no symmetry, there is a technique to decompose that frequency response into components each of which has the desired symmetry. This again reduces the complexity of two-dimensional filter design. A number of filter design examples are illustrated.     

Useful NMR solvent mixture for polyesters: Trifluoroacetic acid-d/chloroform-d

Summary NMR spectra of high molecular weight polyesters such as polyglycolide (PG) and poly(ethylene terephthalate) (PET) have not been available because of low solubility in suitable NMR solvents. Although PG is not soluble enough at ambient temperatures for NMR spectra in either chloroform-d or trifluoroacetic acid-d alone, it dissolves readily to over 0.9% in a mixture of the two. At this concentration, ¹H and ¹³C spectra can be obtained on samples where end group signals are visible from which molecular weights can readily be determined. The solutions are stable up to at least four days when moisture is excluded. NMR spectra of PET can likewise be obtained at ambient temperatures in the solvent mixture which dissolves up to at least 0.6% of PET.     

Extending the color gamut and dynamic range of an sRGB image using a residual image

Image sources, such as digital camera captures and photographic negatives, typically have more information than can be reproduced on a photographic print or a video display. The information that is lost during the tone/color rendering process relates to both the extended dynamic range and color gamut of the original scene. In conventional photographic systems, most of this additional information is archived on the photographic negative and can be accessed by adjusting the way the negative is printed. However, most digital imaging systems have traditionally archived only a rendered video RGB image. As a result, it is not possible to make the same sorts of image manipulations that historically have been possible with conventional photographic systems. This suggests that there would be an advantage to storing images using an extended dynamic range/color gamut color encoding. However, because of file compatibility issues, digital imaging systems that store images using color encoding other than a standard video RGB representation (e.g., sRGB) would be significantly disadvantaged in the marketplace. In this article, we describe a solution that has been developed to maintain compatibility with existing file formats and software applications, while simultaneously retaining the extended dynamic range and color gamut information associated with the original scenes. With this approach, the input raw digital camera image or film scan is first transformed to the scene‐referred ERIMM RGB color encoding. Next, a rendered sRGB image is formed in the usual way and stored in a conventional image file (e.g., a standard JPEG file). A residual image representing the difference between the original extended dynamic range image and the final rendered image is formed and stored in the image file using proprietary metadata tags. This provides a mechanism for archiving the extended dynamic range/color gamut information, which is normally discarded during the rendering process, without sacrificing interoperability. Appropriately enabled applications can decode the residual image metadata and use it to reconstruct the ERIMM RGB image, whereas applications that are not aware of the metadata will ignore it and only have access to the sRGB image. The residual image is formed such that it will have negligible pixel values for those portions of the image that lie within the sRGB gamut, and will therefore be highly compressible. Tests on a population of 950 real customer images have demonstrated that the extended dynamic range scene information can be stored with an average file size overhead of about 8% compared to the sRGB images alone. © 2003 Wiley Periodicals, Inc. Col Res Appl, 28, 251–266, 2003; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/col.10160     

Differential pixel-based low-power and high-speed implementation of DCT for on-board satellite image processing

Low-power and high-speed discrete cosine transform (DCT) implementation of the images captured by the satellites presents a hardware design problem. The cost of the DCT implementation is dominated by the complexity of the multiplication of input data (image) with the DCT matrix. The techniques for minimising the complexity of multiplication by employing a differential pixel method are presented. In the proposed method 8times8 blocks of input image matrix are considered, the difference between the adjacent pixels is calculated and those differential pixels are used in DCT transformation. Synthesis results on 0.18 mum CMOS technology show that the proposed method gives an average of 13.2% reduction in power consumption and 10.9% improvement in speed over the conventional method. The proposed method can also be combined with the common subexpression elimination method for further reduction.     

Publicly subsidized health insurance: a typology of state approaches

Using information from case studies, published documents, and the Current Population Survey, this paper describes and classifies state approaches to providing health insurance to low-income populations (as of 1997). It examines the link between the scope of state efforts and uninsurance rates for low-income populations. Findings indicate that the breadth of state policies contributes to differences in insurance coverage for low-income persons across states.     

Partial acidulation of an ‘unground’ phosphate rock: II. Plant availability of phosphate

Four greenhouse experiments were conducted using three soils to determine the availability to plants of P from unground North Carolina phosphate rock (PR) treated with 20% to 50% of the H₃PO₄ required for complete acidulation. The influences of soil P retention, P status, the method of preparation of partially acidulated phosphate rocks (PAPRs) and the granule size of the products were investigated. Perennial ryegrass was grown as the test plant for up to 8 months. Triple superphosphate (TSP) was used as the standard fertilizer and unground North Carolina rock was included for comparison.The dry matter yield and P uptake response curves showed that in all experiments PAPRs were markedly superior to the PR. P status of soils appeared to influence the effectiveness of PAPRs to a greater extent than P retention. In soils of low P status the degree of acidulation required for PAPR to be nearly or as effective as TSP was 50% whereas in a soil of high P status even 30% PAPR applied as a maintenance fertilizer was effective. There was a significant positive correlation between water soluble P of fertilizers and P uptake by ryegrass. However, in general PAPRs were more effective per unit of water soluble P than TSP. Granule size (< 1 mm and 1–2 mm) and method of preparation of PAPRs did not alter the effectiveness of PAPRs.     

Implementation of VLSI on Signal Processing-Based Digital Architecture Using AES Algorithm

Continuous improvements in very-large-scale integration (VLSI) technology and design software have significantly broadened the scope of digital signal processing (DSP) applications. The use of application-specific integrated circuits (ASICs) and programmable digital signal processors for many DSP applications have changed, even though new system implementations based on reconfigurable computing are becoming more complex. Adaptable platforms that combine hardware and software programmability efficiency are rapidly maturing with discrete wavelet transformation (DWT) and sophisticated computerized design techniques, which are much needed in today’s modern world. New research and commercial efforts to sustain power optimization, cost savings, and improved runtime effectiveness have been initiated as initial reconfigurable technologies have emerged. Hence, in this paper, it is proposed that the DWT method can be implemented on a field-programmable gate array in a digital architecture (FPGA-DA). We examined the effects of quantization on DWT performance in classification problems to demonstrate its reliability concerning fixed-point math implementations. The Advanced Encryption Standard (AES) algorithm for DWT learning used in this architecture is less responsive to resampling errors than the previously proposed solution in the literature using the artificial neural networks (ANN) method. By reducing hardware area by 57%, the proposed system has a higher throughput rate of 88.72%, reliability analysis of 95.5% compared to the other standard methods.     

Optimizing Decision-Making of A Smart Prosumer Microgrid Using Simulation

Distributed renewable energy sources offer significant alternatives for Qatar and the Arab Gulf region’s future fuel supply and demand. Microgrids are essential for providing dependable power in difficult-to-reach areas while incorporating significant amounts of renewable energy sources. In energy-efficient data centers, distributed generation can be used to meet the facility’s overall power needs. This study primarily focuses on the best energy management practices for a smart microgrid in Qatar while taking demand-side load management into account. This article looked into a university microgrid in Qatar that primarily aimed to get all of its energy from the grid. While diesel generators are categorized as a dispatchable distributed generation with energy storage added to handle solar radiation from the sun and high grid power operating costs in the suggested scenario, wind turbines and solar Photovoltaic (PV) are classified as non-dispatchable distributed generators. The resulting linear math issues are assessed and displayed in MATLAB optimization software using a mixed-integer linear programming (MILP) strategy. According to the simulation results, the suggested energy management strategy reduced the university microgrid’s grid power costs by 38.8%, making it an affordable solution which is somehow greater than the prior case scenario’s 23% savings. The installed solar system capacity’s effects on the economy, society, and finances were also assessed, and it became clear that the best option for the smart microgrid was determined that would be 325 kW of solar PV, 25 kW of wind turbine, and 600 kW of diesel generators, respectively. Given the current situation, university administrators are urged to participate in distributed generators and adopt cutting-edge designs for energy storage technologies due to the significant environmental and financial benefits.     

FracMAP: A user-interactive package for performing simulation and orientation-specific morphology analysis of fractal-like solid nano-agglomerates

Computer simulation techniques have found extensive use in establishing empirical relationships between three-dimensional (3d) and two-dimensional (2d) projected properties of particles produced by the process of growth through the agglomeration of smaller particles (monomers). In this paper, we describe a package, FracMAP, that has been written to simulate 3d quasi-fractal agglomerates and create their 2d pixelated projection images by restricting them to stable orientations as commonly encountered for quasi-fractal agglomerates collected on filter media for electron microscopy. Resulting 2d images are analyzed for their projected morphological properties.

Program summary

Program title: FracMAPCatalogue identifier: AEDD_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEDD_v1_0.htmlProgram obtainable from: CPC Program Library, Queen's University, Belfast, N. IrelandLicensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.: 4722No. of bytes in distributed program, including test data, etc.: 27 229Distribution format: tar.gzProgramming language: C++Computer: PCOperating system: Windows, LinuxRAM: 2.0 MegabytesClassification: 7.7Nature of problem: Solving for a suitable fractal agglomerate construction under constraints of typical morphological parameters.Solution method: Monte Carlo approximation.Restrictions: Problem complexity is not representative of run-time, since Monte Carlo iterations are of a constant complexity.Additional comments: The distribution file contains two versions of the FracMAP code, one for Windows and one for Linux.Running time: 1 hour for a fractal agglomerate of size 25 on a single processor.