• Title/Summary/Keyword: scaling sequence

Search Result 56, Processing Time 0.027 seconds

The main sequence of star forming galaxies at intermediate redshift

  • Salmi, Fadia
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.39 no.2
    • /
    • pp.71.2-71.2
    • /
    • 2014
  • processes at the origin of the star formation in the galaxies over the last 10 billions years. While it was proposed in the past that merging of galaxies has a dominant role to explain the triggering of the star formation in the distant galaxies having high star formation rates. In the opposite, more recent studies revealed scaling laws linking the star formation rate in the galaxies to their stellar mass or their gas mass. The small dispersion of these laws seems to be in contradiction with the idea of powerful stochastic events due to interactions, but rather in agreement with the new vision of galaxy history where the latter are continuously fed by intergalactic gas. I was especially interested in one of this scaling law, the relation between the star formation (SFR) and the stellar mass (M*) of galaxies, commonly called the main sequence of star forming galaxies. I have studied this main sequence, SFR-M*, in function of the morphology and other physical parameters as the radius, the colour, the clumpiness. The goal was to understand the origin of the sequence's dispersion related to the physical processes underlying this sequence in order to identify the main mode of star formation controlling this sequence. This work needed a multi-wavelength approach as well as the use of galaxies profile simulation to distinguish between the different galaxy morphological types implied in the main sequence.

  • PDF

A Scaling Trend of Variation-Tolerant SRAM Circuit Design in Deeper Nanometer Era

  • Yamauchi, Hiroyuki
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • v.9 no.1
    • /
    • pp.37-50
    • /
    • 2009
  • Evaluation results about area scaling capabilities of various SRAM margin-assist techniques for random $V_T$ variability issues are described. Various efforts to address these issues by not only the cell topology changes from 6T to 8T and 10T but also incorporating multiple voltage-supply for the cell terminal biasing and timing sequence controls of read and write are comprehensively compared in light of an impact on the required area overhead for each design solution given by ever increasing $V_T$ variation (${\sigma}_{VT}$). Two different scenarios which hinge upon the EOT (Effective Oxide Thickness) scaling trend of being pessimistic and optimistic, are assumed to compare the area scaling trends among various SRAM solutions for 32 nm process node and beyond. As a result, it has been shown that 6T SRAM will be allowed long reign even in 15 nm node if ${\sigma}_{VT}$ can be suppressed to < 70 mV thanks to EOT scaling for LSTP (Low Standby Power) process.

An Adaptive SLM Scheme Based on Peak Observation for PAPR Reduction in OFDM Systems (OFDM 시스템에서 PAPR 감소를 위한 피크 신호 관찰 기반의 적응적 SLM 기법)

  • Yang, Suck-Chel;Shin, Yo-An
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.12C
    • /
    • pp.1142-1148
    • /
    • 2007
  • In this paper, we propose ASLM (Adaptive Selective Mapping; ASLM) scheme based on peak observation for PAPR (Peak-to-Average Power Ratio) reduction of OFDM (Orthogonal Frequency Division Multiplexing) signals. The proposed scheme is composed of three steps: peak scaling, sequence selection, and SLM procedures. In the first step, the peak signal samples in the IFFT (Inverse Fast Fourier Transform) outputs of the original input sequence are scaled down. In the second step, the sub-carrier positions where the power difference between the original input sequence and the FFT output of the scaled signal is large, are identified. Then, the phase sequences having the maximum number of phase-reversed sequence words only for these positions are selected. Finally, the generic SLM procedure is performed by using only the selected phase sequences for the original input sequence. Simulation results show that the proposed scheme significantly reduces the complexity in terms of IFFT and PAPR calculation than the conventional SLM, while maintaining the PAPR reduction performance.

Relations between Gaussian width of Power Excess and Other Global Seismic Properties of Solar-like Stars from Main-sequence to Subgiant

  • Kim, Ki-Beom;Chang, Heon-Young
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.41 no.2
    • /
    • pp.58.3-58.3
    • /
    • 2016
  • The Kepler space mission provides quantitative and qualitative photometric time series of oscillating stars. It is possible to examine statistical study with seismic properties of solar-like stars. Global seismic properties - large frequency separation (${\Delta}{\nu}$), frequency of maximum power (${\nu}_{max}$) and amplitude of Gaussian envelope (A) widely have been used to determine empirical scaling relations for inferring the stellar physical quantities - mass, age and temperature. We aim to confirm whether width of Gaussian envelope on power excess (${\delta}{\nu}_{env}$) can be used with parameter of scaling relation before redgiant phase using Kepler data. Therefore we analyze the characteristics of ${\delta}{\nu}_{env}$ of 129 solar-like stars from main-sequence to subgiant. We have demonstrated that ${\delta}{\nu}_{env}$ has highly correlations with global parameters - ${\Delta}{\nu}$ and ${\nu}max$. We have also found the break of ${\delta}{\nu}_{env}-{\Delta}{\nu}$ and ${\nu}_{max}$ relations.

  • PDF

