Iterative synthesis of threshold functions.
Iterative procedure for determining linear separability of Boolean function and threshold functions for logical switching circuit design
SWITCHING CIRCUIT↗
SEARCH · Search NASA
Results for “iterative thresholding”
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
Real-time image processing II; Proceedings of the Meeting, Orlando, FL, Apr. 16-18, 1990
The present conference discusses topics in the fields of feature extraction and implementation, filter and correlation algorithms, optical correlators, high-level algorithms, and digital image processing for ranging and remote driving. Attention is given to a nonlinear filter derived from topological image features, IR image segmentation through iterative thresholding, orthogonal subspaces for correlation masking, composite filter trees and image recognition via binary search, and features of matrix-coherent optical image processing. Also discussed are multitarget tracking via hybrid joint transform correlator, binary joint Fourier transform correlator considerations, global image processing operations on parallel architectures, real-time implementation of a differential range finder, and real-time binocular stereo range and motion detection.
Juday, Richard D.↗
Reducing the L-H transition power threshold in ITER-similar-shape DIII-D hydrogen plasmas
Recent dedicated DIII-D experiments in low-torque, ITER-similar-shape (ISS) hydrogen plasmas (at a plasma current I p ~ 1.5 MA and ITER-similar edge safety factor q 95 ~ 3.6) show that the L-H transition power threshold P LH can be reduced substantially (~30%) with L-mode helium admixtures n He /n e $\leqslant$ 25%. In the ensuing H-mode, helium ion fractions n He /n H remain below 25%. H-mode normalized pressure and confinement quality are only slightly affected by helium seeding, and Z eff $\leqslant$ 2.15 (including helium and carbon content). The plasmas investigated here are electron-heat dominated, with temperatures T e (0)/T i (0) $\geqslant$ 1 and edge heat flux ratio Q e /Q i (ρ = 0.95) ~ 1.2–1.5. Without mitigation, P LH is higher by a factor of 2–3 in comparison to similar ISS deuterium plasmas. ISS hydrogen plasmas with lower plasma current I p ~ 1 MA (increased edge safety factor q 95 ~ 5.1) exhibit a substantially lower power threshold. This plasma current dependence, also observed previously on ASDEX-U and in JET, is not accounted for by the commonly used 2008 ITPA multi-machine threshold scaling, but could potentially allow H-mode access at marginal heating power during the initial plasma current ramp-up. Attempts to reduce P LH with low-field- and high-field-side hydrogen pellet injection, using 1.7 mm diameter pellets, have not demonstrated a robust threshold reduction, in contrast to successful earlier experiments with larger 2.7 mm pellets. Finally, techniques for reducing P LH are very important for ITER, in particular for accessing H-mode in hydrogen plasmas during the Pre-Fusion Power Operation-1 (PFPO-1) campaign with marginal auxiliary heating power (20–30 MW of ECH).
70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
Use of reconstructed 3D equilibria to determine onset conditions of helical cores in tokamaks for extrapolation to ITER
The threshold for spontaneous symmetry breaking, which results in growth of m/n = 1/1 helical cores, in tokamaks is determined using VMEC. This model is based on a DIII-D hybrid discharge with helical core, and it predicts ITER (15MA scenario) to operate far in the helical core formation regime. Helical cores can only exist in tokamak discharges with monotonic but low, or reversed q-shear and qmin 1 in the core. The helical core is a saturated internal kink mode; its onset threshold is proportional to (dp/d)/B 2 t around q = 1. Below the threshold, applied 3-D fields can drive a helical core to finite size, as in DIIID. Above it, a random 3-D kick causes a bifurcation from axisymmetry and excites a spontaneous helical core. Helical cores occur frequently in C-Mod due to impurities; modeling shows the axisymmetric equilibrium becomes unstable at the end of the current ramp up due to the slow current penetration and a resultant reversed shear q-profile, which lowers the threshold. Lastly, a comparison of the helical core onset threshold for discharges from DIII-D, C-Mod and ITER confirms that while DIII-D is marginally stable, C-Mod and especially ITER are highly susceptible to helical core formation.
70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
Rate-Compatible Protograph LDPC Codes
Digital communication coding methods resulting in rate-compatible low density parity-check (LDPC) codes built from protographs. Described digital coding methods start with a desired code rate and a selection of the numbers of variable nodes and check nodes to be used in the protograph. Constraints are set to satisfy a linear minimum distance growth property for the protograph. All possible edges in the graph are searched for the minimum iterative decoding threshold and the protograph with the lowest iterative decoding threshold is selected. Protographs designed in this manner are used in decode and forward relay channels.
Nguyen, Thuy V.↗
Protograph LDPC Codes with Node Degrees at Least 3
In this paper we present protograph codes with a small number of degree-3 nodes and one high degree node. The iterative decoding threshold for proposed rate 1/2 codes are lower, by about 0.2 dB, than the best known irregular LDPC codes with degree at least 3. The main motivation is to gain linear minimum distance to achieve low error floor. Also to construct rate-compatible protograph-based LDPC codes for fixed block length that simultaneously achieves low iterative decoding threshold and linear minimum distance. We start with a rate 1/2 protograph LDPC code with degree-3 nodes and one high degree node. Higher rate codes are obtained by connecting check nodes with degree-2 non-transmitted nodes. This is equivalent to constraint combining in the protograph. The condition where all constraints are combined corresponds to the highest rate code. This constraint must be connected to nodes of degree at least three for the graph to have linear minimum distance. Thus having node degree at least 3 for rate 1/2 guarantees linear minimum distance property to be preserved for higher rates. Through examples we show that the iterative decoding threshold as low as 0.544 dB can be achieved for small protographs with node degrees at least three. A family of low- to high-rate codes with minimum distance linearly increasing in block size and with capacity-approaching performance thresholds is presented. FPGA simulation results for a few example codes show that the proposed codes perform as predicted.
low density parity check (LDPC)↗
Error-Field Penetration Thresholds in Ohmically Heated ITER and SPARC Plasmas
The critical n=1, n=2, and n=3 error-field amplitudes needed to trigger error-field penetration in ITER and SPARC, steady-state, ohmically heated plasmas are calculated using a standard asymptotic matching approach. The calculation incorporates plasma impurities, trapped particles, the bootstrap current, and neoclassical poloidal flow-damping. The energy confinement time is specified by the neo-Alcator scaling law in the low-density linear ohmic confinement (LOC) regime, and by the ITER-89P L-mode scaling law in the high-density saturated ohmic confinement regime (SOC) regime. The response of the plasma in the inner region is calculated using a linearized version of the four-field model. At the normal operating electron number density, diamagnetic levels of rotation are found to be sufficient to protect ITER and SPARC ohmically heated plasmas from m=2/n=1 error-field penetration. On other hand, SPARC, and especially ITER, ohmically heated plasmas may be vulnerable to n>1 error-field penetration. ITER and SPARC ohmically heated plasmas are also slightly more susceptible to error-field penetration when the electron fluid at the rational surface rotates in the ion diamagnetic direction, rather than the electron diamagnetic direction. At electron number densities that are sufficiently low that the plasma lies in the LOC confinement regime, the error-field penetration threshold increases with increasing density. However, as soon as the electron number density becomes large enough that the plasma enters the SOC regime, the increase in the error-field penetration threshold with increasing density levels off.
70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
Aperture‐Synthesis Radar Imaging With Compressive Sensing for Ionospheric Research
Abstract Inverse methods involving compressive sensing are tested in the application of two‐dimensional aperture‐synthesis imaging of radar backscatter from field‐aligned plasma density irregularities in the ionosphere. We consider basis pursuit denoising, implemented with the fast iterative shrinkage thresholding algorithm, and orthogonal matching pursuit (OMP) with a wavelet basis in the evaluation. These methods are compared with two more conventional optimization methods rooted in entropy maximization (MaxENT) and adaptive beamforming (linearly constrained minimum variance or often “Capon's Method.”) Synthetic data corresponding to an extended ionospheric radar target are considered. We find that MaxENT outperforms the other methods in terms of its ability to recover imagery of an extended target with broad dynamic range. Fast iterative shrinkage thresholding algorithm performs reasonably well but does not reproduce the full dynamic range of the target. It is also the most computationally expensive of the methods tested. OMP is very fast computationally but prone to a high degree of clutter in this application. We also point out that the formulation of MaxENT used here is very similar to OMP in some respects, the difference being that the former reconstructs the logarithm of the image rather than the image itself from basis vectors extracted from the observation matrix. MaxENT could in that regard be considered a form of compressive sensing.
Hysell, D. L.↗
Construction of Protograph LDPC Codes with Linear Minimum Distance
A construction method for protograph-based LDPC codes that simultaneously achieve low iterative decoding threshold and linear minimum distance is proposed. We start with a high-rate protograph LDPC code with variable node degrees of at least 3. Lower rate codes are obtained by splitting check nodes and connecting them by degree-2 nodes. This guarantees the linear minimum distance property for the lower-rate codes. Excluding checks connected to degree-1 nodes, we show that the number of degree-2 nodes should be at most one less than the number of checks for the protograph LDPC code to have linear minimum distance. Iterative decoding thresholds are obtained by using the reciprocal channel approximation. Thresholds are lowered by using either precoding or at least one very high-degree node in the base protograph. A family of high- to low-rate codes with minimum distance linearly increasing in block size and with capacity-approaching performance thresholds is presented. FPGA simulation results for a few example codes show that the proposed codes perform as predicted.
Low-density parity-check (LDPC)↗
Optimal Binarization of Gray-Scaled Digital Images via Fuzzy Reasoning
A technique for finding an optimal threshold for binarization of a gray scale image employs fuzzy reasoning. A triangular membership function is employed which is dependent on the degree to which the pixels in the image belong to either the foreground class or the background class. Use of a simplified linear fuzzy entropy factor function facilitates short execution times and use of membership values between 0.0 and 1.0 for improved accuracy. To improve accuracy further, the membership function employs lower and upper bound gray level limits that can vary from image to image and are selected to be equal to the minimum and the maximum gray levels, respectively, that are present in the image to be converted. To identify the optimal binarization threshold, an iterative process is employed in which different possible thresholds are tested and the one providing the minimum fuzzy entropy measure is selected.
Dominguez, Jesus A.↗
Optical implementation of inner product neural associative memory
An optical implementation of an inner-product neural associative memory is realized with a first spatial light modulator for entering an initial two-dimensional N-tuple vector and for entering a thresholded output vector image after each iteration until convergence is reached, and a second spatial light modulator for entering M weighted vectors of inner-product scalars multiplied with each of the M stored vectors, where the inner-product scalars are produced by multiplication of the initial input vector in the first iterative cycle (and thresholded vectors in subsequent iterative cycles) with each of the M stored vectors, and the weighted vectors are produced by multiplication of the scalars with corresponding ones of the stored vectors. A Hughes liquid crystal light valve is used for the dual function of summing the weighted vectors and thresholding the sum vector. The thresholded vector is then entered through the first spatial light modulator for reiteration of the process cycle until convergence is reached.
Liu, Hua-Kuang↗
Joint Sparsity Pattern Recovery With 1-b Compressive Sensing in Distributed Sensor Networks
In this paper, we study the problem of joint sparse support recovery with 1-b quantized compressive measurements in a distributed sensor network. Multiple nodes in the network are assumed to observe sparse signals having the same but unknown sparse support. Each node quantizes its measurement vector element-wise to 1 b. First, we consider that all the quantized measurements are available at a central fusion center. We derive performance bounds for sparsity pattern recovery using 1-bit quantized measurements from multiple sensors when the maximum likelihood decoder is employed. We further develop two computationally tractable algorithms for joint sparse support recovery in the centralized setting. One algorithm minimizes a cost function defined as the sum of the likelihood function and the l-∝ quasi-norm, while the other algorithm extends the binary iterative hard thresholding algorithm to the multiple measurement vector case. Second, we consider a decentralized setting where each node transmits 1-b measurements to its one-hop neighbors. The basic idea behind the algorithms developed in the decentralized setting is to embed collaboration among nodes and fusion strategies. We show that even with noisy 1-b compressed measurements, joint support recovery can be carried out accurately in both centralized and decentralized settings. Additionally, we further show that the performance of the proposed 1-bit compressive sensing-based algorithms is very close to that of their real-valued counterparts except when the signal-to-noise ratio is very small.
97 MATHEMATICS AND COMPUTING↗
Assessing Edge Localized Mode (ELM) Mitigation by Pellet Triggering in Smallest-Possible Affordable Robust Compact (SPARC) Low-Collisionality Discharges
Simulations of pellet edge-localized mode (ELM) triggering with the M3D-C1 code confirmed experimentally observed pellet mass thresholds in low-collisionality DIII-D discharges and predicted extremely large thresholds in ITER. The linear (static) and nonlinear (dynamic) workflows developed in this previous work are now applied to the SPARC tokamak. Multiple synthetic equilibria for the high-performance H-mode scenario are tested for MHD stability without pellets using the linear workflow and ELITE simulations; a stable one is identified. Pellets of various mass are injected along an inboard, near-midplane trajectory in the M3D-C1 simulation. No pellet mass threshold for ELM triggering can be found for realistic pellet masses, concluding that fueling from this injection location would not trigger ELMs. A poloidal scan of possible injection locations shows very high thresholds on the high-field side and reasonable thresholds on the low-field-side (LFS). Based on results of this work the location for a LFS injection was finalized in the SPARC design. For this LFS injection the pellet mass threshold is determined using the linear workflow, aligning well with the poloidal scan.
70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
Protograph based LDPC codes with minimum distance linearly growing with block size
We propose several LDPC code constructions that simultaneously achieve good threshold and error floor performance. Minimum distance is shown to grow linearly with block size (similar to regular codes of variable degree at least 3) by considering ensemble average weight enumerators. Our constructions are based on projected graph, or protograph, structures that support high-speed decoder implementations. As with irregular ensembles, our constructions are sensitive to the proportion of degree-2 variable nodes. A code with too few such nodes tends to have an iterative decoding threshold that is far from the capacity threshold. A code with too many such nodes tends to not exhibit a minimum distance that grows linearly in block length. In this paper we also show that precoding can be used to lower the threshold of regular LDPC codes. The decoding thresholds of the proposed codes, which have linearly increasing minimum distance in block size, outperform that of regular LDPC codes. Furthermore, a family of low to high rate codes, with thresholds that adhere closely to their respective channel capacity thresholds, is presented. Simulation results for a few example codes show that the proposed codes have low error floors as well as good threshold SNFt performance.
minimum decoding↗
Assessing Edge Localized Mode (ELM) Mitigation by Pellet Triggering in Smallest-Possible Affordable Robust Compact (SPARC) Low-Collisionality Discharges
Simulations of pellet edge-localized mode (ELM) triggering with the M3D-C1 code confirmed experimentally observed pellet mass thresholds in low-collisionality DIII-D discharges and predicted extremely large thresholds in ITER [A. Wingen et al, Nucl. Fusion 64, 066015(2024)]. The linear (static) and nonlinear (dynamic) workflows developed in this previous work are now applied to the SPARC tokamak. Multiple synthetic equilibria for the high-performance H-mode scenario are tested for MHD stability without pellets using the linear workflow and ELITE simulations; a stable one is identified. Pellets of various mass are injected along an inboard, near-midplane trajectory in the M3D-C1 simulation. No pellet mass threshold for ELM triggering can be found for realistic pellet masses, concluding that fueling from this injection location would not trigger ELMs. A poloidal scan of possible injection locations shows very high thresholds on the high-field side and reasonable thresholds on the low-field-side (LFS). Based on results of this work the location for a LFS injection was finalized in the SPARC design. For this LFS injection the pellet mass threshold is determined using the linear workflow, aligning well with the poloidal scan.
70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
LDPC Codes with Minimum Distance Proportional to Block Size
Low-density parity-check (LDPC) codes characterized by minimum Hamming distances proportional to block sizes have been demonstrated. Like the codes mentioned in the immediately preceding article, the present codes are error-correcting codes suitable for use in a variety of wireless data-communication systems that include noisy channels. The previously mentioned codes have low decoding thresholds and reasonably low error floors. However, the minimum Hamming distances of those codes do not grow linearly with code-block sizes. Codes that have this minimum-distance property exhibit very low error floors. Examples of such codes include regular LDPC codes with variable degrees of at least 3. Unfortunately, the decoding thresholds of regular LDPC codes are high. Hence, there is a need for LDPC codes characterized by both low decoding thresholds and, in order to obtain acceptably low error floors, minimum Hamming distances that are proportional to code-block sizes. The present codes were developed to satisfy this need. The minimum Hamming distances of the present codes have been shown, through consideration of ensemble-average weight enumerators, to be proportional to code block sizes. As in the cases of irregular ensembles, the properties of these codes are sensitive to the proportion of degree-2 variable nodes. A code having too few such nodes tends to have an iterative decoding threshold that is far from the capacity threshold. A code having too many such nodes tends not to exhibit a minimum distance that is proportional to block size. Results of computational simulations have shown that the decoding thresholds of codes of the present type are lower than those of regular LDPC codes. Included in the simulations were a few examples from a family of codes characterized by rates ranging from low to high and by thresholds that adhere closely to their respective channel capacity thresholds; the simulation results from these examples showed that the codes in question have low error floors as well as low decoding thresholds. As an example, the illustration shows the protograph (which represents the blueprint for overall construction) of one proposed code family for code rates greater than or equal to 1.2. Any size LDPC code can be obtained by copying the protograph structure N times, then permuting the edges. The illustration also provides Field Programmable Gate Array (FPGA) hardware performance simulations for this code family. In addition, the illustration provides minimum signal-to-noise ratios (Eb/No) in decibels (decoding thresholds) to achieve zero error rates as the code block size goes to infinity for various code rates. In comparison with the codes mentioned in the preceding article, these codes have slightly higher decoding thresholds.
Divsalar, Dariush↗
Accumulate-Repeat-Accumulate-Accumulate-Codes
Inspired by recently proposed Accumulate-Repeat-Accumulate (ARA) codes [15], in this paper we propose a channel coding scheme called Accumulate-Repeat-Accumulate-Accumulate (ARAA) codes. These codes can be seen as serial turbo-like codes or as a subclass of Low Density Parity Check (LDPC) codes, and they have a projected graph or protograph representation; this allows for a high-speed iterative decoder implementation using belief propagation. An ARAA code can be viewed as a precoded Repeat-and-Accumulate (RA) code with puncturing in concatenation with another accumulator, where simply an accumulator is chosen as the precoder; thus ARAA codes have a very fast encoder structure. Using density evolution on their associated protographs, we find examples of rate-lJ2 ARAA codes with maximum variable node degree 4 for which a minimum bit-SNR as low as 0.21 dB from the channel capacity limit can be achieved as the block size goes to infinity. Such a low threshold cannot be achieved by RA or Irregular RA (IRA) or unstructured irregular LDPC codes with the same constraint on the maximum variable node degree. Furthermore by puncturing the accumulators we can construct families of higher rate ARAA codes with thresholds that stay close to their respective channel capacity thresholds uniformly. Iterative decoding simulation results show comparable performance with the best-known LDPC codes but with very low error floor even at moderate block sizes.
density evolution↗
Accumulate repeat accumulate codes
In this paper we propose an innovative channel coding scheme called 'Accumulate Repeat Accumulate codes' (ARA). This class of codes can be viewed as serial turbo-like codes, or as a subclass of Low Density Parity Check (LDPC) codes, thus belief propagation can be used for iterative decoding of ARA codes on a graph. The structure of encoder for this class can be viewed as precoded Repeat Accumulate (RA) code or as precoded Irregular Repeat Accumulate (IRA) code, where simply an accumulator is chosen as a precoder. Thus ARA codes have simple, and very fast encoder structure when they representing LDPC codes. Based on density evolution for LDPC codes through some examples for ARA codes, we show that for maximum variable node degree 5 a minimum bit SNR as low as 0.08 dB from channel capacity for rate 1/2 can be achieved as the block size goes to infinity. Thus based on fixed low maximum variable node degree, its threshold outperforms not only the RA and IRA codes but also the best known LDPC codes with the dame maximum node degree. Furthermore by puncturing the accumulators any desired high rate codes close to code rate 1 can be obtained with thresholds that stay close to the channel capacity thresholds uniformly. Iterative decoding simulation results are provided. The ARA codes also have projected graph or protograph representation that allows for high speed decoder implementation.
Low Density Parity Check codes (LDPC)↗