<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="/resources/xsl/jats-html.xsl"?>
<article article-type="research-article" dtd-version="1.1" xml:lang="ko" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
	<journal-meta>
		<journal-id journal-id-type="publisher-id">jkits</journal-id>
		<journal-title-group>
		<journal-title>한국지식정보기술학회 논문지</journal-title>
		<journal-title xml:lang="en">Journal of Knowledge Information Technology and Systems</journal-title>
		</journal-title-group>
		<issn pub-type="ppub">1975-7700</issn>
		<publisher>
		<publisher-name>한국지식정보기술학회</publisher-name>
		<publisher-name xml:lang="en">Korea Knowledge Information Technology Society</publisher-name>
		</publisher>
	</journal-meta>
	<article-meta>
		<article-id pub-id-type="publisher-id">jkits_2019_14_05_527</article-id>
		<article-id pub-id-type="doi">10.34163/jkits.2019.14.5.009</article-id>
		<article-categories>
			<subj-group>
				<subject>Research Article</subject>
			</subj-group>
		</article-categories>
		<title-group>
			<article-title>OFDM 통신 시스템을 위한 경량 SNR 추정 알고리즘</article-title>
			<trans-title-group xml:lang="en">
				<trans-title>A Low-complexity Time-domain SNR Estimation Algorithm for OFDM Communication Systems</trans-title>
			</trans-title-group>
		</title-group>
		<contrib-group>
			<contrib contrib-type="author" xlink:type="simple">
				<name-alternatives>
					<name name-style="eastern">
						<surname>구</surname><given-names>지훈</given-names>
					</name>
					<name name-style="western" xml:lang="en">
						<surname>Koo</surname><given-names>Jihun</given-names>
					</name>
				</name-alternatives>
										<xref ref-type="aff" rid="A1"><sup>1</sup></xref>
			</contrib>
			<contrib contrib-type="author" xlink:type="simple">
				<name-alternatives>
					<name name-style="eastern">
						<surname>윤</surname><given-names>하영</given-names>
					</name>
					<name name-style="western" xml:lang="en">
						<surname>Yoon</surname><given-names>Hayoung</given-names>
					</name>
				</name-alternatives>
										<xref ref-type="aff" rid="A1"><sup>2</sup></xref>
										<xref ref-type="fn" rid="fn001"><sup>*</sup></xref>
			</contrib>
								</contrib-group>
		<aff-alternatives id="A1">
				<aff><sup>1</sup><italic>오산대학교 스마트IT과 조교수</italic></aff>
			<aff xml:lang="en"><italic>Department of Smart IT, Osan University</italic></aff>
		</aff-alternatives>
				<aff-alternatives id="A2">
				<aff><sup>2</sup><italic>오산대학교 디지털콘텐츠디자인과 조교수</italic></aff>
				<aff xml:lang="en"><italic>Department of Digital Contents Design, Osan University</italic></aff>
					</aff-alternatives>
		<author-notes>
			<fn id="fn001"><label>*</label><p>Corresponding author is with the Department of Smart
IT, Osan University, 45 Cheonghak-ro, Osan-si, Gyeonggi-do, KOREA.</p><p><italic>E-mail address</italic>: <email>jihun.koo@osan.ac.kr</email></p></fn>
		</author-notes>
		<pub-date pub-type="ppub">
			<month>10</month>
			<year>2019</year>
		</pub-date>
		<volume>14</volume>
		<issue>5</issue>
		<fpage>527</fpage>
		<lpage>534</lpage>
		<history>
			<date date-type="received">
				<day>11</day>
				<month>9</month>
				<year>2019</year>
			</date>
			<date date-type="rev-recd">
				<day>5</day>
				<month>10</month>
				<year>2019</year>
			</date>
			<date date-type="accepted">
				<day>11</day>
				<month>10</month>
				<year>2019</year>
			</date>
		</history>
		<permissions>
			<copyright-statement>&#x00A9; 2019 KKITS All rights reserved</copyright-statement>
			<copyright-year>2019</copyright-year>
		</permissions>
		<abstract>
			<title>요약</title>
			<p>직교 주파수 분할 멀티플렉싱(Orthogonal frequency division multiplexing: OFDM)은 고속의 송신 신호를 다수의 직교하는 협대역 부 반송파로 변조시켜 다중화하는 기술로, 개별 OFDM 심볼이 받는 주파수 선택적 페이딩에 강한 특성을 가지고 있어서 4G 및 5G 이동통신과 같은 광대역 디지털 통신 시스템과 무선 근거리 통신망 (WLAN) 등에서 필수적으로 사용되고 있다. 그러나 모든 채널 환경에 적합한 단일화 된 심볼검출기 및 채널추정 등은 실제 사용에 어려움이 있어서 통신 시스템의 각 블록에 SNR에 기반을 둔 알고리즘들이 사용되고 있다. 따라서 SNR 추정 정확도가 중요한 OFDM무선통신 시스템의 주요한 성능요소가 되었다. 본 논문에서는 OFDM 통신 시스템 중 대표적인 IEEE802.11규격을 기준으로 시간영역 기반 SNR 추정을 간략화한 방법을 제안하였다. 제안된 방법은 시간 영역 SNR 추정을 기반으로 근사화 되었으며, 제곱연산이나 나눗셈 연산이 없이 간단히 구현 가능한 구조로 제시되고, 모사실험을 통해 그 성능을 보여주었다. 근사화가 없는 시간영역 SNR 추정과 비교하였을 때, AWGN과 채널모델 D의 주파수 페이딩 채널 환경에서 각각 약 0.5dB와 0.2dB의 낮고 일정한 오차를 보이고 있으며, 통신 시스템의 성능을 좌우하는 낮은 SNR 영역에서 기존의 근사화 방법 대비 제안한 방법이 효과적으로 사용될 수 있음을 보여주었다.</p>
		</abstract>
		<trans-abstract xml:lang="en">
			<title>ABSTRACT</title>
			<p>Orthogonal Frequency Division Multiplexing technology is a multi-carrier modulation technique that uses multiple narrowband subcarriers for high speed data transmission, wherein each subcarrier carrying corresponding data bit, among which are orthogonal to each other. Because of its strong resistance to frequency selective fading, it is indispensable for broadband digital communication systems such as 4G and 5G, and wireless local area networks. However, since the unified symbol detector and channel estimation suitable for all channel environments are difficult in practical cases, algorithms using estimated SNR are used in each block of the communication system. Therefore, SNR estimation accuracy has become a major performance factor in an important OFDM wireless communication system. In this paper, we propose a simplified method of time-domain based SNR estimation based on the representative IEEE802.11 standard among OFDM communication systems. The proposed method is approximated based on time-domain SNR estimation, presented as a simple implementation without square or division, and its performance is shown by simulation. Compared with the time-domain SNR estimation without approximation, it shows low and constant errors of about 0.5 dB and 0.2 dB in the frequency fading channel environment of AWGN and channel model D, respectively. And, it is shown that the proposed method can be effectively used compared to the existing approximation method in the low SNR region that influences the performance of the communication system.</p>
		</trans-abstract>
		<kwd-group kwd-group-type="author" xml:lang="en">
			<kwd>OFDM Systems</kwd>
			<kwd>SNR estimation</kwd>
			<kwd>Preamble</kwd>
			<kwd>Signal to noise ratio</kwd>
			<kwd>IEEE802.11</kwd>
		</kwd-group>
	</article-meta>
