• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제27권2호
• /
• pp.97-108
• /
• 2020

In this paper, we prove common fixed point theorems for two mappings by using simulation function on fuzzy metric spaces. We also deduce some consequences in modular metric spaces.

• 전자공학회논문지C
• /
• 제34C권9호
• /
• pp.33-42
• /
• 1997

Fixed-point optimization utility software that can aid scaling and wordlength determination of digital signal processign algorithms written in C or C$\^$++/ language is developed. This utility consists of two programs: the range estimator and the fixed-point simulator. The former estimates the ranges of floating-point variables for automatic scaling purpose, and the latter translates floating-point programs into fixed-point equivalents for evaluating te fixed-point performance by simulation. By exploiting the operator overloading characteristics of C$\^$++/ language, the range estimation and the fixed-point simulation can be conducted just by modifying the variable declaration of the original program. This utility is easily applicable to nearly all types of digital signal processing programs including non-linear, time-varying, multi-rate, and multi-dimensional signal processing algorithms. In addition, this software can be used for comparing the fixed-point characteristics of different implementation architectures.

• Nonlinear Functional Analysis and Applications
• /
• 제26권1호
• /
• pp.137-155
• /
• 2021

In this paper, first, we prove some common fixed point theorems for the generalized contraction condition under newly defined modified simulation function which generalize and include many results in the literature. Second, we give two numerical examples with graphical representations for verifying the proposed results. Third, we discuss and study a set of common fixed point theorems for two pairs (finite families) of self-mappings. Finally, we give some applications of our results in discrete and functional fractional economic systems.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2000년도 제15차 학술회의논문집
• /
• pp.259-259
• /
• 2000

In the recent, the size of hardware is smaller and the structure is simpler, without reducing the performance of the digital controller. Accordingly, the fixed-point arithmetic is very important in the digital controller. This paper presents simulation to apply the robust control algorithms to DVDR servo controller using the floating-point and fixed-point arithmetic from the matlab. Also, it analyses and compares the performance of control algorithms in the each of point calculation and presents a method for improvement of drop in the performance, quantization error and overflow/underflow from using the fixed-point arithmetic

• 전자공학회논문지A
• /
• 제29A권3호
• /
• pp.96-105
• /
• 1992

The use of fixed-point digital signal processors, such as the TMS 320C25, requires scaling of data at each arithmetic step to prevent overflows while keeping the accuracy. A software which automatizes this process is developed for TMS 320C25. The programmers use a model of a hypothetical floating-point digital signal processor and a floating-point format for data representation. However, the program and data are automatically translated to a fixed-point version by this software. Thus, the execution speed is not sacrificed. A fixed-point variable has a unique binary-point location, which is dependent on the range of the variable. The range is estimated from the floating-point simulation. The number of shifts needed for arithmetic or data transfer step is determined by the binary-points of the variables associated with the operation. A fixed-point code generator is also developed by using the proposed automatic scaling software. This code generator produces floating-point assembly programs from the specifiations of FIR, IIR, and adaptive transversal filters, then floating-point programs are transformed to fixed-point versions by the automatic scaling software.

• 대한전자공학회논문지TC
• /
• 제43권11호
• /
• pp.95-117
• /
• 2006

본 논문에서는 IEEE 802.16e OFDMA/TDD 이동국 모뎀의 링크 성능과 복잡도 최적화를 위한 부동 및 고정 소수점 설계에 대하여 논한다. 부동 소수점 설계에서는 이동국 모뎀에서 하향링크 트래픽 채널의 채널 추정 방법을 제안하고, 모의실험을 통하여 최적의 알고리즘을 선정한다. 그리고 시간 및 주파수 동기화, Digital Front End와 CINR 추정 기법에 관하여 성능 향상과 시스템을 최적화하기 위한 알고리즘을 제안하고, 상향링크의 트래픽 채널과 제어 채널의 부동 소수점 설계 방법을 논한다. 제안된 알고리즘은 IEEE 802.16e OFDMA/TDD 시스템에 적용하여, 모의실험을 통한 성능을 Detection Probability, Mean Acqusition Time, PER 성능 그래프 등으로 그 우수성을 검증한다. 고정 소수점 설계에서는 부동 소수점 설계로부터 최적의 고정 소수점 설계를 위한 효율적인 방법론을 제시한다. 그리고 하향링크와 상향링크의 트래픽 채널, 시간 및 주파수 동기, DFE 블록을 고정 소수점 설계하고, 모의실험을 통하여 성능과 복잡도 간의 tradeoff 관계를 최적화한다.

• 대한수학회논문집
• /
• 제35권4호
• /
• pp.1107-1121
• /
• 2020

The purpose of this paper is to introduce the notion of generalized multivalued Ƶ-contraction and generalized multivalued Suzuki type Ƶ-contraction for pair of mappings and establish common fixed point theorems for such mappings in complete metric spaces. Results obtained in this paper extend and generalize some well known fixed point results of the literature. We deduce some corollaries from our main result and provide examples in support of our results.

• Nonlinear Functional Analysis and Applications
• /
• 제26권2호
• /
• pp.273-288
• /
• 2021

We proposed to give some new 𝜓-coupled fixed point theorems using simulation function coupled with other control functions in a complete partially ordered metric space which includes many related results. Further we prove the existence of solution of a fractional integral equation by using this fixed point theorem and explain it with the help of an example.

• 한국통신학회논문지
• /
• 제31권6A호
• /
• pp.593-602
• /
• 2006

본 논문에서는 IEEE 802.16e에 기반한 OFDMA TDD 시스템 하향 링크 트래픽 채널의 fixed-point 구현을 위해 Floating-point 모델로부터 성능 열화와 하드웨어 복잡도를 최소화 할 수 있도록 적절한 비트 사이즈를 결정하는 방법론에 대하여 기술한다. Fixed-point 구현에 있어서 여러 가지 고려 사항 중 하나는 비트 사이즈를 절사하는 방법에 따른 Saturation과 Quantization의 선택이며, 반드시 주의해야 할 점은 신호의 분포를 정확히 파악한 후 신호의 분포에 맞도록 Saturation과 Quantization 중 하나의 비트 절사방법을 적절히 적용시켜야 한다는 점이다. 또한, 시행착오를 거치면서 여러 비트 사이즈에 대하여 모의 실험을 수행하여야만 성능 열화를 최소화 하면서 원하는 비트 사이즈를 얻을 수 있다. 본 논문에서는 수신단의 트래픽 채널에 최적화된 비트 사이즈를 결정하기 위하여 AWGN 및 ITU-R M.1225의 Veh-A 채널 환경에서 컴퓨터 모의 실험을 수행한다.

• 대한전기학회논문지
• /
• 제40권4호
• /
• pp.331-341
• /
• 1991

The discrete cosine transform (DCT) is widely used in many signal processing areas, including image and speech data compression. In this paper, we investigate a fixed-point error analysis for fast DCT algorithms, namely, Lee [6], Hou [7] and Vetterli [8]. A statistical model for fixed-point error is analyzed to predict the output noise due to the fixed-point implementation. This paper deals with two's complement fixed-point data representation with truncation and rounding. For a comparison purpose, we also investigate the direct form DCT algorithm. We also propose a suitable scaling model for the fixed-point implementation to avoid an overflow occurring in the addition operation. Computer simulation results reveal that there is a close agreement between the theoretical and the experimental results. The result shows that Vetterli's algorithm is better than the other algorithms in terms of SNR.