RISS 학술연구정보서비스

검색
다국어 입력

http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.

변환된 중국어를 복사하여 사용하시면 됩니다.

예시)
  • 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
  • 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
닫기
    인기검색어 순위 펼치기

    RISS 인기검색어

      검색결과 좁혀 보기

      선택해제
      • 좁혀본 항목 보기순서

        • 원문유무
        • 원문제공처
          펼치기
        • 등재정보
          펼치기
        • 학술지명
          펼치기
        • 주제분류
          펼치기
        • 발행연도
          펼치기
        • 작성언어
        • 저자
          펼치기

      오늘 본 자료

      • 오늘 본 자료가 없습니다.
      더보기
      • 무료
      • 기관 내 무료
      • 유료
      • KCI등재

        BER Performance Analysis of Strongest Channel Gain User for IRS NOMA with Rician Fading

        정규혁 한국인터넷방송통신학회 2023 International journal of advanced smart convergenc Vol.12 No.4

        Increasing demand for increasing higher data rate in order to solve computationally tasks timely and connecting many user equipment simultaneously have requested researchers to develop novel technology in the area of mobile communications. Intelligent reflecting surface (IRS) have been enabling technologies for commercialization of the fifth generation (5G) networks and the sixth generation (6G) systems. In this paper, we investigate a bit-error rate (BER) analysis on IRS technologies for non-orthogonal multiple access (NOMA) systems. First, we derive a BER expression for IRS-NOMA systems with Rician fading channels. Then, we validate the BER expression by Monte Carlo simulations, and show numerically that BER expressions are in good agreement with simulations. Moreover, we investigate the BER of IRS-NOMA systems with Rician fading channels for various numbers of IRS elements, and show that the BERs improve as the number of IRS elements increases.

      • KCI등재

        On Power Calculation for First and Second Strong Channel Users in M-user NOMA System

        정규혁 한국인터넷방송통신학회 2020 Journal of Advanced Smart Convergence Vol.9 No.3

        Non-orthogonal multiple access (NOMA) has been recognized as a significant technology in the fifth generation (5G) and beyond mobile communication, which encompasses the advanced smart convergence of the artificial intelligence (AI) and the internet of things (IoT). In NOMA, since the channel resources are shared by many users, it is essential to establish the user fairness. Such fairness is achieved by the power allocation among the users, and in turn, the less power is allocated to the stronger channel users. Especially, the first and second strong channel users have to share the extremely small amount of power. In this paper, we consider the power optimization for the two users with the small power. First, the closed-form expression for the power allocation is derived and then the results are validated by the numerical results. Furthermore, with the derived analytical expression, for the various channel environments, the optimal power allocation is investigated and the impact of the channel gain difference on the power allocation is analyzed.

      • KCI등재

        A Comparison of BER Performance for Receivers of NOMA in 5G Mobile Communication System

        정규혁 중소기업융합학회 2020 융합정보논문지 Vol.10 No.8

        In the fifth generation (5G) mobile networks, the mobile services require 100 times faster connections. One of the promising 5G technologies is non-orthogonal multiple access (NOMA). In NOMA, the users share the channel resources, so that the more users can be served simultaneously. There are several advantages offered by NOMA, such as higher spectrum efficiency and low transmission latency, compared to orthogonal multiple access (OMA), which is usually used in the fourth generation (4G) mobile networks, for example, long term evolution (LTE). In this paper, we compare the receivers for NOMA. The standard NOMA receiver, the non-SIC NOMA receiver, and the symmetric superposition coding (SC) NOMA receiver are compared. Specifically, it is shown that the performance of the standard receiver is the best, whereas the performances of the non-SIC receiver and symmetric SC receiver are dependent on the power allocation.

      • KCI등재

        Impact of Channel Estimation Errors on SIC Performance of NOMA in 5G Systems

        정규혁,Chung, Kyuhyuk Convergence Society for SMB 2020 융합정보논문지 Vol.10 No.9

        5G 시스템에서는, 통신 서비스가 4G 통신보다 더욱 더 빠른 망 연결을 요구한다. 최근, 선도적인 5G 기술들 중 하나로 비직교 다중접속이 주목받고 있다. 비직교 다중접속에서는 사용자들이 주파수와 시간을 공유하여, 더 많은 사용자들이 동시에 서비스를 받을 수가 있다. LTE와 같은 직교 다중접속과 비교하면, 비직교 다중접속은 더 큰 시스템 용량과 초저 지연과 같은 장점을 가진다. 본 논문에서는 비직교 다중접속의 SIC에 채널 추정 오류가 미치는 영향을 고찰한다. 우선, 채널 추정 오류를 가지는 수신기의 폐쇄형 수식을 구한다. 그리고 채널 추정 오류의 BER를 완벽한 채널 추정의 BER과 비교한다, 또한, 채널 추정 오류로 발생하는 SNR 손실을 분석한다. In the fifth generation (5G) networks, the mobile services require much faster connections than in the fourth generation (4G) mobile networks. Recently, as one of the promising 5G technologies, non-orthogonal multiple access (NOMA) has been drawing attention. In NOMA, the users share the frequency and time, so that the more users can be served simultaneously. NOMA has several superiorites over orthogonal multiple access (OMA) of long term evolution (LTE), such as higher system capacity and low transmission latency. In this paper, we investigate impact of channel estimation errors on successive interference cancellation (SIC) performance of NOMA. First, the closed-form expression of the bit-error rate (BER) with channel estimation errors is derived, And then the BER with channel estimation errors is compared to that with the perfect channel estimation. In addition, the signal-to-noise (SNR) loss due to channel estimation errors is analyzed.

      • KCI등재

        On Power of Correlated Superposition Coding in NOMA

        정규혁 한국전기전자학회 2020 전기전자학회논문지 Vol.24 No.1

        We present the power of the correlated superposition coding (SC) in non-orthogonal multiple access (NOMA). This paper derives closed-form expressions for the total allocated power with the constant total transmittedpower. It is shown that the total allocated power is the function of a correlation coefficient. In result, thecorrelated SC NOMA should be designed with consideration of the correlation coefficient.

      • KCI등재

        Numerical Analysis of Sufficient Condition on Larger Rate Volume of CIS/non-SIC over IIS/SIC in 3-User NOMA

        정규혁,Chung, Kyuhyuk Convergence Society for SMB 2021 융합정보논문지 Vol.11 No.8

        삼중 사용자 CIS/non-SIC 비직교 다중 접속의 IIS/SIC 비직교 다중 접속에 대한 확대된 전송률 용적의 충분조건에 대한 연구가 미비하여, 본 논문은 그러한 충분조건을 분석한다. 먼저, 삼중 상관 정보원/SIC 비직교 다중 접속의 전송률 용적이 삼중 독립 정보원/SIC 비직교 다중 접속의 전송률 용적의 일부와 일치하는 것을 입증한다. 다음, 우세 전송률 영역을 확인함으로써, 삼중 상관 정보원/non-SIC 비직교 다중 접속이 상중 독립 정보원/SIC 비직교 다중 접속에 대한 확대된 전송률 용적의 충분조건을 계산한다. 또한, 분석된 조건을 기반으로, 삼중 상관 정보원/non-SIC 비직교 다중 접속의 전송률 용적이 삼중 독립 정보원/SIC 비직교 다중 접속의 전송률 용적보다 확대될 수 있음을 보여준다. Since a sufficient condition on the larger rate volume of 3-user correlated information sources (CIS)/non-successive interference cancellation (SIC) non-orthogonal multiple access (NOMA) over independent information sources (IIS)/SIC NOMA has not been investigated, this paper analyzes such a sufficient condition. First, we demonstrates that the rate volume of 3-user CIS/SIC NOMA is the same as a portion of the rate volume of 3-user IIS/SIC NOMA. Then, by identifying a dominant rate region, we calculate the sufficient condition on the larger rate volume of 3-user CIS/non-SIC NOMA over 3-user IIS/SIC NOMA. We also show that with such condition, the rate volume of 3-user CIS/non-SIC NOMA can be larger than that of 3-user IIS/SIC NOMA.

      • KCI등재

        Upper Bounds for the Performance of Turbo-Like Codes and Low Density Parity Check Codes

        정규혁,허준 한국통신학회 2008 Journal of communications and networks Vol.10 No.1

        Researchers have investigated many upper bound techniques applicable to error probabilities on the maximum likelihood (ML) decoding performance of turbo-like codes and low density parity check (LDPC) codes in recent years for a long codeword block size. This is because it is trivial for a short codeword block size. Previous research efforts, such as the simple bound technique [20] recently proposed, developed upper bounds for LDPC codes and turbo-like codes using ensemble codes or the uniformly interleaved assumption. This assumption bounds the performance averaged over all ensemble codes or all interleavers. Another previous research effort [21] obtained the upper bound of turbo-like code with a particular interleaver using a truncated union bound which requires information of the minimum Hamming distance and the number of codewords with the minimum Hamming distance. However, it gives the reliable bound only in the region of the error floor where the minimumHamming distance is dominant, i.e., in the region of high signal-to-noise ratios. Therefore, currently an upper bound on ML decoding performance for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix cannot be calculated because of heavy complexity so that only average bounds for ensemble codes can be obtained using a uniform interleaver assumption. In this paper, we propose a new bound technique on ML decoding performance for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix using ML estimated weight distributions and we also show that the practical iterative decoding performance is approximately suboptimal in ML sense because the simulation performance of iterative decoding is worse than the proposed upper bound and no wonder, even worse than ML decoding performance. In order to show this point, we compare the simulation results with the proposed upper bound and previous bounds. The proposed bound technique is based on the simple bound with an approximate weight distribution including several exact smallest distance terms, not with the ensemble distribution or the uniform interleaver assumption. This technique also shows a tighter upper bound than any other previous bound techniques for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix.

      • KCI등재

        A Study on Improved Sum Rate of Cross-Correlated SC NOMA toward 6G URLLC

        정규혁,Chung, Kyuhyuk Convergence Society for SMB 2021 융합정보논문지 Vol.11 No.9

        최근 비직교 다중 접속에 대해, 단지 자체 상관 중첩 코딩 기법만 고찰되었기 때문에, 본 논문은 비직교 다중 접속에 대한 교차 상관 관계 중첩 코딩 기법을 제한한다. 먼저, 제안된 교차 상관 관계 중첩 코딩 기법의 총 전송률의 폐쇄형 수식을 유도한다. 다음 수치 해석을 기반으로 하여, 제안된 교차 상관 관계 중첩 코딩 기법의 총 전송률이 기존의 자체 상관 관계 중첩 코딩 기법의 총 전송률보다 향상된 것을 입증한다. 또한, 강 채널 사용자에 대해, 기존의 자체 상관 관계 중첩 코딩 기법과 비교하여, 제안된 교차 상관 관계 중첩 코딩 기법의 SNR 이득이 대략 15 임을 보여준다. 결론적으로, 제안된 교차 상관 관계 중첩 코딩 기법은 6G URLLC를 위한 유망한 기술로 고려될 수 있다. Since recently only an auto-correlated superposition coding (SC) scheme for non-orthogonal multiple access(NOMA) has been investigated, this paper proposes a cross-correlated SC scheme for NOMA. First, we derive the closed-form expression of the sum rate of the proposed cross-correlated SC scheme. Then, numerical analyses demonstrate that the sum rate of the proposed cross-correlated SC scheme is larger than that of the conventional auto-correlated SC scheme. We also show that for the stronger channel gain user, the signal-to-noise ratio (SNR) gain of the proposed cross-correlated SC scheme is about 15, compared with the conventional auto-correlated SC scheme. As a result, the proposed cross-correlated SC scheme could be a promising technology for 6G ultra-reliable low-latency communications (URLLC).

      • KCI등재

        A Tight Upper Bound on Capacity of Intelligent Reflecting Surface Transmissions Towards 6G Networks

        정규혁 한국인터넷방송통신학회 2022 Journal of Advanced Smart Convergence Vol.11 No.2

        To achieve the higher network capacity and mass connectivity in the forthcoming mobile network, revolutionary technologies have been considered. Recently, an upper bound on capacity of intelligent reflecting surface (IRS) transmissions towards the sixth generation (6G) mobile systems has been proposed. In this paper, we consider a tighter upper bound on capacity of IRS transmissions than the existing upper bound. First, using integration by parts, we derive an upper bound on capacity of IRS transmissions under Rician fading channels and a Rayleigh fading channel. Then, we show numerically that the proposed upper bound is closer to Monte Carlo simulations than the existing upper bound. Furthermore, we also demonstrate that the bounding error of the proposed upper bound is much smaller than that of the existing upper bound, and the superiority of the proposed upper bound over the existing upper bound becomes more significant as the signal-to-noise ratio (SNR) increases.

      연관 검색어 추천

      이 검색어로 많이 본 자료

      활용도 높은 자료

      해외이동버튼