</front>
<body>
<sec id="sec001" sec-type="intro">
<title>1. 서 론</title>
<p>직교 주파수 분할 멀티플렉싱 (Orthogonal Frequency Division Multiplexing: OFDM)은 고속의 송신 신호를 다수의 직교하는 협대역 부 반송파로 변조시켜 다중화 하는 기술로, 개별 OFDM 심볼이 받는 주파수 선택적 페이딩에 강한 특성을 가지고 있어서 4G 및 5G 이동통신과 같은 광대역 디지털 통신 시스템과 무선 근거리 통신망 (WLAN) 등에서 필수적으로 사용되고 있다[<xref ref-type="bibr" rid="B001">1</xref>,<xref ref-type="bibr" rid="B002">2</xref>].</p>
<p>IEEE 802.11에서 사용하는 OFDM 규격의 경우, 유한 길이 N의 IDFT(Inverse Discrete Fourier Transforms)에 의해 변환 된 각 심볼의 시작 부분에 길이 <italic>v</italic>의 cyclic prefix (CP)를 추가함으로써 연속적인 OFDM 심볼의 직교성을 보호하고 있다. 결과적으로, 길이 <italic>v</italic>의 CP를 심볼마다 추가하여 송신된 OFDM 심볼 하나의 길이는 <italic>N</italic> + <italic>v</italic> 샘플이 된다. 또, 각 OFDM 심볼 간 간섭과 부반송파 간 간섭을 피하기 위해서 <italic>v</italic>의 길이는 사용되는 환경의 채널 임펄스 응답 (Channel impulse response: CIR)보다 커야한다<xref ref-type="bibr" rid="B003">[3]</xref>.</p>
<p>이와 같이 OFDM 시스템이 주파수 선택적 감쇠에 우수한 특성을 보이지만 M-ary QAM 변조된 심볼은 통과 채널의 의해 크기와 위상의 감쇠를 겪게 되므로, 채널에서 겪는 감쇠를 추정하여 보상해 주어야 한다<xref ref-type="bibr" rid="B004">[4]</xref>.</p>
<p>송신단에서 심볼은 변조기를 통한 후 파일럿 부반송파 샘플이 추가된다. 파일럿 부반송파란 송신단에서 수신 단으로 하여금 반송파 위상 동기화 및 기지국 정보의 획득 등에 도움이 되도록 약속된 규약의 신호를 의미한다. 이후, DFT(Inverse Discrete Fourier Transforms) 변환 후 VCO에 의해 생성 된 반송파 주파수와 혼합하여 송신하게 된다. 무선 채널을 통과 한 후, 수신기의 고주파 전단 부는 수신기 VCO에 의해 생성 된 반송파 주파수와 혼합하여 기저 대역 신호를 생성하게 된다. 기저대역 수신기는 CP를 제거하고 DFT(Discrete Fourier Transforms) 블록에 의해 각 OFDM 심볼당 마지막 N 개의 샘플만을 취한다<xref ref-type="bibr" rid="B003">[3]</xref>. &#x003C;<xref ref-type="fig" rid="f001">그림 1</xref>&#x003E;은 설명된 OFDM 통신 시스템의 블록 다이어그램을 보여주고 있다.</p>
<fig id="f001" orientation="portrait" position="float">
	<label>그림 1 :</label>
	<caption>
		<title>OFDM 통신 시스템의 블록 다이어그램</title>
		<p>Figure 1: Block diagram of OFDM communicatio systems</p>
	</caption>
	<graphic xlink:href="../ingestImageView?artiId=ART002516899&amp;imageName=jkits_2019_14_05_527_f001.jpg" position="float" orientation="portrait" xlink:type="simple"></graphic>
</fig>
<p>본 논문에서는 SNR 추정 방법에 대해서 다루고 있으며, 추정된 SNR은 심볼검출기 및 채널추정, 등화기는 물론이고 기타 SNR에 기반을 둔 알고리즘이 사용되는 각 블록에 사용된다[<xref ref-type="bibr" rid="B004">4</xref>-<xref ref-type="bibr" rid="B007">7</xref>].</p>
<p>정확한 SNR 추정을 위해서 여러 연구들이 있었다. 가산형 백색가우시안 잡음(AWGN: Additive White Gaussian Noise) 채널을 위해 SNR 추정 방법<xref ref-type="bibr" rid="B008">[8]</xref>은 채널 계수가 대역폭에 따라 다르기 때문에 주파수 선택적 페이딩 채널에 적용 시 어려움이 있다. Ren<xref ref-type="bibr" rid="B009">[9]</xref>는 신호 전력이 두 번째 순서 모멘트로부터 추정되는 동안 두 개의 동일한 OFDM 훈련 심볼로부터 얻어진 최소 제곱(LS) 채널 추정치를 사용하여 노이즈 차이를 추정하는 방법을 제안했다. <xref ref-type="bibr" rid="B010">[10]</xref>에서Zivkovic는 주기적으로 사용되는 하위 캐리어(PS 추정기)를 기반으로 낮은 복잡성 추정기(PS 추정기)를 제안하였으나 사용되는 하위 캐리어의 수가 감소함에 따라 정확도가 떨어지게 된다.</p>
<p>OFDM 통신 시스템 중 대표적인 IEEE802.11규격에 따르면 amendment 버전 n부터 빔 성형 및 공간 다중화 통신, amendment 버전 ac부터 MU-MIMO를 가능하도록 표준화 되었다. 이를 위해서는 정확한 SNR 및 SINR 추정이 필수적이며 공간 다중화 성능의 주요한 파마미터로 자리 잡게 되었다[<xref ref-type="bibr" rid="B003">3</xref>, <xref ref-type="bibr" rid="B011">11</xref>]. 이를 위해 위너 필터 채널 추정을 사용하여 추정된 채널의 인접한 서브 캐리어 정보를 이용하여 채널 정보를 보간하고 평활화 함으로써 하나의 서브 캐리어상의 MIMO 채널을 추정하는 연구가 있었으며[<xref ref-type="bibr" rid="B012">12</xref>-<xref ref-type="bibr" rid="B013">13</xref>], 이에 대한 탁월한 성능이 보고되었다[<xref ref-type="bibr" rid="B014">14</xref>-<xref ref-type="bibr" rid="B015">15</xref>].</p>
<fig id="f002" orientation="portrait" position="float">
	<label>그림 2 :</label>
	<caption>
		<title>시간 도메인에서의 SNR 추정 과정</title>
		<p>Figure 2: SNR estimation process on time-domain</p>
	</caption>
	<graphic xlink:href="../ingestImageView?artiId=ART002516899&amp;imageName=jkits_2019_14_05_527_f002.jpg" position="float" orientation="portrait" xlink:type="simple"></graphic>
</fig>
<p>본 논문은 OFDM 통신 시스템 중 대표적인 IEEE802.11규격을 기준으로 기술되었으며, 다음과 같이 구성되었다. 2장에서는 시간영역에서의 SNR 추정 방법을 기술하고, 3장에서는 2장에서 기술된 SNR 추정 방법과 근사한 성능을 보일 수 있는 SNR 추정 방법을 제안하였다. 또한 4장에서는 제안된 SNR 추정방법의 성능을 모사실험을 통해 증명하였으며, 마지막으로 5장에서는 본 논문의 결론의 제시하였다.</p>
</sec>
<sec id="sec002">
<title>2. 시간영역에서 SNR 추정 방법</title>
<p>프리앰블을 이용한 SNR 추정은 각 패킷의 시작 부분에 반복되는 두 개의 L-LTF 심볼들을 이용한다. L-LTF 심볼은 연속하여 두 번 수신되어 이를 이용한 SNR 연산이 time-domain 상에서 가능하다.</p>
<p>첫 번째 LTF 심볼과 두 번째 LTF 심볼은 각각 <italic>LTF</italic><sub>1</sub>(<italic>t</italic>)와 <italic>LTF</italic><sub>2</sub>(<italic>t</italic>)로 표현될 수 있다. 여기서 두 LTF 심벌간의 Common Phase offset은 보상이 되었다고 간주하면 <italic>LTF</italic><sub>1</sub>(<italic>t</italic>)와 <italic>LTF</italic><sub>2</sub>(<italic>t</italic>)는 아래와 같이 표현될 수 있다.</p>
<disp-formula-group>
	<disp-formula id="dm01">
		<label>(1)</label>
