Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Articles (8)
- Amicable orthogonal designs (AOD) (2)
- Circuit synthesis (2)
- Complex orthogonal designs (2)
- Complex orthogonal space–time block codes (CO STBCs) (2)
-
- Conference Proceedings (2)
- Multiple-input multiple-output (MIMO) (2)
- Orthogonal design (2)
- Peak-to-average power ratio (PAPR) (2)
- Quaternions (2)
- Signal synthesis (2)
- Space–time block code (STBC) (2)
- 1)-labeling (1)
- Analogue processing circuits (1)
- Block codes (1)
- CMOS analogue integrated circuits (1)
- Channel assignment (1)
- Circuit CAD (1)
- Current-mode circuits (1)
- Decoding delay (1)
- Differential equations (1)
- Diversity (1)
- Dynamic voltage scaling (1)
- Ear (1)
- Frequency allocation (1)
- Generalized Petersen graph (1)
- Graph theory (1)
- Interchannel interference (1)
- L(2 (1)
- Linear diophantine equations (1)
Articles 1 - 11 of 11
Full-Text Articles in Engineering
Novel Constructions Of Improved Square Complex Orthogonal Designs For Eight Transmit Antennas, Le Chung Tran, Tadeusz Wysocki, Jennifer Seberry, Alfred Mertins, Sarah Adams
Novel Constructions Of Improved Square Complex Orthogonal Designs For Eight Transmit Antennas, Le Chung Tran, Tadeusz Wysocki, Jennifer Seberry, Alfred Mertins, Sarah Adams
Dr Le Chung Tran
Constructions of square, maximum rate complex orthogonal space-time block codes (CO STBCs) are well known, however codes constructed via the known methods include numerous zeros, which impede their practical implementation. By modifying the Williamson and Wallis-Whiteman arrays to apply to complex matrices, we propose two methods of construction of square, order-4n CO STBCs from square, order-n codes which satisfy certain properties. Applying the proposed methods, we construct square, maximum rate, order-8 CO STBCs with no zeros, such that the transmitted symbols are equally dispersed through transmit antennas. Those codes, referred to as the improved square CO STBCs, have the advantages …
Effects Of Electrostatic Correlations On Electrokinetic Phenomena, Brian Storey, Martin Bazant
Effects Of Electrostatic Correlations On Electrokinetic Phenomena, Brian Storey, Martin Bazant
Brian Storey
The classical theory of electrokinetic phenomena is based on the mean-field approximation that the electric field acting on an individual ion is self-consistently determined by the local mean charge density. This paper considers situations, such as concentrated electrolytes, multivalent electrolytes, or solvent-free ionic liquids, where the mean-field approximation breaks down. A fourth-order modified Poisson equation is developed that captures the essential features in a simple continuum framework. The model is derived as a gradient approximation for nonlocal electrostatics of interacting effective charges, where the permittivity becomes a differential operator, scaled by a correlation length. The theory is able to capture …
On An Orthogonal Space-Time-Polarization Block Code, Beata Wysocki, Tadeusz Wysocki, Sarah Adams
On An Orthogonal Space-Time-Polarization Block Code, Beata Wysocki, Tadeusz Wysocki, Sarah Adams
Sarah Spence Adams
Over the past several years, diversity methods such as space, time, and polarization diversity have been successfully implemented in wireless communications systems. Orthogonal space-time block codes efficiently combine space and time diversity, and they have been studied in detail. Polarization diversity has also been studied, however it is usually considered in a simple concatenation with other coding methods. In this paper, an efficient method for incorporating polarization diversity with space and time diversity is studied. The simple yet highly efficient technique is based on extending orthogonal space-time block codes into the quaternion domain and utilizing a description of the dual-polarized …
Novel Constructions Of Improved Square Complex Orthogonal Designs For Eight Transmit Antennas, Le Chung Tran, Tadeusz Wysocki, Jennifer Seberry, Alfred Mertins, Sarah Adams
Novel Constructions Of Improved Square Complex Orthogonal Designs For Eight Transmit Antennas, Le Chung Tran, Tadeusz Wysocki, Jennifer Seberry, Alfred Mertins, Sarah Adams
Sarah Spence Adams
Constructions of square, maximum rate complex orthogonal space-time block codes (CO STBCs) are well known, however codes constructed via the known methods include numerous zeros, which impede their practical implementation. By modifying the Williamson and Wallis-Whiteman arrays to apply to complex matrices, we propose two methods of construction of square, order-4n CO STBCs from square, order-n codes which satisfy certain properties. Applying the proposed methods, we construct square, maximum rate, order-8 CO STBCs with no zeros, such that the transmitted symbols are equally dispersed through transmit antennas. Those codes, referred to as the improved square CO STBCs, have the advantages …
An Extension Of The Channel-Assignment Problem: L(2, 1)-Labelings Of Generalized Petersen Graphs, Sarah Adams, Jonathan Cass, Denise Troxell
An Extension Of The Channel-Assignment Problem: L(2, 1)-Labelings Of Generalized Petersen Graphs, Sarah Adams, Jonathan Cass, Denise Troxell
Sarah Spence Adams
The channel-assignment problem involves assigning frequencies represented by nonnegative integers to radio transmitters such that transmitters in close proximity receive frequencies that are sufficiently far apart to avoid interference. In one of its variations, the problem is commonly quantified as follows: transmitters separated bythe smallest unit distance must be assigned frequencies that are at least two apart and transmitters separated by twice the smallest unit distance must be assigned frequencies that are at least one apart. Naturally, thischannel-assignment problem can be modeled with vertex labelings of graphs. An L(2, 1)-labeling of a graph G is a function f from the …
Quaternion Orthogonal Designs From Complex Companion Designs, Sarah Adams, Jennifer Seberry, Nathaniel Karst, Jonathan Pollack, Tadeusz Wysocki
Quaternion Orthogonal Designs From Complex Companion Designs, Sarah Adams, Jennifer Seberry, Nathaniel Karst, Jonathan Pollack, Tadeusz Wysocki
Sarah Spence Adams
The success of applying generalized complex orthogonal designs as space–time block codes recently motivated the definition of quaternion orthogonal designs as potential building blocks for space–time-polarization block codes. This paper offers techniques for constructing quaternion orthogonal designs via combinations of specially chosen complex orthogonal designs. One technique is used to build quaternion orthogonal designs on complex variables for any even number of columns. A second related technique is applied to maximum rate complex orthogonal designs to generate an infinite family of quaternion orthogonal designs on complex variables such that the resulting designs have no zero entries. This second technique is …
The Final Case Of The Decoding Delay Problem For Maximum Rate Complex Orthogonal Designs, Sarah Adams, Nathaniel Karst, Mathav Murugan
The Final Case Of The Decoding Delay Problem For Maximum Rate Complex Orthogonal Designs, Sarah Adams, Nathaniel Karst, Mathav Murugan
Sarah Spence Adams
Complex orthogonal space-time block codes (COSTBCs) based on generalized complex orthogonal designs (CODs) have been successfully implemented in wireless systems with multiple transmit antennas and single or multiple receive antennas. It has been shown that for a maximum rate COD with 2m-1 or 2m columns, a lower bound on decoding delay is (m-1 2m) and this delay is achievable when the number of columns is congruent to 0, 1 , or 3 modulo 4. In this paper, the final case is addressed, and it is shown that when the number of columns is congruent to 2 modulo 4, the lower …
Trajectory Generation In High-Speed, High-Precision Micromilling Using Subdivision Surfaces, Athulan Vijayaraghavan, Angela Sodemann, Aaron Hoover, J. Mayor, David Dornfeld
Trajectory Generation In High-Speed, High-Precision Micromilling Using Subdivision Surfaces, Athulan Vijayaraghavan, Angela Sodemann, Aaron Hoover, J. Mayor, David Dornfeld
Aaron M. Hoover
Motion control in high-speed micromilling processes requires fast, accurate following of a specified curvilinear path. The accuracy with which the path can be followed is determined by the speed at which individual trajectories can be generated and sent to the control system. The time required to generate the trajectory is dependent on the representations used for the curvilinear trajectory path. In this study, we introduce the use of subdivision curves as a method for generating high-speed micromilling trajectories. Subdivision curves are discretized curves which are specified as a series of recursive refinements of a coarse mesh. By applying these recursive …
Optimal Synthesis Of Mite Translinear Loops, Shyam Subramanian, David Anderson, Paul Hasler, Bradley Minch
Optimal Synthesis Of Mite Translinear Loops, Shyam Subramanian, David Anderson, Paul Hasler, Bradley Minch
Bradley Minch
A procedure for synthesizing multiple-input translinear element (MITE) networks that implement a given system of translinear-loop equations (STLE) is presented. The minimum number of MITEs required for implementing the STLE, which is equal to the number of current variables in the STLE, is attained. The number of input gates ofthe MITEs is minimal amongst those MITE networks that satisfy the STLE and have the minimum number of MITEs. The synthesized MITE networks have a unique operating point and, in many cases, the network is guaranteed to be stable in a particular sense. This synthesis procedure exploits the relationship between MITEproduct-of-power-law …
Synthesis Of Static And Dynamic Multiple-Input Translinear Element Networks, Bradley Minch
Synthesis Of Static And Dynamic Multiple-Input Translinear Element Networks, Bradley Minch
Bradley Minch
In this paper, we discuss the process of synthesizing static and dynamic multiple-input translinear element (MITE) networks systematically from high-level descriptions given in the time domain, in terms of static polynomial constraints and algebraic differential equations. We provide several examples, illustrating the process for both static and dynamic system constraints. Although our examples will all involve MITE networks, the early steps of the synthesis process are equally applicable to the synthesis of static and dynamic translinear-loop circuits.
Synthesis Of Dynamic Multiple-Input Translinear Element Networks, Bradley Minch
Synthesis Of Dynamic Multiple-Input Translinear Element Networks, Bradley Minch
Bradley Minch
In this paper, the author discusses an approach to the synthesis of dynamic translinear circuits built from multiple-input translation elements (MITEs). In this method, we realize separately the basic static nonlinearities and dynamic signal-processing functions that when cascaded together, form the system that one wishes to construct. The circuit is then simplified systematically through local transformations that do not alter the behavior of the system. The author illustrates the method by synthesizing a simple nonlinear dynamical system, an RMS-DC converter.