37 research outputs found

    ๋”ฅ๋Ÿฌ๋‹๊ณผ ์ตœ์ ํ™”๋ฅผ ํ™œ์šฉํ•œ ๋ฌด์„  ํ†ต์‹  ์‹œ์Šคํ…œ ์„ค๊ณ„

    Get PDF
    ํ•™์œ„๋…ผ๋ฌธ(๋ฐ•์‚ฌ) -- ์„œ์šธ๋Œ€ํ•™๊ต๋Œ€ํ•™์› : ๊ณต๊ณผ๋Œ€ํ•™ ์ „๊ธฐยท์ •๋ณด๊ณตํ•™๋ถ€, 2021.8. ์บ„ํฌ์‹ธ์ด.์ตœ๊ทผ 5G ์‹œ์Šคํ…œ์˜ ๋“ฑ์žฅ์œผ๋กœ ๊ณ ์‹ ๋ขฐ ์ €์ง€์—ฐ ํ†ต์‹ (ultra reliable low-latency communications, URLLC)๊ณผ ๋Œ€๊ทœ๋ชจ ์‚ฌ๋ฌผ ํ†ต์‹ (massive machine-type communications, mMTC)์ด ์ฃผ๋ชฉ์„ ๋ฐ›๊ณ  ์žˆ๋‹ค. ์˜๋ฃŒ ์„œ๋น„์Šค, ์ปค๋„ฅํ‹ฐ๋“œ ์นด, ๋กœ๋ด‡ ๊ณตํ•™, ์ œ์กฐ์—…, ์ž์œ  ์‹œ์  ๋น„๋””์˜ค ๋“ฑ ๋‹ค์–‘ํ•œ ์„œ๋น„์Šค๋“ค์ด ์ €์ง€์—ฐ ํ†ต์‹ ์—์„œ ์˜ˆ์ƒ๋˜๊ณ , ์ด๋“ค์€ 1 ms ์ •๋„์˜ ๊ทน๋„๋กœ ๋‚ฎ์€ ์ง€์—ฐ ์‹œ๊ฐ„์„ ์š”๊ตฌํ•œ๋‹ค. ํ•œํŽธ, ๋Œ€๊ทœ๋ชจ ์‚ฌ๋ฌผ ํ†ต์‹ ์€ ๊ธฐ์ง€๊ตญ์—์„œ ๋งŽ์€ ๊ธฐ๊ธฐ(์˜ˆ๋ฅผ ๋“ค์–ด ์„ผ์„œ, ๋กœ๋ด‡, ์ž๋™์ฐจ, ๊ธฐ๊ณ„)์˜ ๋ฐฉ๋Œ€ํ•œ ์—ฐ๊ฒฐ์„ฑ์— ๊ด€ํ•œ ๊ฒƒ์ด๋‹ค. ๊ธฐ์กด ํ†ต์‹  ์‹œ์Šคํ…œ(์˜ˆ๋ฅผ ๋“ค์–ด Long-Term Evolution (LTE))์€ ์ €์ง€์—ฐ ํ†ต์‹ ๊ณผ ๋Œ€๊ทœ๋ชจ ์‚ฌ๋ฌผ ํ†ต์‹ ์˜ ์š”๊ตฌ ์‚ฌํ•ญ์„ ๋งŒ์กฑํ•˜๊ธฐ ์–ด๋ ต๊ธฐ์— ์ด ํ†ต์‹  ํ™˜๊ฒฝ์— ์ ํ•ฉํ•œ ์ƒˆ๋กœ์šด ๊ธฐ์ˆ ์ด ํ•„์š”ํ•˜๋‹ค. ๋ณธ ํ•™์œ„๋…ผ๋ฌธ์—์„œ๋Š” ๋Œ€๊ทœ๋ชจ ์‚ฌ๋ฌผ ํ†ต์‹ ๊ณผ ์ €์ง€์—ฐ ํ†ต์‹ ์„ ์œ„ํ•œ ์„ธ ๊ฐ€์ง€ ๊ธฐ์ˆ ์„ ์ œ์•ˆํ•œ๋‹ค. ๋…ผ๋ฌธ์˜ ์ฒซ ๋ถ€๋ถ„์—์„œ๋Š” ๋งŽ์€ ๊ธฐ๊ธฐ๊ฐ€ ๋น„์ง๊ต ํ™•์‚ฐ ์‹œํ€€์Šค๋ฅผ ์‚ฌ์šฉํ•ด ๊ธฐ์ง€๊ตญ์— ์ ‘์†ํ•˜๋Š” ๋Œ€๊ทœ๋ชจ ์‚ฌ๋ฌผ ํ†ต์‹ ์„ ์ง€์›ํ•˜๋Š” ๋”ฅ๋Ÿฌ๋‹ ๊ธฐ๋ฐ˜์˜ ํ™•์‚ฐ ์‹œํ€€์Šค ์„ค๊ณ„ ๋ฐ ํ™œ์„ฑ ์‚ฌ์šฉ์ž ๊ฒ€์ถœ(active user detection, AUD) ๋ฐฉ๋ฒ•์„ ์ œ์•ˆํ•œ๋‹ค. ๊ฒ€์ถœ ์˜ค๋ฅ˜๋ฅผ ์ตœ์†Œํ™”ํ•˜๋Š” ์ „์ฒด ํ†ต์‹  ์‹œ์Šคํ…œ์„ ์„ค๊ณ„ํ•˜๊ธฐ ์œ„ํ•ด, ์ข…๋‹จ ๊ฐ„ ์‹ฌ์ธต ์‹ ๊ฒฝ ๋„คํŠธ์›Œํฌ(deep neural network, DNN)๋ฅผ ํ™œ์šฉํ•œ๋‹ค. ์ด ์‹ ๊ฒฝ ๋„คํŠธ์›Œํฌ์—์„œ ํ™•์‚ฐ ๋„คํŠธ์›Œํฌ๋Š” ์†ก์‹ ๊ธฐ๋ฅผ ๋ชจ๋ธ๋งํ•˜๊ณ  ๊ฒ€์ถœ ๋„คํŠธ์›Œํฌ๋Š” ํ™œ์„ฑ ๊ธฐ๊ธฐ๋ฅผ ์ถ”์ •ํ•œ๋‹ค. ๊ฒ€์ถœ ์˜ค๋ฅ˜๋ฅผ ์†์‹ค ํ•จ์ˆ˜๋กœ ์‚ฌ์šฉํ•จ์œผ๋กœ์จ, ํ™•์‚ฐ ์‹œํ€€์Šค๋ฅผ ํฌํ•จํ•œ ๋„คํŠธ์›Œํฌ ๋ณ€์ˆ˜๋“ค์€ ๊ฒ€์ถœ ์˜ค๋ฅ˜๋ฅผ ์ตœ์†Œํ™”ํ•˜๋„๋ก ํ•™์Šต๋œ๋‹ค. ์‹œ๋ฎฌ๋ ˆ์ด์…˜ ๊ฒฐ๊ณผ์—์„œ๋Š” ์ œ์•ˆํ•œ ๋ฐฉ๋ฒ•์œผ๋กœ ์–ป์–ด์ง„ ํ™•์‚ฐ ์‹œํ€€์Šค๊ฐ€ ์••์ถ•์„ผ์‹ฑ ๊ธฐ๋ฐ˜์˜ ๊ฒ€์ถœ ๊ธฐ๋ฒ•๊ณผ ์ œ์•ˆํ•œ ๊ฒ€์ถœ ๊ธฐ๋ฒ• ๋ชจ๋‘์—์„œ ๊ธฐ์กด์˜ ์‹œํ€€์Šค๋ณด๋‹ค ๋” ์ข‹์€ ๊ฒ€์ถœ ์„ฑ๋Šฅ์„ ๋‹ฌ์„ฑํ•˜๋Š” ๊ฒƒ์„ ๋ณด์—ฌ์ค€๋‹ค. ๋…ผ๋ฌธ์˜ ๋‘ ๋ฒˆ์งธ ๋ถ€๋ถ„์—์„œ๋Š” ์ง๊ต ์ฃผํŒŒ์ˆ˜ ๋ถ„ํ•  ๋‹ค์ค‘ ๋ฐฉ์‹(orthogonal frequency division multiplexing, OFDM) ์‹œ์Šคํ…œ์—์„œ ํ”„๋ฆฌ์ฝ”๋”ฉ๋œ ์ฑ„๋„์˜ RMS (root mean square) ์ง€์—ฐ ํ™•์‚ฐ์„ ์ค„์ด๋Š” ํ”„๋ฆฌ์ฝ”๋”ฉ ๊ธฐ๋ฒ•์„ ์ œ์•ˆํ•œ๋‹ค. OFDM ์‹œ์Šคํ…œ์—์„œ ์˜ค๋ฒ„ํ—ค๋“œ๋ฅผ ์ฆ๊ฐ€์‹œํ‚ค์ง€ ์•Š์œผ๋ฉด์„œ ์ง€์—ฐ์„ ์ค„์ด๊ธฐ ์œ„ํ•ด์„œ๋Š” ์ฑ„๋„์˜ ์ง€์—ฐ ํ™•์‚ฐ๊ณผ ๊ทธ๋กœ ์ธํ•œ CP (cyclic prefix)์˜ ๊ธธ์ด๋ฅผ ์ค„์ด๋Š” ๊ฒƒ์ด ๋ฌด์—‡๋ณด๋‹ค ์ค‘์š”ํ•˜๋‹ค. ์ œ์•ˆํ•˜๋Š” ๊ธฐ๋ฒ•์—์„œ๋Š” RMS ์ง€์—ฐ ํ™•์‚ฐ์˜ ์ƒํ•œ์„ ๋ชฉ์  ํ•จ์ˆ˜๋กœ ํ•˜๊ณ  ๊ฐ ๋ถ€๋ฐ˜์†กํŒŒ์˜ ์‹ ํ˜ธ ๋Œ€ ์žก์Œ๋น„๋ฅผ ์ œ์•ฝ์กฐ๊ฑด์œผ๋กœ ํ•˜๋Š” ์ตœ์ ํ™” ๋ฌธ์ œ๋ฅผ ์„ค์ •ํ•œ๋‹ค. ์ตœ์ ํ™”๋œ ํ”„๋ฆฌ์ฝ”๋”ฉ์„ ์ฐพ์„ ์ˆ˜ ์žˆ๋„๋ก ์›๋ž˜ ๋ฌธ์ œ๋ฅผ ๋ณผ๋ก ๋ฌธ์ œ๋กœ ๋ณ€ํ™˜ํ•˜๊ธฐ ์œ„ํ•ด SDR (semi-definite relaxation) ๊ธฐ๋ฒ•์„ ์‚ฌ์šฉํ•œ๋‹ค. ์‹œ๋ฎฌ๋ ˆ์ด์…˜ ๊ฒฐ๊ณผ์—์„œ๋Š” ์ œ์•ˆํ•œ ํ”„๋ฆฌ์ฝ”๋”ฉ ์„ค๊ณ„๊ฐ€ ํŠนํžˆ ๊ธฐ์ง€๊ตญ์—์„œ ์•ˆํ…Œ๋‚˜์˜ ์ˆ˜๊ฐ€ ๋งŽ์„ ๋•Œ RMS ์ง€์—ฐ ํ™•์‚ฐ์„ ํฌ๊ฒŒ ์ค„์ด๋Š” ๊ฒƒ์„ ๋ณด์—ฌ์ค€๋‹ค. ๋…ผ๋ฌธ์˜ ๋งˆ์ง€๋ง‰ ๋ถ€๋ถ„์—์„œ๋Š” ์ €์ง€์—ฐ OFDM ์‹œ์Šคํ…œ์—์„œ ์ „์†ก๋ฅ  ์ตœ๋Œ€ํ™”๋ฅผ ์œ„ํ•œ ์„ ํ˜• ํ”„๋ฆฌ์ฝ”๋”ฉ ์„ค๊ณ„๋ฅผ ๋‹ค๋ฃฌ๋‹ค. ์ €์ง€์—ฐ ํ†ต์‹ ์—์„œ ์งง์•„์ง€๋Š” ์‹ฌ๋ณผ ์ฃผ๊ธฐ๋กœ ์ธํ•œ CP์˜ ์˜ค๋ฒ„ํ—ค๋“œ๋ฅผ ์™„ํ™”ํ•˜๊ธฐ ์œ„ํ•ด 5G ๋ฌด์„  ์‹œ์Šคํ…œ์€ ์งง์€ CP๋ฅผ ์‚ฌ์šฉํ•  ํ•„์š”๊ฐ€ ์žˆ๋‹ค. ์ฑ„๋„์˜ ์ง€์—ฐ ํ™•์‚ฐ์€ CP ๊ธธ์ด๋ณด๋‹ค ์งง์•„์•ผ ํ•˜๋ฏ€๋กœ ๋จผ์ € ์‹ค์งˆ์ ์ธ RMS ์ง€์—ฐ ํ™•์‚ฐ๊ณผ ๋‹ฌ์„ฑ ๊ฐ€๋Šฅํ•œ ์ „์†ก๋ฅ ์„ ์ œ๋กœ ํฌ์‹ฑ ์กฐ๊ฑด์„ ์‚ฌ์šฉํ•˜์—ฌ ์œ ๋„ํ•œ๋‹ค. ๋‹ค์Œ์œผ๋กœ ์ง€์—ฐ ํ™•์‚ฐ ์ œ์•ฝ์กฐ๊ฑด์„ ๋งŒ์กฑํ•˜๋Š” ์ „์†ก๋ฅ  ์ตœ์ ํ™” ๋ฌธ์ œ๋ฅผ ์‚ฌ์šฉ์ž๋งˆ๋‹ค ์ •๋ฆฝํ•˜๊ณ  SDR ๊ธฐ๋ฒ•์œผ๋กœ ํ•ด๊ฒฐ ๊ฐ€๋Šฅํ•œ ๋ณผ๋ก ๋ฌธ์ œ๋กœ ๋ณ€ํ™˜ํ•œ๋‹ค. ๋ชจ๋“  ์‚ฌ์šฉ์ž์— ๋Œ€ํ•ด ์ตœ์ ํ™” ๋ฌธ์ œ๋ฅผ ํ‘ธ๋Š” ๊ฒƒ์œผ๋กœ ์ „์ฒด ํ”„๋ฆฌ์ฝ”๋”ฉ ํ–‰๋ ฌ์„ ์–ป๋Š”๋‹ค. ์‹œ๋ฎฌ๋ ˆ์ด์…˜ ๊ฒฐ๊ณผ์—์„œ๋Š” ์ œ์•ˆํ•œ ๊ธฐ๋ฒ•์ด ์ž‘์€ RMS ์ง€์—ฐ ํ™•์‚ฐ๊ณผ ํ•จ๊ป˜ ๊ธฐ์กด์˜ ์ „์†ก๋ฅ  ์ตœ์ ํ™”๋ณด๋‹ค ์›”๋“ฑํ•œ ์„ฑ๋Šฅ์„ ๋‹ฌ์„ฑํ•˜๋Š” ๊ฒƒ์„ ๋ณด์—ฌ์ค€๋‹ค.With the advent of 5G wireless systems, ultra reliable low-latency communications (URLLC) and massive machine-type communications (mMTC) have recently attracted growing attention. Applications in health care, connected cars, robotics, manufacturing, and free-viewpoint video are expected in low-latency communications, and they demand extremely short round-trip latency levels as low as 1 ms. On the other hand, mMTC mainly concerns the massive connectivity of a large number of devices (e.g. sensors, robots, vehicles, and machines) to the base station (BS). Since conventional communications systems (e.g. Long-Term Evolution (LTE)) are difficult to meet the requirements of low-latency communications or mMTC, novel techniques suitable for these communications environments are required. This dissertation proposes three techniques for mMTC or low-latency communications. In the first part of the dissertation, we propose a deep learning-based spreading sequence design and active user detection (AUD) to support mMTC where a large number of devices access the base station using non-orthogonal spreading sequences. To design the whole communications system minimizing AUD error, we employ an end-to-end deep neural network (DNN) where the spreading network models the transmitter side and the AUD network estimates active devices. By using the AUD error as a loss function, network parameters including the spreading sequences are learned to minimize the AUD error. Numerical results reveal that the spreading sequences obtained from the proposed approach achieve higher AUD performance than the conventional spreading sequences in the compressive sensing-based AUD schemes, as well as in the proposed AUD scheme. In the second part of the dissertation, a precoding scheme to reduce the root mean square (RMS) delay spread of precoded channels in a orthogonal frequency division multiplexing (OFDM) system is proposed. In order to reduce latency in OFDM systems while not increasing the overhead, it is of primary importance to reduce the effective delay spread of the channel and thus the length of the cyclic prefix (CP). We formulate an optimization problem with an upper bound of the RMS delay spread as the objective function and a signal-to-noise ratio for each subcarrier as constraints. Semi-definite relaxation (SDR) technique is used to convert the problem into a convex problem so as to find the optimal precoding vector. Numerical results confirm that the proposed precoding design provides a significant reduction in the RMS delay spread, especially when there are a large number of antennas at the base station. In the last part of the dissertation, we addresses linear precoding design for sum rate maximization in low-latency OFDM systems. In order to mitigate the overhead of CP originating from shortened symbol duration for low-latency communications, 5G wireless systems need to adopt short CP lengths. As channel delay spread must be less than the CP length, we first derive the effective RMS delay spread and the achievable rate using the zero-forcing assumption. We construct a sum rate optimization problem for each user subject to delay spread constraints and then convert the problem into a solvable convex problem along with a SDR technique. The precoding matrix is finally obtained by solving optimization problems for all users. Numerical results reveal that the proposed scheme attains superior performance to the conventional sum rate optimization, as well as small RMS delay spread.1 INTRODUCTION 1 1.1 Deep Learning-based Spreading Sequence Design and Active User Detection for Massive Machine-Type Communications 2 1.2 Precoding Design for Cyclic Prefix Overhead Reduction in a MISO-OFDM System 5 1.3 Sum Rate Maximization with Shortened Cyclic Prefix in a MIMO-OFDM System 6 2 DEEP LEARNING-BASED SPREADING SEQUENCE DESIGN AND ACTIVE USER DETECTION FOR MASSIVE MACHINE-TYPE COMMUNICATIONS 8 2.1 System Model 8 2.2 DNN-based Spreading Sequence Design and Active User Detection 10 2.2.1 SN Architecture 13 2.2.2 AUDN Architecture 15 2.2.3 Operation 17 2.3 Numerical Results 18 2.3.1 Simulation Setup 18 2.3.2 Homogeneous Activities 19 2.3.3 Heterogeneous Activities 21 3 PRECODING DESIGN FOR CYCLIC PREFIX OVERHEAD REDUCTION IN A MISO-OFDM SYSTEM 26 3.1 System Model 26 3.2 Precoding Design 27 3.2.1 Effective RMS Delay Spread and SNR 28 3.2.2 Precoding Optimization 29 3.3 Numerical Results 31 4 SUM RATE MAXIMIZATION WITH SHORTENED CYCLIC PREFIX IN A MIMO-OFDM SYSTEM 37 4.1 System Model 37 4.2 Preliminaries for Precoding Design 38 4.2.1 Zero-Forcing Conditions 38 4.2.2 Effective RMS Delay Spread 40 4.2.3 Achievable Rate 41 4.3 Precoding Optimization 42 4.4 Numerical Results 43 5 CONCLUSION 53 5.1 Deep Learning-based Spreading Sequence Design and Active User Detection for Massive Machine-Type Communications 53 5.2 Precoding Design for Cyclic Prefix Overhead Reduction in a MISO-OFDM System 54 5.3 Sum Rate Maximization with Shortened Cyclic Prefix in a MIMO-OFDM System 54 Abstract (In Korean) 60 Acknowledgments 62๋ฐ•

    Numerical Analysis of Piled-Raft Foundation Considering Sand Cushion Effects

    Get PDF
    The piled-raft foundation is a new design concept as one of the effective methods of foundation to reduce settlements of structures. On the other hand, an alternative piled-raft system with disconnection cap, sand cushion, between the pile and raft was also investigated to compare the influence of ultimate bearing capacity and settlement. Load-settlement relation curves are used to evaluate the ultimate bearing capacity. In the numerical analyses, a plane strain elasto-plastic finite element model (Mohr-Coulmb model) is used to present the response of the piled-raft foundation.1. ์„œ ๋ก  = 1 1.1 ์—ฐ๊ตฌ์˜ ํ•„์š”์„ฑ ๋ฐ ๋ชฉ์  = 1 1.2 ์ด๋ก ์  ๋ฐฐ๊ฒฝ ๋ฐ ์—ฐ๊ตฌ์˜ ๋™ํ–ฅ = 2 2. ๋ณธ๋ก  = 6 2.1 ๋ง๋š์ง€์ง€ ์ „๋ฉด๊ธฐ์ดˆ (Piled Raft Foundation) = 6 2.2 ๋‚™๋™๊ฐ• ํ•˜๊ตฌ ํŠน์„ฑ = 10 2.2.1 ์ง€๋ฐ˜์กฐ๊ฑด = 10 2.3 ํ”Œ๋ฝ์‹œ์Šค (Plaxis) = 13 2.4 ์šฉ์–ด์ •๋ฆฌ = 15 2.5 ๋ถ„์„๋ฐฉ๋ฒ• = 17 3. ๋ถ„์„ = 19 3.1 Raft ๊ธฐ์ดˆ์— ๋Œ€ํ•œ ์ง€์ง€๋ ฅ(Bearing Capacity) = 19 3.1.1 ์ง€์ง€๋ ฅ(Bearing Capacity)๊ณผ Raft ํญ(Br)๊ณผ์˜ ๊ด€๊ณ„ = 19 3.2 Sand Cushion์ธต์„ ๊ณ ๋ คํ•˜์ง€ ์•Š์€ Piled Raft ๊ธฐ์ดˆ = 20 3.2.1 pile๊ฐœ์ˆ˜(N)์— ๋Œ€ํ•œ ํ‰๊ท  ์นจํ•˜๋Ÿ‰(R)์˜ ๋ณ€ํ™” = 20 3.2.2 pile๊ฐœ์ˆ˜(N)์— ๋Œ€ํ•œ ๋ถ€๋“ฑ ์นจํ•˜๋Ÿ‰(dR)์˜ ๋ณ€ํ™” = 22 3.2.3 pile๊ฐœ์ˆ˜(N)์— ๋Œ€ํ•œ ํ‰๊ท  ์นจํ•˜๋Ÿ‰(R) ๋ฐ ๋ถ€๋“ฑ ์นจํ•˜๋Ÿ‰(dR)์˜ ๊ฒฐ๊ณผ = 23 3.3 Sand Cushion์ธต์„ ๊ณ ๋ คํ•œ Piled Raft ๊ธฐ์ดˆ = 24 3.3.1 ํ‰๊ท  ์นจํ•˜๋Ÿ‰(R)๊ณผ pile๊ฐœ์ˆ˜(N)์™€์˜ ๊ด€๊ณ„ = 24 3.3.2 ๋ถ€๋“ฑ ์นจํ•˜๋Ÿ‰(dR)๊ณผ pile๊ฐœ์ˆ˜(N)์™€์˜ ๊ด€๊ณ„ = 28 3.3.3 ํ‰๊ท  ์นจํ•˜๋Ÿ‰(R)๊ณผ Sand Cushion ๊นŠ์ด(D)์™€์˜ ๊ด€๊ณ„ = 31 3.3.4 ๋ถ€๋“ฑ ์นจํ•˜๋Ÿ‰(dR)๊ณผ Sand Cushion ๊นŠ์ด(D)์™€์˜ ๊ด€๊ณ„ = 33 3.3.5 ํ‰๊ท  ์นจํ•˜๋Ÿ‰(R)๊ณผ ํŒŒ์ผ๋ถ„ํฌ๋„(Bg/Br)๊ณผ์˜ ๊ด€๊ณ„ = 35 3.3.6 ๋ถ€๋“ฑ ์นจํ•˜๋Ÿ‰(dR)๊ณผ ํŒŒ์ผ๋ถ„ํฌ๋„(Bg/Br)๊ณผ์˜ ๊ด€๊ณ„ = 38 4. Sand Cushion์ธต์˜ ํƒ„์„ฑ๊ณ„์ˆ˜(E) ๊ฐ•ํ™” = 41 4.1 B_(g)/B_(r)=0.976 = 41 4.1.1 ํ‰๊ท  ์นจํ•˜๋Ÿ‰(R)๊ณผ pile๊ฐœ์ˆ˜(N)์™€์˜ ๊ด€๊ณ„ = 41 4.1.2 ๋ถ€๋“ฑ ์นจํ•˜๋Ÿ‰(dR)๊ณผ pile๊ฐœ์ˆ˜(N)์™€์˜ ๊ด€๊ณ„ = 45 4.2 B_(g)/B_(r)=0.786 = 49 4.2.1 ํ‰๊ท  ์นจํ•˜๋Ÿ‰(R)๊ณผ pile๊ฐœ์ˆ˜(N)์™€์˜ ๊ด€๊ณ„ = 49 4.2.2 ๋ถ€๋“ฑ ์นจํ•˜๋Ÿ‰(dR)๊ณผ pile๊ฐœ์ˆ˜(N)์™€์˜ ๊ด€๊ณ„ = 53 4.3 B_(g)/B_(r)=0.595 = 57 4.3.1 ํ‰๊ท  ์นจํ•˜๋Ÿ‰(R)๊ณผ pile๊ฐœ์ˆ˜(N)์™€์˜ ๊ด€๊ณ„ = 57 4.3.2 ๋ถ€๋“ฑ ์นจํ•˜๋Ÿ‰(dR)๊ณผ pile๊ฐœ์ˆ˜(N)์™€์˜ ๊ด€๊ณ„ = 61 5. ๊ฒฐ ๋ก  = 66 ์ฐธ ๊ณ  ๋ฌธ ํ—Œ = 6
    corecore