<mml:math id="dm01-1"><mml:mi>L</mml:mi><mml:mi>T</mml:mi><mml:msub><mml:mi>F</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mfenced><mml:mi>t</mml:mi></mml:mfenced><mml:mo>=</mml:mo><mml:mi>h</mml:mi><mml:msup><mml:mfenced><mml:mi>t</mml:mi></mml:mfenced><mml:mo>*</mml:mo></mml:msup><mml:mi>s</mml:mi><mml:mfenced><mml:mi>t</mml:mi></mml:mfenced><mml:mo>+</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mspace linebreak="newline"/><mml:mo>=</mml:mo><mml:mstyle displaystyle="false"><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mi>l</mml:mi></mml:munder></mml:mstyle><mml:msub><mml:mi>h</mml:mi><mml:mi>l</mml:mi></mml:msub><mml:mfenced><mml:mi>t</mml:mi></mml:mfenced><mml:mi>s</mml:mi><mml:mfenced><mml:mrow><mml:mi>t</mml:mi><mml:mo>-</mml:mo><mml:msub><mml:mi>&#x3C4;</mml:mi><mml:mi>l</mml:mi></mml:msub></mml:mrow></mml:mfenced><mml:mo>+</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mspace linebreak="newline"/><mml:mi>L</mml:mi><mml:mi>T</mml:mi><mml:msub><mml:mi>F</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mfenced><mml:mi>t</mml:mi></mml:mfenced><mml:mo>=</mml:mo><mml:mi>h</mml:mi><mml:msup><mml:mfenced><mml:mi>t</mml:mi></mml:mfenced><mml:mo>*</mml:mo></mml:msup><mml:mi>s</mml:mi><mml:mfenced><mml:mi>t</mml:mi></mml:mfenced><mml:mo>+</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mspace linebreak="newline"/><mml:mo>=</mml:mo><mml:mstyle displaystyle="false"><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mi>l</mml:mi></mml:munder></mml:mstyle><mml:msub><mml:mi>h</mml:mi><mml:mi>l</mml:mi></mml:msub><mml:mfenced><mml:mi>t</mml:mi></mml:mfenced><mml:mi>s</mml:mi><mml:mfenced><mml:mrow><mml:mi>t</mml:mi><mml:mo>-</mml:mo><mml:msub><mml:mi>&#x3C4;</mml:mi><mml:mi>l</mml:mi></mml:msub></mml:mrow></mml:mfenced><mml:mo>+</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:math>
	</disp-formula>
</disp-formula-group>
<p>여기서 h(t), s(t) 그리고 <italic>n</italic><sub><italic>i</italic></sub>(<italic>i</italic>=1, 2)는 각각 채널 응답, time-domain LTF sequence 그리고 가산형백색가오시안잡음(Additive White Gaussian Noise: AWGN)을 나타낸다.</p>
<p>AWGN 채널에서, LTF1과 LTF2의 합과 차에 대한 신호 전력은 다음식과 같이 나타낼 수 있다.</p>
<disp-formula-group>
	<disp-formula id="dm02">
		<label>(2)</label>
<mml:math id="dm02-1"><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>g</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mstyle displaystyle="true"><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:munderover></mml:mstyle><mml:mo>&#xFF5C;</mml:mo><mml:mi>L</mml:mi><mml:mi>T</mml:mi><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>,</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mfenced><mml:mi>i</mml:mi></mml:mfenced><mml:mo>+</mml:mo><mml:mi>L</mml:mi><mml:mi>T</mml:mi><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>,</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mfenced><mml:mi>i</mml:mi></mml:mfenced><mml:msup><mml:mo>&#xFF5C;</mml:mo><mml:mn>2</mml:mn></mml:msup></mml:mrow><mml:mi>N</mml:mi></mml:mfrac><mml:mspace linebreak="newline"/><mml:mo>&#x2245;</mml:mo><mml:mn>4</mml:mn><mml:msubsup><mml:mi>&#x3B4;</mml:mi><mml:mi>s</mml:mi><mml:mn>2</mml:mn></mml:msubsup><mml:mo>+</mml:mo><mml:mn>2</mml:mn><mml:msubsup><mml:mi>&#x3B4;</mml:mi><mml:mi>s</mml:mi><mml:mn>2</mml:mn></mml:msubsup><mml:mspace linebreak="newline"/><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mi>o</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mstyle displaystyle="true"><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:munderover><mml:mo>&#xFF5C;</mml:mo><mml:mi>L</mml:mi><mml:mi>T</mml:mi><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>,</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mfenced><mml:mi>i</mml:mi></mml:mfenced><mml:mo>-</mml:mo><mml:mi>L</mml:mi><mml:mi>T</mml:mi><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>,</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mfenced><mml:mi>i</mml:mi></mml:mfenced><mml:msup><mml:mo>&#xFF5C;</mml:mo><mml:mn>2</mml:mn></mml:msup></mml:mstyle><mml:mi>N</mml:mi></mml:mfrac><mml:mspace linebreak="newline"/><mml:mo>&#x2245;</mml:mo><mml:mn>2</mml:mn><mml:msubsup><mml:mi>&#x3B4;</mml:mi><mml:mi>n</mml:mi><mml:mn>2</mml:mn></mml:msubsup><mml:mspace linebreak="newline"/></mml:math>
	</disp-formula>
</disp-formula-group>
<p>여기서, <mml:math id="dm001"><mml:mi>h</mml:mi><mml:mfenced><mml:mi>t</mml:mi></mml:mfenced><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#xA0;</mml:mo><mml:mi>E</mml:mi><mml:mfenced open="[" close="]"><mml:msubsup><mml:mi>&#x3B4;</mml:mi><mml:mi>s</mml:mi><mml:mn>2</mml:mn></mml:msubsup></mml:mfenced><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>E</mml:mi><mml:mfenced open="[" close="]"><mml:msubsup><mml:mi>n</mml:mi><mml:mn>1</mml:mn><mml:mn>2</mml:mn></mml:msubsup></mml:mfenced><mml:mo>&#x2245;</mml:mo><mml:mi>E</mml:mi><mml:mfenced open="[" close="]"><mml:msubsup><mml:mi>n</mml:mi><mml:mn>2</mml:mn><mml:mn>2</mml:mn></mml:msubsup></mml:mfenced><mml:mo>&#x2245;</mml:mo><mml:mn>2</mml:mn><mml:msubsup><mml:mi>&#x3B4;</mml:mi><mml:mi>n</mml:mi><mml:mn>2</mml:mn></mml:msubsup><mml:mspace linebreak="newline"/></mml:math>라고 가정한다.</p>
<fig id="f003" orientation="portrait" position="float">
	<label>그림 3 :</label>
	<caption>
		<title>제안된 SNR 추정 과정</title>
		<p>Figure 3: Proposed SNR estimation process</p>
	</caption>
	<graphic xlink:href="../ingestImageView?artiId=ART002516899&amp;imageName=jkits_2019_14_05_527_f003.jpg" position="float" orientation="portrait" xlink:type="simple"></graphic>
