• 한국컴퓨터정보학회논문지
• /
• 제24권3호
• /
• pp.57-64
• /
• 2019

We consider the D2D sum utility maximization in the cellular system. D2D links reuse the uplink resource of cellular system. This reuse may cause severe interference to cellular users. To protect the cellular users, interference limit from the D2D links is required. In this setting, D2D sum utility maximization problem is investigated. Each D2D link has limited transmit power budget. Because optimum solution may require global information between links and computational complexity, we propose the distributed algorithm which only require the local information from each D2D link and simple broadcasting. Simulation results are provided to verify the performance of the proposed algorithm.

• 대한수학회보
• /
• 제59권6호
• /
• pp.1349-1357
• /
• 2022

Let 𝒜 = (A_n)_n≥0 be an increasing sequence of rings. We say that 𝓘 = (I_n)_n≥0 is an associated sequence of ideals of 𝒜 if I₀ = A₀ and for each n ≥ 1, I_n is an ideal of A_n contained in I_n+1. We define the polynomial ring and the power series ring as follows: $I[X]\, = \,\{\, f \,=\, {\sum}_{i=0}^{n}a_iX^i\,{\in}\,A[X]\,:\,n\,{\in}\,\mathbb{N},\,a_i\,{\in}\,I_i \,\}$ and $I[[X]]\, = \,\{\, f \,=\, {\sum}_{i=0}^{+{\infty}}a_iX^i\,{\in}\,A[[X]]\,:\,a_i\,{\in}\,I_i \,\}$. In this paper we study the Noetherian and the SFT properties of these rings and their consequences.

• 반도체디스플레이기술학회지
• /
• 제21권1호
• /
• pp.85-90
• /
• 2022

In this paper, an asynchronous nonvolatile memory module using a self-diagnosis function was designed. For the system to work, a lot of data must be input/output, and memory that can be stored is required. The volatile memory is fast, but data is erased without power, and the nonvolatile memory is slow, but data can be stored semi-permanently without power. The non-volatile static random-access memory is designed to solve these memory problems. However, the non-volatile static random-access memory is weak external noise or electrical shock, data can be some error. To solve these data errors, self-diagnosis algorithms were applied to non-volatile static random-access memory using error correction code, cyclic redundancy check 32 and data check sum to increase the reliability and accuracy of data retention. In addition, the possibility of application to an asynchronous non-volatile storage system requiring reliability was suggested.

• 전자공학회논문지B
• /
• 제33B권3호
• /
• pp.142-150
• /
• 1996

Monopulse technique has been widely used for a bearing estimation of a desired signal. This method can estimate the bearing of the signal with only one pulse, so computational load and complexity are low and its processes are simple. But if the desired signal incidents with interferences or multiple signals exist in the beams, the method fails to estimate correct signal angle. To solve this problem, the method to use adaptive array was proposed. In conventional adaptive array methods, sum beam was formed with fixed weights and ifference beam was formed with adaptive weights determined to minimize beamformer output power with one or more linear constraints, or an algorithm to minimize each sum beam and difference beams simultaneously using adaptively formed one basic beam. Theroretical analyses and simulation results show that the performance of the proposed method is superior to that of conventional algorithms.

• 전자공학회논문지D
• /
• 제35D권1호
• /
• pp.41-48
• /
• 1998

This paper proposes a new addition algorithm to improve the addition speed which is one of the important factors for data path functions. We have designed a fast 64-bit adder utilizing al dynamic chain architecture based on the proposed Sum-Selector Generation (SSG) algorithm. Proposed adder is designed with pass-transistor logicto achieve a high speed operation in low voltage circumstance. Realized 64-bit adder with 0.8.mu.m CMOS double-metal process technology has been fully tested. it operates at 185 MHz with 5.0V and chip area occupies 3.66mm$^{2}$. It is also demonstrated that designed adder operates even at 2.0V power supply condition.

• 디지털산업정보학회논문지
• /
• 제14권3호
• /
• pp.77-85
• /
• 2018

