• Title/Summary/Keyword: multiplication map

Search Result 31, Processing Time 0.02 seconds

α-feature map scaling for raw waveform speaker verification (α-특징 지도 스케일링을 이용한 원시파형 화자 인증)

  • Jung, Jee-weon;Shim, Hye-jin;Kim, Ju-ho;Yu, Ha-Jin
    • The Journal of the Acoustical Society of Korea
    • /
    • v.39 no.5
    • /
    • pp.441-446
    • /
    • 2020
  • In this paper, we propose the α-Feature Map Scaling (α-FMS) method which extends the FMS method that was designed to enhance the discriminative power of feature maps of deep neural networks in Speaker Verification (SV) systems. The FMS derives a scale vector from a feature map and then adds or multiplies them to the features, or sequentially apply both operations. However, the FMS method not only uses an identical scale vector for both addition and multiplication, but also has a limitation that it can only add a value between zero and one in case of addition. In this study, to overcome these limitations, we propose α-FMS to add a trainable parameter α to the feature map element-wise, and then multiply a scale vector. We compare the performance of the two methods: the one where α is a scalar, and the other where it is a vector. Both α-FMS methods are applied after each residual block of the deep neural network. The proposed system using the α-FMS methods are trained using the RawNet2 and tested using the VoxCeleb1 evaluation set. The result demonstrates an equal error rate of 2.47 % and 2.31 % for the two α-FMS methods respectively.

ON ℤpp[u]/k>-CYCLIC CODES AND THEIR WEIGHT ENUMERATORS

  • Bhaintwal, Maheshanand;Biswas, Soumak
    • Journal of the Korean Mathematical Society
    • /
    • v.58 no.3
    • /
    • pp.571-595
    • /
    • 2021
  • In this paper we study the algebraic structure of ℤpp[u]/k>-cyclic codes, where uk = 0 and p is a prime. A ℤpp[u]/k>-linear code of length (r + s) is an Rk-submodule of ℤrp × Rsk with respect to a suitable scalar multiplication, where Rk = ℤp[u]/k>. Such a code can also be viewed as an Rk-submodule of ℤp[x]/r - 1> × Rk[x]/s - 1>. A new Gray map has been defined on ℤp[u]/k>. We have considered two cases for studying the algebraic structure of ℤpp[u]/k>-cyclic codes, and determined the generator polynomials and minimal spanning sets of these codes in both the cases. In the first case, we have considered (r, p) = 1 and (s, p) ≠ 1, and in the second case we consider (r, p) = 1 and (s, p) = 1. We have established the MacWilliams identity for complete weight enumerators of ℤpp[u]/k>-linear codes. Examples have been given to construct ℤpp[u]/k>-cyclic codes, through which we get codes over ℤp using the Gray map. Some optimal p-ary codes have been obtained in this way. An example has also been given to illustrate the use of MacWilliams identity.

Enumerate tropical algebraic curves (열대곡선 헤아리기)

  • Kim, Young Rock;Shin, Yong-Su
    • Journal for History of Mathematics
    • /
    • v.30 no.3
    • /
    • pp.185-199
    • /
    • 2017
  • In tropical geometry, the sum of two numbers is defined as the minimum, and the multiplication as the sum. As a way to build tropical plane curves, we could use Newton polygons or amoebas. We study one method to convert the representation of an algebraic variety from an image of a rational map to the zero set of some multivariate polynomials. Mikhalkin proved that complex curves can be replaced by tropical curves, and induced a combination formula which counts the number of tropical curves in complex projective plane. In this paper, we present close examinations of this particular combination formula.

Design of a systolic radix-4 finite-field multiplier for the elliptic curve cryptography (타원곡선 암호를 위한 시스톨릭 Radix-4 유한체 곱셈기 설계)

  • Park Tae-Geun;Kim Ju-Young
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.43 no.3 s.345
    • /
    • pp.40-47
    • /
    • 2006
  • The finite-field multiplication can be applied to the elliptic curve cryptosystems. However, an efficient algorithm and the hardware design are required since the finite-field multiplication takes much time to compute. In this paper, we propose a radix-4 systolic multiplier on $GF(2^m)$ with comparative area and performance. The algorithm of the proposed standard-basis multiplier is mathematically developed to map on low-cost systolic cells, so that the proposed systolic architecture is suitable for VLSI design. Compared to the bit-parallel, bit-serial and systolic multipliers, the proposed multiplier has relatively effective high performance and low cost. We design and synthesis $GF(2^{193})$ finite-field multiplier using Hynix $0.35{\mu}m$ standard cell library and the maximum clock frequency is 400MHz.