</fig>
<p>위 가정 하에 추정된 SNR은 아래와 같이 표현될 수 있다 .</p>
<disp-formula-group>
	<disp-formula id="dm03">
		<label>(3)</label>
<mml:math id="dm03-1"><mml:mi>S</mml:mi><mml:mi>N</mml:mi><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>d</mml:mi><mml:mi>B</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>10</mml:mn><mml:msub><mml:mi>log</mml:mi><mml:mn>10</mml:mn></mml:msub><mml:mfrac><mml:mn>1</mml:mn><mml:mn>2</mml:mn></mml:mfrac><mml:mfenced><mml:mrow><mml:mfrac><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>g</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mi>o</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mfrac><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:mfenced><mml:mspace linebreak="newline"/></mml:math>
	</disp-formula>
</disp-formula-group>
<p>또한, Fading 채널에서의 수신신호의 크기는 다음식과 같이 표현될 수 있다.</p>
<disp-formula-group>
	<disp-formula id="dm04">
		<label>(4)</label>
<mml:math id="dm04-1"><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>g</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mstyle displaystyle="true"><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:munderover></mml:mstyle><mml:mo>&#xFF5C;</mml:mo><mml:mi>L</mml:mi><mml:mi>T</mml:mi><mml:msub><mml:mi>F</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mfenced><mml:mi>t</mml:mi></mml:mfenced><mml:mo>+</mml:mo><mml:mi>L</mml:mi><mml:mi>T</mml:mi><mml:msub><mml:mi>F</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mfenced><mml:mi>t</mml:mi></mml:mfenced><mml:mo>&#xFF5C;</mml:mo><mml:msup><mml:maction actiontype="argument"><mml:mrow/></mml:maction><mml:mn>2</mml:mn></mml:msup></mml:mrow><mml:mi>N</mml:mi></mml:mfrac><mml:mspace linebreak="newline"/><mml:mo>=</mml:mo><mml:mfrac><mml:mstyle displaystyle="true"><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:munderover><mml:mo>&#xFF5C;</mml:mo><mml:mn>2</mml:mn><mml:mo>&#xB7;</mml:mo><mml:msub><mml:mo>&#x2211;</mml:mo><mml:mi>l</mml:mi></mml:msub><mml:msub><mml:mi>h</mml:mi><mml:mi>l</mml:mi></mml:msub><mml:mi>s</mml:mi><mml:mfenced><mml:mrow><mml:mi>t</mml:mi><mml:mo>-</mml:mo><mml:msub><mml:mi>&#x3C4;</mml:mi><mml:mi>l</mml:mi></mml:msub></mml:mrow></mml:mfenced><mml:mo>+</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>&#xFF5C;</mml:mo><mml:msup><mml:maction actiontype="argument"><mml:mrow/></mml:maction><mml:mn>2</mml:mn></mml:msup></mml:mstyle><mml:mi>N</mml:mi></mml:mfrac><mml:mspace linebreak="newline"/><mml:mo>=</mml:mo><mml:mfrac><mml:mstyle displaystyle="true"><mml:mn>4</mml:mn><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:munderover><mml:mo>&#xFF5C;</mml:mo><mml:msub><mml:mo>&#x2211;</mml:mo><mml:mi>l</mml:mi></mml:msub><mml:msub><mml:mi>h</mml:mi><mml:mi>l</mml:mi></mml:msub><mml:mi>s</mml:mi><mml:mfenced><mml:mrow><mml:mi>t</mml:mi><mml:mo>-</mml:mo><mml:msub><mml:mi>&#x3C4;</mml:mi><mml:mi>l</mml:mi></mml:msub></mml:mrow></mml:mfenced><mml:mo>&#xFF5C;</mml:mo><mml:msup><mml:maction actiontype="argument"><mml:mrow/></mml:maction><mml:mn>2</mml:mn></mml:msup><mml:mo>+</mml:mo><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:munderover><mml:mo>&#xFF5C;</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>&#xFF5C;</mml:mo><mml:msup><mml:maction actiontype="argument"><mml:mrow/></mml:maction><mml:mn>2</mml:mn></mml:msup></mml:mstyle><mml:mi>N</mml:mi></mml:mfrac></mml:math>
	</disp-formula>
</disp-formula-group>
<p>결과적으로, 시간영역에서 SNR 추정 과정은 &#x003C;<xref ref-type="fig" rid="f002">그림 2</xref>&#x003E;와 같이 도식될 수 있으며, 추정된 SNR은 바로 다음 연속된 심벌 보정 등에 활용 될 수 있으므로 연산 지연이 없는 하드웨어로 주로 구현되고 있다. 도식된 시간 영역 SNR 추정은 OFDM 통신의 다른 블록에 비해 많은 연산 양을 차지하고 있지 않으나 제곱이나 나눗셈 연산 등은 하드웨어 구현을 위해 대체 가능한 방법을 찾는 것이 지향된다.</p>
<p>데이터 서브 케리어 및 파일롯 톤 등을 이용한 SNR 연구[<xref ref-type="bibr" rid="B009">9</xref>, <xref ref-type="bibr" rid="B010">10</xref>]가 계속 진행되고 있으나, 본 논문에서는 NDP (Null Data Packet)을 감안하여 프리앰블만을 이용한 시간영역 SNR 추정을 저 복잡도로 간략화 하는 방법을 제안 하고자 한다.</p>
</sec>
<sec id="sec003">
<title>3. 제안하는 방법</title>
<p>LTF 심벌은 주파수 도메인에서 의사 랜덤 시퀀스를 사용하기 때문에 시간 도메인 샘플은 즉 원형 <italic>s</italic>(<italic>i</italic>)대칭 가우시안 랜덤 변수로 근사될 수 있으며, <mml:math id="m05-1-1"><mml:mi>C</mml:mi><mml:mi>N</mml:mi><mml:mfenced><mml:mrow><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:msubsup><mml:mi>&#x3C3;</mml:mi><mml:mi>s</mml:mi><mml:mn>2</mml:mn></mml:msubsup></mml:mrow></mml:mfenced><mml:mo>&#xA0;</mml:mo></mml:math> AWGN 채널의 가정 하에 <italic>h</italic>(<italic>i</italic>)=1 이며, 시간 도메인 샘플을 다음 식과 같이 표현할 수 있다.</p>
<disp-formula-group>
	<disp-formula id="dm05">
		<label>(5)</label>
<mml:math id="dm05-1"><mml:mi>L</mml:mi><mml:mi>T</mml:mi><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>,</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mfenced><mml:mi>i</mml:mi></mml:mfenced><mml:mo>=</mml:mo><mml:mi>s</mml:mi><mml:mfenced><mml:mi>i</mml:mi></mml:mfenced><mml:mo>+</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mfenced><mml:mi>i</mml:mi></mml:mfenced><mml:mspace linebreak="newline"/><mml:mi>L</mml:mi><mml:mi>T</mml:mi><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>,</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mfenced><mml:mi>i</mml:mi></mml:mfenced><mml:mo>=</mml:mo><mml:mi>s</mml:mi><mml:mfenced><mml:mi>i</mml:mi></mml:mfenced><mml:mo>+</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mfenced><mml:mi>i</mml:mi></mml:mfenced></mml:math>
	</disp-formula>
</disp-formula-group>
<p>또, 두 LTF 심볼의 <italic>i</italic>번째 샘플의 합계는 다음과 같이 표현될 수 있다.</p>
<disp-formula-group>
	<disp-formula id="dm06">
		<label>(6)</label>