Multi-User Multiple-Input Multiple-Output (MU-MIMO) is the core technology for improving the channel capacity compared to Single-User MIMO (SU-MIMO) by using multiuser gain and spatial diversity. Key problem for the MU-MIMO is the user selection which is the grouping the users optimally. To solve this problem, we adopt Extreme Value Theory (EVT) at the beginning of the proposed algorithm, which defines a primary user set instead of a single user that has maximum channel power according to a predetermined threshold. Each user in the primary set is then paired with all of the users in the system to define user groups. By comparing these user groups, the group that produces a maximum sum rate can be determined. Through computer simulations, we have found that the proposed method outperforms the conventional technique yielding a sum rate that is 0.81 bps/Hz higher when the transmit signal to noise ratio (SNR) is 30 dB and the total number of users is 100.

• Journal of applied mathematics & informatics
• /
• 제41권3호
• /
• pp.553-567
• /
• 2023

There are real life situations in our lives where the things are changing continuously or from time to time. It is a very important problem for one whether to continue the existing relationship or to form a new one after some occasions. That is, people, companies, cities, countries, etc. may change their opinion or position rapidly. In this work, we think of the problem of changing relationships from a mathematical point of view and think of an answer. In some sense, we comment these changes as power changes. Our number theoretical model will be based on this idea. Using the convolution sum of the restricted divisor function E, we obtain the answer to this problem.

• 한국전기전자재료학회논문지
• /
• 제24권2호
• /
• pp.102-107
• /
• 2011

In multicell wireless systems with insufficient frequency reuse, user transmission will suffer other-cell interference (OCI). Cell cooperation is an effective way to mitigate OCI and increase the system sum rate. An adaptive scheme for serving one user in each cell was proposed in [1]. In this paper, we generalize that scheme by serving two users in each cell with adaptive zeroforcing beamforming (ZF) strategies. Based on our derived statistics of the signal-to-noise plus interference ratios, we choose the scheme to maximize the total ergodic sum-rate based on user locations. Through the numerical examples, we show that the total system sum rate can be improved by selecting appropriate transmitting strategy adaptively. As a result, our proposed system can explore spatial multiplexing gain without additional power and thus improves total system sum rate significantly.

• 대한전자공학회논문지TC
• /
• 제48권10호
• /
• pp.1-6
• /
• 2011

본 논문에서는 제한된 피드백 정보를 사용하는 MU-MIMO 하향링크 시스템에 준-대각선 및 구관 행렬, 그리고 동 이득 전송 기법을 이용한 차등 선부호화 기법을 적용하여 sum-rate 및 bit error rate 성능을 분석한다. 시뮬레이션과 성능분석을 통해 기존의 LTE 코드북보다 sum-rate 성능은 최소 0.6bps/Hz, BER 성능은 최소 4dB 개선됨을 보인다.

• 대한수학회지
• /
• 제47권5호
• /
• pp.879-897
• /
• 2010

Y. Hirano introduced the concept of a quasi-Armendariz ring which extends both Armendariz rings and semiprime rings. A ring R is called quasi-Armendariz if $a_iRb_j$ = 0 for each i, j whenever polynomials $f(x)\;=\;\sum_{i=0}^ma_ix^i$, $g(x)\;=\;\sum_{j=0}^mb_jx^j\;{\in}\;R[x]$ satisfy f(x)R[x]g(x) = 0. In this paper, we first extend the quasi-Armendariz property of semiprime rings to the skew polynomial rings, that is, we show that if R is a semiprime ring with an epimorphism $\sigma$, then f(x)R[x; $\sigma$]g(x) = 0 implies $a_iR{\sigma}^{i+k}(b_j)=0$ for any integer k $\geq$ 0 and i, j, where $f(x)\;=\;\sum_{i=0}^ma_ix^i$, $g(x)\;=\;\sum_{j=0}^mb_jx^j\;{\in}\;R[x,\;{\sigma}]$. Moreover, we extend this property to the skew monoid rings, the Ore extensions of several types, and skew power series ring, etc. Next we define $\sigma$-skew quasi-Armendariz rings for an endomorphism $\sigma$ of a ring R. Then we study several extensions of $\sigma$-skew quasi-Armendariz rings which extend known results for quasi-Armendariz rings and $\sigma$-skew Armendariz rings.