PROJECTIVE DOMAINS WITH NON-COMPACT AUTOMORPHISM GROUPS I

  • Yi, Chang-Woo
    • Journal of the Korean Mathematical Society
    • /
    • v.45 no.5
    • /
    • pp.1221-1241
    • /
    • 2008
  • Most of domains people have studied are convex bounded projective (or affine) domains. Edith $Soci{\acute{e}}$-$M{\acute{e}}thou$ [15] characterized ellipsoid in ${\mathbb{R}}^n$ by studying projective automorphism of convex body. In this paper, we showed convex and bounded projective domains can be identified from local data of their boundary points using scaling technique developed by several mathematicians. It can be found that how the scaling technique combined with properties of projective transformations is used to do that for a projective domain given local data around singular boundary point. Furthermore, we identify even unbounded or non-convex projective domains from its local data about a boundary point.

Adaptive SLM Scheme Based on Peak Observation for PAPR Reduction of OFDM Signals (OFDM PAPR 감소를 위한 피크 신호 관찰 기반의 적응적 SLM 기법)

  • Yang, Suck-Chel;Shin, Yoan
    • Proceedings of the IEEK Conference
    • /
    • 2006.06a
    • /
    • pp.15-16
    • /
    • 2006
  • In this paper, we propose an adaptive SLM scheme based on peak observation for PAPR reduction of OFDM signals. The proposed scheme is composed of three steps: peak scaling, sequence selection, and SLM procedures. In the first step, the peak signal samples in the IFFT outputs of the original input sequence are scaled down. In the second step, the sub-carrier positions where power difference between the original input sequence and the FFT outputs of the scaled signal is large, are identified. Then, the phase sequences which have the maximum number of phase-reversed sequence words only for these positions, are selected. Finally, only using the selected phase sequences, the generic SLM procedure is performed for the original input sequence. Simulation results reveal that the proposed adaptive SLM remarkably reduces the complexity in terms of IFFT and PAPR calculations than the conventional SLM, while maintaining the PAPR reduction performance.

  • PDF

Off-line CORDIC Vector Rotation Algorithm for High-Performance and Low-Power 3D Geometry Operations (고성능/저전력 3D 기하 연산을 위한 오프라인 CORDIC 벡터회전 알고리즘)

  • Kim, Eun-Ok;Lee, Jeong-Gun;Lee, Jeong-A
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.8
    • /
    • pp.763-767
    • /
    • 2008
  • In this paper, to make a high performance and low power CORDIC architecture for 3D operations in mobile devices, we suggest two off-line vectoring algorithms named Angle Based Search (ABS) and Scaling Considered Search (SCS). The ABS algorithm represents a 3D vector with two angles and those angles are used as a condition for searching CORDIC rotation sequences. The SCS algorithm determines the best CORDIC rotation sequence in advance to eliminate extra scaling computation. Using the proposed algorithms, we can observe 50% of latency is reduced. Furthermore, we perform a simple analysis and discuss possible reduction of power consumption by applying voltage scaling method together with the proposed algorithm.

Another representation of hand written English alphabets by a sequence of fuzzy sets

  • Moon, Byung-Soo
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.3 no.2
    • /
    • pp.157-160
    • /
    • 2003
  • In this paper, we describe how to represent lower case hand-written English alphabets by a sequence of two to seven fuzzy sets. Each fuzzy set represents an arc segment of the character and each arc segment is assumed to be a part of an ellipse. The part of an ellipse is defined by five quantities; its short and long radii, its orientation angle, whether it is a part of the lower half or the upper half, and whether it is the full half or a part of a half. Hence, we use the Cartesian product of five fuzzy sets to represent each arc segment. We show that this representation is a translation, rotation, and scaling invariant and that it can be used to generate the hand-written English alphabets. The representation we describe is different from the one proposed earlier by the author and when compared with the previous representation, the one described in this paper simulates more closely the behavior of how one writes English characters.

A Rule-based Optimal Placement of Scaling Shifts in Floating-point to Fixed-point Conversion for a Fixed-point Processor

  • Park, Sang-Hyun;Cho, Doo-San;Kim, Tae-Song;Paek, Yun-Heung
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • v.6 no.4
    • /
    • pp.234-239
    • /
    • 2006
  • In the past decade, several tools have been developed to automate the floating-point to fixed-point conversion for DSP systems. In the conversion process, a number of scaling shifts are introduced, and they inevitably alter the original code sequence. Recently, we have observed that a compiler can often be adversely affected by this alteration, and consequently fails to generate efficient machine code for its target processor. In this paper, we present an optimization technique that safely migrates scaling shifts to other places within the code so that the compiler can produce better-quality code. We consider our technique to be safe in that it does not introduce new overflows, yet preserving the original SQNR. The experiments on a commercial fixed-point DSP processor exhibit that our technique is effective enough to achieve tangible improvement on code size and speed for a set of benchmarks.

A SELF SCALING MULTI-STEP RANK ONE PATTERN SEARCH ALGORITHM

  • Moghrabi, Issam A.R.
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.15 no.4
    • /
    • pp.267-275
    • /
    • 2011
  • This paper proposes a new quickly convergent pattern search quasi-Newton algorithm that employs the multi-step version of the Symmetric Rank One (SRI). The new algorithm works on the factorizations of the inverse Hessian approximations to make available a sequence of convergent positive bases required by the pattern search process. The algorithm, in principle, resembles that developed in [1] with multi-step methods dominating the dervation and with numerical improvements incurred, as shown by the numerical results presented herein.