New N-dimensional Basis Functions for Modeling Surface Reflectance (표면반사율 모델링을 위한 새로운 N차원 기저함수)

  • Kwon, Oh-Seol
    • Journal of Broadcast Engineering
    • /
    • v.17 no.1
    • /
    • pp.195-198
    • /
    • 2012
  • The N basis functions are typically chosen so that Surface reflectance functions(SRFs) and spectral power distributions (SPDs) can be accurately reconstructed from their N-dimensional vector codes. Typical rendering applications assume that the resulting mapping is an isomorphism where vector operations of addition, scalar multiplication, component-wise multiplication on the N-vectors can be used to model physical operations such as superposition of lights, light-surface interactions and inter-reflection. The vector operations do not mirror the physical. However, if the choice of basis functions is restricted to characteristic functions then the resulting map between SPDs/SRFs and N-vectors is anisomorphism that preserves the physical operations needed in rendering. This paper will show how to select optimal characteristic function bases of any dimension N (number of basis functions) and also evaluate how accurately a large set of Munsell color chips can approximated as basis functions of dimension N.

A Study on the Estimation of Soil Erosion Quantity Using USLE in the Upper Region of ManKyoung River Basin (USLE를 활용한 만경강 상류지역에서의 토양침식량 산정에 관한 연구)

  • Lee, Jae Hyug;Shim, Eun Jeung;Lee, Yeon Kil;Kim, Tae Woong
    • Journal of Wetlands Research
    • /
    • v.14 no.3
    • /
    • pp.317-328
    • /
    • 2012
  • The objects of this study are to perform appropriateness analysis of USLE(universal soil loss equation) model and to accumulate the data measured in field. The basin area of Bongdong station is $342.27km^2$. This study simulated sediment outflows in the basin and performed a comparative analysis of simulated outputs with actual measurement values. Also annual rainfall was used to calculate rainfall-runoff erosivity factor which can influence soil erosion. The calculation of annual average soil erosion was made by soil erosion maps. The maps with a resolution of ($30m{\times}30m$) were created by multiplication of factors(R, LS, K, C, P) from ArcView Map Calculator. In this paper, it was shown that soil erosion was not occur in the most of basin.

A Study on the Hardware Implementation of Competitive Learning Neural Network with Constant Adaptaion Gain and Binary Reinforcement Function (일정 적응이득과 이진 강화함수를 가진 경쟁학습 신경회로망의 디지탈 칩 개발과 응용에 관한 연구)

  • 조성원;석진욱;홍성룡
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.7 no.5
    • /
    • pp.34-45
    • /
    • 1997
  • In this paper, we present hardware implemcntation of self-organizing feature map (SOFM) neural networkwith constant adaptation gain and binary reinforcement function on FPGA. Whereas a tnme-varyingadaptation gain is used in the conventional SOFM, the proposed SOFM has a time-invariant adaptationgain and adds a binary reinforcement function in order to compensate for the lowered abilityof SOFM due to the constant adaptation gain. Since the proposed algorithm has no multiplication operation.it is much easier to implement than the original SOFM. Since a unit neuron is composed of 1adde $r_tracter and 2 adders, its structure is simple, and thus the number of neurons fabricated onFPGA is expected to he large. In addition, a few control signal: ;:rp sufficient for controlling !he neurons.Experimental results show that each componeni ot thi inipiemented neural network operates correctlyand the whole system also works well.stem also works well.

  • PDF