<mml:math id="dm06-1"><mml:mi>y</mml:mi><mml:mfenced><mml:mi>i</mml:mi></mml:mfenced><mml:mo>=</mml:mo><mml:mi>L</mml:mi><mml:mi>T</mml:mi><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>,</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mfenced><mml:mi>i</mml:mi></mml:mfenced><mml:mo>+</mml:mo><mml:mi>L</mml:mi><mml:mi>T</mml:mi><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>,</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mfenced><mml:mi>i</mml:mi></mml:mfenced></mml:math>
	</disp-formula>
</disp-formula-group>
<p>여기서 <italic>s</italic><sub>1</sub>(<italic>i</italic>), <italic>s</italic><sub>2</sub>(<italic>i</italic>), <italic>n</italic><sub>1</sub>(<italic>i</italic>), <italic>n</italic><sub>2</sub>(<italic>i</italic>)는 독립적인 가우시안 랜덤 변수이기 때문에 <italic>y</italic>(<italic>t</italic>)는 <mml:math id="m001-2"><mml:mi>C</mml:mi><mml:mi>N</mml:mi><mml:mfenced><mml:mrow><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>4</mml:mn><mml:msubsup><mml:mi>&#x3C3;</mml:mi><mml:mi>s</mml:mi><mml:mi>w</mml:mi></mml:msubsup><mml:mo>+</mml:mo><mml:mn>2</mml:mn><mml:msubsup><mml:mi>&#x3C3;</mml:mi><mml:mi>n</mml:mi><mml:mn>2</mml:mn></mml:msubsup></mml:mrow></mml:mfenced></mml:math>이다 .</p>
<p><italic>y</italic>(<italic>t</italic>)의 크기, 즉 <mml:math id="m001-3"><mml:mfenced open="|" close="|"><mml:mrow><mml:mi>y</mml:mi><mml:mfenced><mml:mi>t</mml:mi></mml:mfenced></mml:mrow></mml:mfenced></mml:math>는 Rayleigh 랜덤 변수가 되고, Rayleigh 랜덤 변수의 특성에 따라서 다음식과 같이 전개된다.</p>
<disp-formula-group>
	<disp-formula id="dm07">
		<label>(7)</label>
<mml:math id="dm07-1"><mml:mi>E</mml:mi><mml:mfenced open="[" close="]"><mml:mfenced open="|" close="|"><mml:mrow><mml:mi>y</mml:mi><mml:mfenced><mml:mi>i</mml:mi></mml:mfenced></mml:mrow></mml:mfenced></mml:mfenced><mml:mo>=</mml:mo><mml:mfrac><mml:msqrt><mml:mfenced><mml:mi mathvariant="normal">&#x3C0;</mml:mi></mml:mfenced></mml:msqrt><mml:mn>2</mml:mn></mml:mfrac><mml:msqrt><mml:mn>4</mml:mn><mml:msubsup><mml:mi>&#x3C3;</mml:mi><mml:mi>s</mml:mi><mml:mn>2</mml:mn></mml:msubsup><mml:mo>+</mml:mo><mml:mn>2</mml:mn><mml:msubsup><mml:mi>&#x3C3;</mml:mi><mml:mi>n</mml:mi><mml:mn>2</mml:mn></mml:msubsup></mml:msqrt></mml:math>
	</disp-formula>
</disp-formula-group>
<p>이를 이용하여 신호와 잡음의 크기는 다음과 같이 전개 될 수 있다.</p>
<disp-formula-group>
	<disp-formula id="dm08">
		<label>(8)</label>
<mml:math id="dm08-1"><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>g</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mstyle displaystyle="true"><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:munderover></mml:mstyle><mml:mo>&#xFF5C;</mml:mo><mml:mi>L</mml:mi><mml:mi>T</mml:mi><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>,</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mfenced><mml:mi>i</mml:mi></mml:mfenced><mml:mo>+</mml:mo><mml:mi>L</mml:mi><mml:mi>T</mml:mi><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>,</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mfenced><mml:mi>i</mml:mi></mml:mfenced><mml:mo>&#xFF5C;</mml:mo></mml:mrow><mml:mi>N</mml:mi></mml:mfrac><mml:mspace linebreak="newline"/><mml:mo>&#x2245;</mml:mo><mml:mfrac><mml:msqrt><mml:mfenced><mml:mi mathvariant="normal">&#x3C0;</mml:mi></mml:mfenced></mml:msqrt><mml:mn>2</mml:mn></mml:mfrac><mml:msqrt><mml:mn>4</mml:mn><mml:msubsup><mml:mi>&#x3C3;</mml:mi><mml:mi>s</mml:mi><mml:mn>2</mml:mn></mml:msubsup><mml:mo>+</mml:mo><mml:mn>2</mml:mn><mml:msubsup><mml:mi>&#x3C3;</mml:mi><mml:mi>n</mml:mi><mml:mn>2</mml:mn></mml:msubsup></mml:msqrt><mml:mspace linebreak="newline"/><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mi>o</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mstyle displaystyle="true"><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:munderover><mml:mo>&#xFF5C;</mml:mo><mml:mi>L</mml:mi><mml:mi>T</mml:mi><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>,</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mfenced><mml:mi>i</mml:mi></mml:mfenced><mml:mo>-</mml:mo><mml:mi>L</mml:mi><mml:mi>T</mml:mi><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>,</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mfenced><mml:mi>i</mml:mi></mml:mfenced><mml:mo>&#xFF5C;</mml:mo></mml:mstyle><mml:mi>N</mml:mi></mml:mfrac><mml:mspace linebreak="newline"/><mml:mo>&#x2245;</mml:mo><mml:mfrac><mml:msqrt><mml:mfenced><mml:mi mathvariant="normal">&#x3C0;</mml:mi></mml:mfenced></mml:msqrt><mml:mn>2</mml:mn></mml:mfrac><mml:msqrt><mml:mn>2</mml:mn><mml:msubsup><mml:mi>&#x3C3;</mml:mi><mml:mi>n</mml:mi><mml:mn>2</mml:mn></mml:msubsup></mml:msqrt></mml:math>
	</disp-formula>
</disp-formula-group>
<p>결과적으로 최종 SNR 추정 값은 다음과 같이 전개 될 수 있다.</p>
<disp-formula-group>
	<disp-formula id="dm09">
		<label>(9)</label>
<mml:math id="dm09-1"><mml:mi>S</mml:mi><mml:mi>N</mml:mi><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>d</mml:mi><mml:mi>B</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>20</mml:mn><mml:msub><mml:mi>log</mml:mi><mml:mn>10</mml:mn></mml:msub><mml:mfenced><mml:mfrac><mml:mrow><mml:msubsup><mml:mi>A</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>g</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow><mml:mn>2</mml:mn></mml:msubsup><mml:mo>-</mml:mo><mml:msubsup><mml:mi>A</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mi>o</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow><mml:mn>2</mml:mn></mml:msubsup></mml:mrow><mml:mrow><mml:mn>2</mml:mn><mml:msubsup><mml:mi>A</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mi>o</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow><mml:mn>2</mml:mn></mml:msubsup></mml:mrow></mml:mfrac></mml:mfenced><mml:mspace linebreak="newline"/><mml:mo>=</mml:mo><mml:mn>10</mml:mn><mml:msub><mml:mi>log</mml:mi><mml:mn>10</mml:mn></mml:msub><mml:mfenced><mml:mrow><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>g</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mi>o</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfenced><mml:mspace linebreak="newline"/><mml:mo>+</mml:mo><mml:mn>10</mml:mn><mml:msub><mml:mi>log</mml:mi><mml:mn>10</mml:mn></mml:msub><mml:mfenced><mml:mrow><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>g</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>-</mml:mo><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mi>o</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfenced><mml:mspace linebreak="newline"/><mml:mo>-</mml:mo><mml:mn>20</mml:mn><mml:msub><mml:mi>log</mml:mi><mml:mn>10</mml:mn></mml:msub><mml:mfenced><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>g</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mfenced><mml:mo>-</mml:mo><mml:mn>3</mml:mn></mml:math>
	</disp-formula>
</disp-formula-group>
<p>&#x003C;<xref ref-type="fig" rid="f003">그림 3</xref>&#x003E;은 <xref ref-type="disp-formula" rid="dm09">식 9</xref>로 표현된 제안된 SNR 추정을 도식화 하였으며, 2장의 시간 영역 추정에 비해 제곱이나 나눗셈이 제거되어 하드웨어 구현이 용이함을 알 수 있다.</p>
</sec>
<sec id="sec004">
<title>4. 실험결과</title>
<p>SNR 추정을 위해서 다음의 조건에서 모사시험을 수행하였다. 입력 SNR은 신호 전력을 일정하게 유지하고 AWGN 노이즈 신호의 크기를 조절하여 실험하였다. 입력된 SNR은 채널 모델에 입력되기 전의 AWGN 노이즈 추가하는 과정에서 신호와 노이즈를 정해진 비율대로 생성하여 합산하였다.</p>
<table-wrap id="t001">
<label>표 1.</label>
<caption>
<title>시뮬레이션 인자 값</title>
<p>Table 1. Simulation parameters</p>
</caption>
<table frame="box" rules="all" width="100%">
<tbody>
<tr align="center">
<td>항목</td>
<td>조건</td>
</tr>
<tr align="center">
<td>Packet Format</td>
<td>VHT (NDP)</td>
</tr>
<tr align="center">
<td>MCS</td>
<td>7</td>
</tr>
<tr align="center">
<td>BW</td>
<td>20MHz</td>
</tr>
<tr align="center">
<td>BSS BW</td>
<td>20MHz</td>
</tr>
<tr align="center">
<td>Channel</td>
<td>AWGN / D</td>
</tr>
<tr align="center">
<td>Number of frames</td>
<td>100</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>AWGN 채널의 경우 신호 전력이 거의 통일되므로 실제 SNR은 입력 SNR과 거의 동일하게 된다. 그러나 페이딩 채널의 경우 신호 전력이 변동하므로 실제 SNR은 입력 SNR과 차이를 보이게 된다.</p>
<p>&#x003C;<xref ref-type="table" rid="t001">표 1</xref>&#x003E;은 실험에 사용된 인자 값들을 보여주고 있으며, Time domain 추정 SNR 및 제안하는 방법에 대해서 SNR 에러는 다음의 식으로 계산되었다.</p>
<disp-formula-group>
	<disp-formula id="dm10">
		<label>(10)</label>
<mml:math id="dm10-1"><mml:mi>S</mml:mi><mml:mi>N</mml:mi><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>S</mml:mi><mml:mi>N</mml:mi><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>e</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mo>-</mml:mo><mml:mi>S</mml:mi><mml:mi>N</mml:mi><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:math>
	</disp-formula>
</disp-formula-group>
<p>모사실험의 성능 비교를 위해 근사화 없는 시간 영역 SNR 추정과, 최소 제곱(LS) 채널 추정치를 사용하여 노이즈 차이를 추정하는 Ren<xref ref-type="bibr" rid="B009">[9]</xref>의 방법을 종래의 방법으로 설정하여 제안한 알고리즘과 비교하였다.</p>
<fig id="f004" orientation="portrait" position="float">
	<label>그림 4 :</label>
	<caption>
		<title>AWGN channel과 channel D에 대한 SNR 추정</title>
		<p>Figure 4: SNR estimation for AWGN channel and Channel D</p>
	</caption>
	<graphic xlink:href="../ingestImageView?artiId=ART002516899&amp;imageName=jkits_2019_14_05_527_f004.jpg" position="float" orientation="portrait" xlink:type="simple"></graphic>