Investigation on Turbocharger Whine Noise in a Heavy-duty Diesel Engine (대형 디젤 엔진 터보차져 고주파 소음에 관한 연구)

  • Choi Sungbae;Jeong Yong-Jin;Yeo Seung-Dong
    • Proceedings of the Acoustical Society of Korea Conference
    • /
    • autumn
    • /
    • pp.235-238
    • /
    • 2000
  • Current diesel engines are usually equipped with turbochargers for improving fuel economy as well as meeting more stringent emission regulations. These turbochargers usually cause noise problems because they spins vey high such as 100,000 to 200,000 rpm, These noises are largely divided into whistle and whine noises. The frequency of whistle noise corresponds to their rotation speed, and the frequency of whine noise does to the multiplication of their rotation speed and the number of compressor blades. Turbocharger manufacturers developed a special type of compressor, effectively compressing air sucked from a duct; Recirculation Compressor Cover (RCC) or Map Width Enhancement (MWE). This special structure improves turbocharger's capability by expanding compressor's working area, but it seriously causes a noise problem, whine noise. There were many trials to surpress the noise occurred inside a compressor such as modification of a compressor, noise baffles or secondary measurements. However, it was currently concluded that the whine noise caused by the special compressor can not be reduced to that done by a standard compressor, and the strength difference of whine noises between the two compressors is not negligible. Thus, the standard compressor is decided to be applied to a newly developing heavy-duty diesel engine in order to resolve the turbocharger noise problem with a stiffened suction duct directly connected to a compressor.

  • PDF

Automated Areal Feature Matching in Different Spatial Data-sets (이종의 공간 데이터 셋의 면 객체 자동 매칭 방법)

  • Kim, Ji Young;Lee, Jae Bin
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.24 no.1
    • /
    • pp.89-98
    • /
    • 2016
  • In this paper, we proposed an automated areal feature matching method based on geometric similarity without user intervention and is applied into areal features of many-to-many relation, for confusion of spatial data-sets of different scale and updating cycle. Firstly, areal feature(node) that a value of inclusion function is more than 0.4 was connected as an edge in adjacency matrix and candidate corresponding areal features included many-to-many relation was identified by multiplication of adjacency matrix. For geometrical matching, these multiple candidates corresponding areal features were transformed into an aggregated polygon as a convex hull generated by a curve-fitting algorithm. Secondly, we defined matching criteria to measure geometrical quality, and these criteria were changed into normalized values, similarity, by similarity function. Next, shape similarity is defined as a weighted linear combination of these similarities and weights which are calculated by Criteria Importance Through Intercriteria Correlation(CRITIC) method. Finally, in training data, we identified Equal Error Rate(EER) which is trade-off value in a plot of precision versus recall for all threshold values(PR curve) as a threshold and decided if these candidate pairs are corresponding pairs or not. To the result of applying the proposed method in a digital topographic map and a base map of address system(KAIS), we confirmed that some many-to-many areal features were mis-detected in visual evaluation and precision, recall and F-Measure was highly 0.951, 0.906, 0.928, respectively in statistical evaluation. These means that accuracy of the automated matching between different spatial data-sets by the proposed method is highly. However, we should do a research on an inclusion function and a detail matching criterion to exactly quantify many-to-many areal features in future.

Analysis on Spectral Regrowth of Bandwidth Expansion Module by Quadrature Modulation Error in Digital Chirp Generator (디지털 첩 발생기에서의 직교 변조 오차에 의한 대역 확장 모듈에서의 스펙트럴 재성장 분석)

  • Kim, Se-Young;Sung, Jin-Bong;Lee, Jong-Hwan;Yi, Dong-Woo
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.21 no.7
    • /
    • pp.761-768
    • /
    • 2010
  • This paper presents an effective method to achieve the wideband waveform for high resolution SAR(Synthetic Aperture Radar) using the frequency multiplication technique. And also this paper analyzes the root causes for the spectral regrowth due to 3rd-order intermodulation in chirp bandwidth expansion scheme using quadrature modulator and frequency multipliers. The amplitude and phase imbalance requirement are defined based on the simulation results in terms of quadrature channel imbalance. This minimizes the degradation of range resolution, peak sidelobe ratio and integrated sidelobe ratio. The wideband chirp generator using the frequency multiplier and memory map scheme was manufactured and the compensation technique was presented to reduce the spectral regrowth of SAR waveform by minimizing the amplitude and phase imbalance. After I and Q channel imbalance adjustment, the carrier level reduces -28.7 dBm to -53.4 dBm. Chirp signal with 150 MHz bandwidth at S-band expands to 600 MHz bandwidth at X-band. The sidelobe levels are reduced by about 8 to 9 dB by compensating the amplitude balance between I and Q channels.