</fig>
<p>&#x003C;<xref ref-type="fig" rid="f004">그림 4</xref>&#x003E;에서 볼 수 일듯이, 종래의 근사화 방법이 약 30dB의 AWGN과 페이딩 채널 모두의 높은 SNR에서 높은 정확도를 갖는 반면, 제안한 방법은 낮은 SNR에서 높은 정확도를 보임을 알 수 있다. 제안하는 방법은 근사화가 없는 시간영역 SNR 추장과 비교하였을 때, AWGN 채널의 낮은 SNR 영역에서 약 0.5dB의 일정한 오차를 보이고 있으며 페이딩 채널에서는 약 0.2dB의 낮은 오차를 보이고 있다. 표준편차 역시 AWGN과 페이딩 채널의 0dB SNR에서 약 1.1 수준의 안정적인 성능을 보여주고 있어서, packet 수신율을 낮은 SNR 영역에서 제안한 방법이 효과적임을 알 수 있다.</p>
</sec>
<sec id="sec005" sec-type="Conclusions">
<title>5. 결 론</title>
<p>직교 주파수 분할 멀티플렉싱 통신 방식은 주파수 선택적 페이딩에 강한 특성으로 인하여 많은 무선통신 시스템에서 필수적으로 이용되고 있다. 그러나 모든 채널 환경에 적합한 단일화된 심벌검출기 및 채널추정 등은 실제 사용에 어려움이 있어서 통신 시스템의 각 블록에 SNR을 기반 한 알고리즘들이 사용되고 있다.</p>
<p>본 논문에서는 OFDM 통신 시스템 중 대표적인 IEEE802.11규격을 기준으로 시간영역 기반 SNR 추정을 간략화한 방법을 제안하였다. 제안된 방법은 제곱연산이나 나눗셈 연산이 없이 간단히 구현 가능한 구조를 보였으며, 모사실험을 통해 그 성능을 보여주었다. 제안한 방법은 근사화가 없는 시간영역 SNR 추정 방법과 비교하였을 때, AWGN 채널과 channel D 모델의 주파수 페이딩 채널 환경에서 각각 약 0.5dB와 0.2dB의 낮고 일정한 오차를 보이고 있으며, 통신 시스템의 성능을 좌우하는 낮은 SNR 영역에서 기존의 근사화 방법 대비 제안한 방법이 효과적임을 보여주었다.</p>
</sec>
</body>
<back>
<ref-list>
<title>References</title>
<!-- [1] I. F. Akyildiz, S. Nie, S-C. Lin, and M. Chandrasekaran, 5G roadmap: 10 key enabling technologies, Computer Networks, Vol. 106, pp. 17-48, 2016.-->
<ref id="B001">
<label>[1]</label>
<element-citation publication-type="journal">
<person-group>
<name><surname>Akyildiz</surname><given-names>I. F.</given-names></name>
<name><surname>Nie</surname><given-names>S.</given-names></name>
<name><surname>Lin</surname><given-names>S-C.</given-names></name>
<name><surname>Chandrasekaran</surname><given-names>M.</given-names></name>
</person-group>
<year>2016</year>
<article-title>5G roadmap: 10 key enabling technologies</article-title>
<source>Computer Networks</source>
<volume>106</volume>
<fpage>17</fpage><lpage>48</lpage>
<pub-id pub-id-type="doi">10.1016/j.comnet.2016.06.010</pub-id>
</element-citation>
</ref>
<!-- [2] P. Banelli, S. Buzzi, G. Colavolpe, A. Modenini, F. Rusek, and A. Ugolini, Modulation formats and waveforms for 5G networks: Who Will Be the Heir of OFDM?: An overview of alternative modulation schemes for improved spectral efficiency, in IEEE Signal Processing Magazine, Vol. 31, No. 6, pp. 80-93, Nov. 2014.-->
<ref id="B002">
<label>[2]</label>
<element-citation publication-type="journal">
<person-group>
<name><surname>Banelli</surname><given-names>P.</given-names></name>
<name><surname>Buzzi</surname><given-names>S.</given-names></name>
<name><surname>Colavolpe</surname><given-names>G.</given-names></name>
<name><surname>Modenini</surname><given-names>A.</given-names></name>
<name><surname>Rusek</surname><given-names>F.</given-names></name>
<name><surname>Ugolini</surname><given-names>A.</given-names></name>
</person-group>
<year>2014</year>
<month>Nov.</month>
<article-title>Modulation formats and waveforms for 5G networks: Who Will Be the Heir of OFDM?: An overview of alternative modulation schemes for improved spectral efficiency</article-title>
<source>IEEE Signal Processing Magazine</source>
<volume>31</volume><issue>6</issue>
<fpage>80</fpage><lpage>93</lpage>
<pub-id pub-id-type="doi">10.1109/msp.2014.2337391</pub-id>
</element-citation>
</ref>
<!-- [3] IEEE Computer Society, Wireless LAN medium access control (MAC) and physical layer (PHY) specifications: Enhancements for very high throughput for operation in bands below 6 GHz, IEEE P802.11ax/D3.0 Std., Jun. 2018.-->
<ref id="B003">
<label>[3]</label>
<element-citation publication-type="other">
<collab>IEEE Computer Society</collab>
<year>2018</year>
<month>Jun.</month>
<source>Wireless LAN medium access control (MAC) and physical layer (PHY) specifications: Enhancements for very high throughput for operation in bands below 6 GHz</source>
<comment> IEEE P802.11ax/D3.0 Std.</comment>
</element-citation>
</ref>
<!-- [4] L. Rugini, P. Banelli, and G. Leus, Simple equalization of time-varying channels for OFDM, in IEEE Communications Letters, Vol. 9, No. 7, pp. 619-621, Jul. 2005.-->
<ref id="B004">
<label>[4]</label>
<element-citation publication-type="journal">
<person-group>
<name><surname>Rugini</surname><given-names>L.</given-names></name>
<name><surname>Banelli</surname><given-names>P.</given-names></name>
<name><surname>Leus</surname><given-names>G.</given-names></name>
</person-group>
<year>2005</year>
<month>Jul.</month>
<article-title>Simple equalization of time-varying channels for OFDM</article-title>
<source>IEEE Communications Letters</source>
<volume>9</volume><issue>7</issue>
<fpage>619</fpage><lpage>621</lpage>
<pub-id pub-id-type="doi">10.1109/lcomm.2005.1461683</pub-id>
</element-citation>
</ref>
<!-- [5] J. Koo, and H. Yoon, Analysis of inter-carrier interference by phase noise on OFDM systems, Journal of the Institute of Electronics and Information Engineers. Vol 55, No. 2, pp. 3-8, Feb. 2018.-->
<ref id="B005">
<label>[5]</label>
<element-citation publication-type="journal">
<person-group>
<name><surname>Koo</surname><given-names>J.</given-names></name>
<name><surname>Yoon</surname><given-names>H.</given-names></name>
</person-group>
<year>2018</year>
<month>Feb.</month>
<article-title>Analysis of inter-carrier interference by phase noise on OFDM systems</article-title>
<source>Journal of the Institute of Electronics and Information Engineers</source>
<volume>55</volume><issue>2</issue>
<fpage>3</fpage><lpage>8</lpage>
</element-citation>
</ref>
<!-- [6] P. He, Z. Li, and X. Wang, A low-complexity SNR estimation algorithm and channel estimation method for OFDM systems, 2014 4th IEEE International Conference on Information Science and Technology, Shenzhen, pp. 698-701, 2014.-->
<ref id="B006">
<label>[6]</label>
<element-citation publication-type="paper">
<person-group>
<name><surname>He</surname><given-names>P.</given-names></name>
<name><surname>Li</surname><given-names>Z.</given-names></name>
<name><surname>Wang</surname><given-names>X.</given-names></name>
</person-group>
<year>2014</year>
<article-title>A low-complexity SNR estimation algorithm and channel estimation method for OFDM systems</article-title>
<conf-name>2014 4th IEEE International Conference on Information Science and Technology</conf-name>
<conf-loc>Shenzhen</conf-loc>
<fpage>698</fpage><lpage>701</lpage>
<pub-id pub-id-type="doi">10.1109/icist.2014.6920573</pub-id>
</element-citation>
</ref>
<!-- [7] J. Koo, S. Kim, and J. Kim, A parallel collaborative sphere decoder for a MIMO communication system, in Journal of Communications and Networks, Vol. 16, No. 6, pp. 620-626, Dec. 2014.-->
<ref id="B007">
<label>[7]</label>
<element-citation publication-type="journal">
<person-group>
<name><surname>Koo</surname><given-names>J.</given-names></name>
<name><surname>Kim</surname><given-names>S.</given-names></name>
<name><surname>Kim</surname><given-names>J.</given-names></name>
</person-group>
<year>Dec. 2014.</year>
<article-title>A parallel collaborative sphere decoder for a MIMO communication system</article-title>
<source>Journal of Communications and Networks</source>
<volume>16</volume><issue>6</issue>
<fpage>620</fpage><lpage>626</lpage>
<pub-id pub-id-type="doi">10.1109/jcn.2014.000108</pub-id>
</element-citation>
</ref>
<!-- [8] D. R. Pauluzzi, and N. C. Beaulieu, A comparison of the SNR estimation techniques for the AWGN channel, IEEE Trans. Commun., Vol. 48, No. 10, pp. 1681-1691, 2000.-->
<ref id="B008">
<label>[8]</label>
<element-citation publication-type="journal">
<person-group>
<name><surname>Pauluzzi</surname><given-names>D. R.</given-names></name>
<name><surname>Beaulieu</surname><given-names>N. C.</given-names></name>
</person-group>
<year>2000</year>
<article-title>A comparison of the SNR estimation techniques for the AWGN channel</article-title>
<source>IEEE Trans. Commun.</source>
<volume>48</volume><issue>10</issue>
<fpage>1681</fpage><lpage>1691</lpage>
<pub-id pub-id-type="doi">10.1109/26.871393</pub-id>
</element-citation>
</ref>
<!-- [9] G. Ren, Y. Chang, and H. Zhang, SNR estimation algorithm based on the preamble for wireless OFDM systems, Science in China Series F: Information Sciences, Vol. 51, No. 7, pp. 965-974, 2008,-->
<ref id="B009">
<label>[9]</label>
<element-citation publication-type="journal">
<person-group>
<name><surname>Ren</surname><given-names>G.</given-names></name>
<name><surname>Chang</surname><given-names>Y.</given-names></name>
<name><surname>Zhang</surname><given-names>H.</given-names></name>
</person-group>
<year>2008</year>
<article-title>SNR estimation algorithm based on the preamble for wireless OFDM systems</article-title>
<source>Science in China Series F: Information Sciences</source>
<volume>51</volume><issue>7</issue>
<fpage>965</fpage><lpage>974</lpage>
<pub-id pub-id-type="doi">10.1007/s11432-008-0063-8</pub-id>
</element-citation>
</ref>
<!-- [10] M. Zivkovic, and R. Mathar, Preamble-based SNR estimation in frequency selective channels for wireless OFDM systems, Proc. IEEE 69th Vehicular Technology Conf., 2009.-->
<ref id="B010">
<label>[10]</label>
<element-citation publication-type="paper">
<person-group>
<name><surname>Zivkovic</surname><given-names>M.</given-names></name>
<name><surname>Mathar</surname><given-names>R.</given-names></name>
</person-group>
<year>2009</year>
<article-title>Preamble-based SNR estimation in frequency selective channels for wireless OFDM systems</article-title>
<conf-name>Proc. IEEE 69th Vehicular Technology Conf.</conf-name>
<pub-id pub-id-type="doi">10.1109/vetecs.2009.5073813</pub-id>
</element-citation>
</ref>
<!-- [11] X. J. Mao, W. X. Li, Y. S Li, Y. Sun, and Z.. Zhai, Robust adaptive beamforming against signal steering vector mismatch and jammer motion, International Journal of Antennas and Propagation, Vol. 2015, pp. 1-12, 2015.-->
<ref id="B011">
<label>[11]</label>
<element-citation publication-type="journal">
<person-group>
<name><surname>Mao</surname><given-names>X. J.</given-names></name>
<name><surname>Li</surname><given-names>W. X.</given-names></name>
<name><surname>Li</surname><given-names>Y. S.</given-names></name>
<name><surname>Sun</surname><given-names>Y.</given-names></name>
<name><surname>Zhai</surname><given-names>Z.</given-names></name>
</person-group>
<year>2015</year>
<article-title>Robust adaptive beamforming against signal steering vector mismatch and jammer motion</article-title>
<source>International Journal of Antennas and Propagation</source>
<volume>2015</volume>
<fpage>1</fpage><lpage>12</lpage>
<pub-id pub-id-type="doi">10.1155/2015/780296</pub-id>
</element-citation>
</ref>
<!-- [12] J-C. Guey, M. P. Fitz, M. R. Bell, and W-Y. Kuo, Signal design for transmitter diversity wireless communication systems over Rayleigh fading channels, IEEE Trans. Commun., Vol. COM-47, pp. 527-537, Apr. 1999.-->
<ref id="B012">
<label>[12]</label>
<element-citation publication-type="journal">
<person-group>
<name><surname>Guey</surname><given-names>J-C.</given-names></name>
<name><surname>Fitz</surname><given-names>M. P.</given-names></name>
<name><surname>Bell</surname><given-names>M. R.</given-names></name>
<name><surname>Kuo</surname><given-names>W-Y.</given-names></name>
</person-group>
<year>1999</year>
<month>Apr.</month>
<article-title>Signal design for transmitter diversity wireless communication systems over Rayleigh fading channels</article-title>
<source>IEEE Trans. Commun.</source>
<volume>COM-47</volume>
<fpage>527</fpage><lpage>537</lpage>
<pub-id pub-id-type="doi">10.1109/26.764926</pub-id>
</element-citation>
</ref>
<!-- [13] J. K. Cavers, An analysis of pilot symbol assisted modulation for Rayleigh faded channels, IEEE Trans. Veh. Tech., Vol. VT-40, pp. 686-693, Nov. 1991.-->
<ref id="B013">
<label>[13]</label>
<element-citation publication-type="journal">
<person-group>
<name><surname>Cavers</surname><given-names>J. K.</given-names></name>
</person-group>
<year>1991</year>
<month>Nov.</month>
<article-title>An analysis of pilot symbol assisted modulation for Rayleigh faded channels</article-title>
<source>IEEE Trans. Veh. Tech.</source>
<volume>VT-40</volume>
<fpage>686</fpage><lpage>693</lpage>
<pub-id pub-id-type="doi">10.1109/25.108378</pub-id>
</element-citation>
</ref>
<!-- [14] J-C. Guey, M. P. Fitz, M. R. Bell, and W-Y. Kuo, Signal design for transmitter diversity wireless communication systems over Rayleigh fading channels, IEEE Trans. Commun., Vol. COM-47, pp. 527-537, Apr. 1999.-->
<ref id="B014">
<label>[14]</label>
<element-citation publication-type="journal">
<person-group>
<name><surname>Guey</surname><given-names>J-C.</given-names></name>
<name><surname>Fitz</surname><given-names>M. P.</given-names></name>
<name><surname>Bell</surname><given-names>M. R.</given-names></name>
<name><surname>Kuo</surname><given-names>W-Y.</given-names></name>
</person-group>
<year>1999</year>
<month>Apr.</month>
<article-title>Signal design for transmitter diversity wireless communication systems over Rayleigh fading channels</article-title>
<source>IEEE Trans. Commun.</source>
<volume>COM-47</volume>
<fpage>527</fpage><lpage>537</lpage>
<pub-id pub-id-type="doi">10.1109/26.764926</pub-id>
</element-citation>
</ref>
<!-- [15] V. Tarokh, A. Naguib, N. Seshadri, and A. Calderbank, Space-time codes for high data rate wireless communication: Performance criteria in the presence of channel estimation errors, mobility, and multiple paths, IEEE Trans. Commun., Vol. 47, No. 2, pp. 199-207, Feb. 1999.-->
<ref id="B015">
<label>[15]</label>
<element-citation publication-type="journal">
<person-group>
<name><surname>Tarokh</surname><given-names>V.</given-names></name>
<name><surname>Naguib</surname><given-names>A.</given-names></name>
<name><surname>Seshadri</surname><given-names>N.</given-names></name>
<name><surname>Calderbank</surname><given-names>A.</given-names></name>
</person-group>
<year>1999</year>
<month>Feb.</month>
<article-title>Space-time codes for high data rate wireless communication: Performance criteria in the presence of channel estimation errors, mobility, and multiple paths</article-title>
<source>IEEE Trans. Commun.</source>
<volume>47</volume><issue>2</issue>
<fpage>199</fpage><lpage>207</lpage>
<pub-id pub-id-type="doi">10.1109/26.752125</pub-id>
</element-citation>
</ref>
</ref-list>
<ack>
<title>감사의 글</title>
<p>본 연구는 2019학년도 오산학교 교내연구비 지원에 의하여 이루어졌음</p>
</ack>
<bio>
<p><graphic xlink:href="../ingestImageView?artiId=ART002516899&amp;imageName=jkits_2019_14_05_527_f005.jpg"></graphic><bold>Jihun Koo</bold> received the B.S and M.S. degrees in Electrical Engineering from Inha University, Incheon, Korea, in 2000 and 2002, respectively and the Ph.D. degree from Yonsei University, Seoul, Korea in 2015. He was Principal engineer of Connectivity development team of Samsung Electronics Co., Ltd., Hwaseung, Gyeongi-do, Korea. He is currently a Professor in the Smart IT Department at Osan University, Osan, Korea. His current research interests include wireless communication, Internet-of-Things and Connectivity.</p>
<p><italic>E-mail address</italic>: <email>jihun.koo@osan.ac.kr</email></p>
<p><graphic xlink:href="../ingestImageView?artiId=ART002516899&amp;imageName=jkits_2019_14_05_527_f006.jpg"></graphic><bold>Hayoung Yoon</bold> received his B.S. degree from the Department of Animation, Korea University of Media Arts, Sejong, Korea, in 2000 and his M.S. and Ph.D. degrees from the information communication, Waseda University , Tokyo, Japan, in 2009 and 2014, respectively. He is currently a Professor in the Digita Contents Design Department at Osan University, Osan, Korea. His current research interests Ergonomics evaluation, Virtual reality and 3D content creation.</p>
<p><italic>E-mail address</italic>: <email>yoon@osan.ac.kr</email></p>
</bio>
</back>
</article>
