Size: px
Start display at page:

Download ""

Transcription

1 修士論文の和文要旨 研究科 専攻大学院情報理工学研究科情報 通信工学専攻博士前期課程 氏名四ツ橋達彦学籍番号 論文題目 Lattice Reduction を用いた Sphere Detection の演算量削減法 要 旨 本研究は, Multiple-Input Multiple-Output(MIMO における無線通信の信号推定法を対象としている. MIMO とは複数の送受信アンテナを用いて独立なデータの送受信を行う技術である. MIMO は同一周波数帯を使用するため周波数利用効率をあげることができるが, 送信信号同士の干渉が起こり, 送信された信号が正しく推定できない場合がある. MIMO における従来の信号推定法として, ZF 法や MMSE 法や ML 法などがあり. それらの信号推定方法により信号を推定している. このうち, ML 法が最も良いビット誤り率 (BER 特性を示すが, 計算時間が膨大になってしまい, 実用的な方法とはいえない. そこで計算時間が短く,BER が ML 法に近い信号推定法が必要になる. 本研究では Lattice-Reduction(LR, Successive Interference Cancelation(SIC, Sphere Detection(SD を用い, BER の改善を行う. LR とは MIMO の技術の一つであり, 信号を準直交化させ信号の干渉を減らすことができる. さらに, LR は MMSE 法や ZF 法のような従来の信号推定方式と組み合わせることにより, ビット誤り率を良くすることができる. これらの理由により, LR は非常に有用性のあるものであると考えられる. SD とは, 通信路行列と 送信信号ベクトル候補から生成される複数レプリカが作る格子空間において, 受信信号点を中心とした初期半径の超球を仮定し, 超球内に格子点が見つかれば, 受信信号点からその格子点までの距離を新たな半径として, 新たな超球内で格子点が見つからなくなるまで探索を続ける方法である. この方法を用いることにより, ML 法の演算量を削減することが可能になる方法である. しかし, SD は送受信アンテナ数増加や, 変調方式が多値になるほど, 演算量が莫大なものとなってしまう欠点がある. 本稿ではまず始めに MIMO のシステムモデルと通信に用いる変調方式について紹介している. 次に MIMO 環境における従来の信号推定法について紹介している. その後, Lattice-Reduction(LR とその BER 特性について紹介している. その後, LR を用いて, 更に良好な BER 特性が得られる信号推定法を紹介している. そして最後に, 自身の提案法である信号推定法を紹介している. 提案法を用いることで, 送信アンテナ 8 本, 受信アンテナ 8 本での 8 8MIMO 通信において, QPSK 変調及び, 16QAM 変調, 64QAM 変調を用いた場合, ML 法と同様の BER 特性を維持しつつ, かつ SD よりも演算量を削減することが可能となる.

2 4 Lattice-Reduction Sphere detection

3 .,..,,.,, MIMO(Multi Input Multi Output. MIMO,,.,, (AWGN.,,,,,.,MIMO,ZF (Zero Forcing MMSE (Minimum Mean Square Error ML (Maximum Likelihood.., ML (BER,,., BER ML. LR SIC(Successive Interference Cancelation, BER. LR MIMO,., LR MMSE ZF,., LR. 1

4 1 MIMO (Multi Input Multi Output MIMO QPSK QAM QAM Offset-QPSK Offset-16QAM Offset-64QAM ZF MMSE ML Lattice-Reduction(LR LR Aided Detection (LRAD Forward&Backward LR (F&B LR F&B LR F&B LR

5 6 Seysen s Seysen s Seysen s Reciprocal Lattice-Reduction(LR LLL Reciprocal LR LLL SIC Ordering SIC SIC(Successive Interference Cancellation LR with SIC LR with Ordering SIC(OSIC Reciprocal Lattice Forward&Backward LR (F&B Reciprocal F&B Reciprocal BER Ordering SIC Forward&Backward LR(F&B OSIC F&B OSIC Reciprocal lattice F&B LR OSIC Reciprocal F&B LR OSIC(Reciprocal F&B OSIC M (N + M (N + M M M M M M M ŝ Shift and Scale Shift-Back and Scale-Back

6 LRAD F&B LR Seysen s LR Reciprocal LR LR with OSIC F&B Reciprocal F&B OSIC Recipeocal F&B OSIC Forward&Backward LR with OSIC ( F&B OSIC ( Sphere Detection (SD Sphere Detection(SD LR-with OSIC Sphere Detection(SD (

7 1 MIMO (Multi Input Multi Output 1.1 MIMO.MIMO(Multi Input Multi Output..,,. 1. MIMO MIMO 1.1. s. y H z, y = Hs + z. N, M, y. y N 1 = H N M s M 1 + z N 1 (1.1 H h h h h h1 h h3 h 4 = h h h h h h h h s s s = s s z 1 z z 3 z 4 y y y = y y : MIMO ( 4 4 5

8 y = Hs + z (1. : s M 1 = [s 1,..., s M ] T (1.3 : y N 1 = [y 1,..., y N ] T (1.4 AWGN : z N 1 = [z 1,..., z N ] T (1.5 h 1,1 h 1,M : H N M =..... (1.6 h N,1 h N,M MIMO,. y 1. = h 1,1 h 1,M..... s 1. + z 1. (1.7 y N h N,1 h N,M s M z N 1.3 MIMO.,., 4, 4 4 4MIMO, 6, 6 6 6MIMO, 8, 8 8 8MIMO. 6

9 .1,, 3, QPSK,16QAM,64QAM. LR. PHS. PSK(Phase Shift Keying :, QAM(Quadrature Amplitude Moduration : ASK(Amplitude Shift Keying :.,,,. 7

10 . QPSK QPSK.1. (01 + j ( ( 11 - j (10.1: QPSK QPSK. s m [±1 ± j], and C (sm [(00, (01, (11, (10] E s, N 0, γ E s = E [ s m ] = j j j + 1 j 4 = = (.1 E b = E s = = 1 (. E b N 0 = 1 N 0 : i.e., N 0 = 1 E b N 0 (.3 γ 1 = MN 0 E s = MN 0 E b = M E b N 0 (.4 8

11 .3 16QAM 16QAM.. (1000 ( 1100 (0100 ( j ( 1001 ( j (0101 ( ( 1011 ( 1111 j (0111 (0011 ( 1010 ( 1110 (0110 (0010 3j.: 16QAM 16QAM. s m = a + jb : [a b] [±1, ±3], and C (sm E s, N 0, γ E s = E [ s m ] (0000 (0001 (0011 (0010 (0100 (0101 (0111 (0110 (1100 (1101 (1111 (1110 (1000 (1001 (1011 (1010 = j j j j 4 = = 10 (.5 E b = E s 4 = 10 4 = 5 (.6 5 E b = : i.e., N 0 = 5 N 0 N 0 E b N 0 (.7 γ 1 = MN 0 E s = MN 0 4E b = M 4 E b N 0 (.8 9

12 .4 64QAM 64QAM.3. ( ( ( ( j ( ( ( ( ( ( ( ( j ( ( ( ( ( ( ( ( j ( ( ( ( ( ( ( j ( ( ( ( ( ( ( ( j ( ( ( ( ( ( ( ( ( j ( ( ( ( ( ( ( ( j ( ( ( ( ( ( ( ( j ( ( ( ( : 64QAM 64QAM. s m = a + jb : [a b] [±1, ±3, ±5, ±7], and C (sm ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (

13 E s, N 0, γ E s = E [ s m ] = j j j j j j j j j j j j j j j j = 16 = 4 (.9 (.10 E b = E s 6 = 4 6 = 7 (.11 E b = 7 : i.e., N 0 = 7 N 0 N E 0 b N 0 (.1 γ 1 = MN 0 E s = MN 0 6E b = M 6 E b N 0 (.13 11

14 .5 Offset-QPSK Offset-QPSK.4. + j ( 01 (11 (00 ( : Offset-QPSK E s, N 0, γ E s = E [ s m (0.5 + j0.5 ] = 1 ( +1 + j + +1 j j + 1 j = 1 (.14 E b = E 5 s 4 = = 5 8 (.15 E b N 0 = 5 8 N 0 = 5 8N 0 : i.e., N 0 = 5 8 E b N 0 (.16 γ 1 = MN 0 E s = MN 0 8E b = M 16 E b N 0 (.17 1

15 .6 Offset-16QAM Offset-16QAM.5. (1000 ( 1100 (0100 ( j ( 1001 ( 1101 (0101 ( j ( 1011 ( 1111 (0111 ( j ( 1010 ( 1110 (0110 ( : Offset-16QAM E s, N 0, γ E s = E [ s m (1.5 + j1.5 ] = 1 ( +1 + j j j j = 5 (.18 E b = E 5 s 4 = 4 = 5 8 (.19 5 E b 8 = : i.e., N 0 = 5 N 0 N 0 8 E b N 0 (.0 γ 1 = MN 0 E s = M 16 E b N 0 (.1 13

16 .7 Offset-64QAM Offset-64QAM.6. ( ( ( ( ( ( ( ( j ( ( ( ( ( ( ( ( j ( ( ( ( ( ( ( ( j ( ( ( ( ( ( ( ( j ( ( ( ( ( ( ( ( j ( ( ( ( ( ( ( ( j ( ( ( ( ( ( ( ( j 0 ( ( ( ( ( ( ( ( : Offset-64QAM E s, N 0, γ E s = E [ s m (3.5 + j3.5 ] = 1 ( j j ( j j ( j j ( j j 4 = j j j j j j j j (. (.3 14

17 E b = E 1 s 6 = 6 = 7 4 (.4 7 E b 4 = = 7 : i.e., N 0 = 7 N 0 N 0 4N 0 4 E b N 0 (.5 γ 1 = MN 0 E s = M 4 E b N 0 (.6.8.,., MIMO N 0, γ 1 M. 15

18 3 3.1 MIMO Zero Forcing(ZF,Minimum Mean Square Error(MMSE,Maximum Likelifood(ML. 3. ZF ZF ZF H (pseudo inverse matrix H ZF ML. ZF. s (ZF = s (ZF 1. s (ZF M = WH y H y = H (Hs + z (3.1 ZF W H. W H H. H M M H = H 1, M N(N M H = ( H H H 1 H H. 3.3 MMSE MMSE MMSE γ H,. MMSE (3.. MMSE ZF,. W = arg min W E[ s WH y ] (3. 16

19 , H := [ H γ 1 I M ]. s (MMSE = s (MMSE 1. s (MMSE M = WH y = ( H H H + γ 1 I M 1 H H y = ( H H H + γ 1 I M 1 H H (Hs + z (3.3 γ 1 ( Es M AWGN 1 N 0 γ Es MN 0. (I M M M 3.4 ML ML ML (3.4 ŝ (ML = arg min s C (s [ y Hs ] (3.4 ML 3.5 M=N=4,M=N=8,, QPSK, 16QAM, 64QAM, ZF, MMSE, ML E b /N 0 BER. 17

20 3.1: QPSK (M=N=4 3.: QPSK (M=N=8 3.3: 16QAM (M=N=4 3.4: 16QAM (M=N=8 18

21 3.5: 64QAM (M=N=4 3.6: 64QAM (M=N=8 3.6 ZF MMSE BER,, M = N = 4 M = N = 8., MMSE., 16QAM,64QAM, ZF MMSE BER. ML,.,. 4 4MIMO 8 8MIMO,, BER. 19

22 4 Lattice-Reduction(LR Lattice-Reduction.,. Lattice Reduction,,. h s u h 黒丸で表した近傍点の位置に誤る確率が高い 送信点 (-1,1 (-1,1 (0,1 (-1,0 (0,0 (1,0 h 1 s 1 (-1,0 (0,0 (1,0 h u 1 1 (1,-1 (0,-1 (1,0,(-1,0 に誤る誤りシンボル数 1 (-1,1,(1,-1 に誤る誤りシンボル数 (1,-1 近傍点が (0,1(-1,0(0,-1(1,0 に変化する 4 つの近傍点いずれに誤った場合でも誤りシンボル数は 1, 1 BER(Bit Error Rate. Lattice-Reduction. 4. h h 1 h 1 h h 1 M =, H (= [h 1 h ] h 1 i 1 i 1 = h 1 h 1 (4.1 0

23 h i i 1 h i 1 h = h 1 h h 1 = ht 1 h h 1 (4. h h 1 (i 1 h i 1 = = = = ( h1 h h 1 ( h T 1 h h 1 ( h T 1 h h 1 ( h T 1 h h 1 i 1 i 1 h1 h 1 h 1 µ 1 h 1 (4.3 (4.3 µ 1 (4.4 µ 1 ht 1 h h 1 (4.4 µ 1 h h 1 h h 1 ( h = h µ 1 h 1 (4.5 h 1 h h h 1 h i i = h h (4.6 i h 1 i h 1 = h h 1 h = h T h 1 h (4.7 h 1 h (4.8 ( i h 1 i = ( h h 1 h i ( = h T h 1 h i ( = h T h 1 h h h ( = h T h 1 h h µ 1 h (4.8 1

24 (4.8 µ 1 (4.9 µ 1 h T h 1 h (4.9 h 1 µ 1 h h h 1 ( h 1 = h 1 µ 1 h ( LR LLL 4.1. h µ h 1 1 h 1 h 1 h h h 1 1 h 1 h 1 1 h 1 h 1 µ 1 h 4.1: LLL

25 Algorithm 1 4.1:LLL Algorithm 1: Input H = [h 1...h M ],T = I M = [t 1...t M ] : set p, δ = 3/4, ĥ1 = h 1 3: for p = 0 to M do 4: for q = p 1 to 1 do 5: Calculate µ p,q = ĥh q h p ĥ q 6: h p h p µ p,q h q (LR 7: t p t p µ p,q t q 8: end for 9: Let ĥp = h p 10: for q = p 1 to 1 do 11: Calculate µ p,q = ĥh q h p ĥq 1: ĥ p ĥp µ p,q ĥ q (GS 13: end for 14: if δ ĥp 1 > ĥp + µ p,p 1 ĥ p 1 then 15: swap the (p 1-th columns h p 1,t p 1 and the p-th columns h p,t p of H and 16: end if T,respectively. 17: p max(p 1, 18: if p = then 19: let ĥ1 h 0: go to 4: 1: else : p p + 1 3: go to 4: 4: end if 5: end for 6: Output H H = [h 1,..., h M ],T = [t 1,..., t M ] 3

26 4.3 LR Aided Detection (LRAD. LLL H.,, T. T. LR. y = Hs + z = (HT(T 1 s + z = H v + z (4.11, H HT, v T 1 s. (, T, H, H., LLL T. LRAD MMSE,., T 1 s (MMSE ṽ (MMSE. s (MMSE = H ȳ = ( H H H 1 H H ȳ (4.1 ṽ (MMSE = T 1 s (MMSE (4.13, ṽ (MMSE ˆv (MMSE. ˆv (MMSE = Q[ṽ (MMSE ] (4.14, ˆv (MMSE T ŝ (MMSE. 4.. ŝ = Tˆv (MMSE ( LR M=N=4, M=N=8 QPSK, 16QAM, 64QAM, ZF, MMSE, ML E b /N 0, BER. 4

27 送信信号 s y = Hs + z ~ s の推定 送信側 受信側 通信路 H L L Lアルゴリズム H, T を生成 AWGN T - 1 の vɶ T に変換 vɶ = 1 vɶ T sɶ 量子化 vˆ = Q [ ] ŝ に変換 sˆ = T vˆ vɶ 誤り判定 4.: LR 5

28 4.3: LRAD QPSK (M=N=4 4.4: LRAD QPSK (M=N=8 4.5: LRAD 16QAM (M=N=4 4.6: LRAD 16QAM (M=N=8 4.7: LRAD 64QAM (M=N=4 4.8: LRAD 64QAM (M=N=8 6

29 4.5 Lattice-Reduction BER., ML,.,ZF MMSE BER, ML Lattice Reduction MMSE,. 7

30 5 Forward&Backward LR (F&B LR 5.1 LLL LR BER. LLL, BER F&B LR. 5. F&B LR LLL H BER., 16QAM, M = N = 8 BER 5.1. BER. LLL H,,.F&B LR F&B LR F&B LR. s (MMSE = H ȳ = ( H H H 1 H H ȳ (5.1 ṽ = T (j 1 s (MMSE : j [1, ] (5. ˆv (j = Q[ṽ (j ] (5.3 ŝ (j = T (jˆv (j (5.4 ŝ = arg min j [1,] y Hŝ(j (5.5 (5.5, j, ŝ., LLL T T (j =1, LLL T T (j =. 8

31 LR LLL MMSE 16QAM 0dB (M=8 N=8 BER Transmitter Signal 5.1: BER(M = N = 8, 16QAM, E b /N 0 =17dB 入力 H, sɶ 昇順 -LR:T (1 (1 (1 1 vɶ = ( T sɶ (1 (1 ˆ [ vɶ ] v =Q = (1 (1 (1 sˆ T vˆ 準直交化空間のに vɶ を量子化する vˆ を s空間に戻す vɶ 降順 -LR:T ( ( ( 1 vɶ = ( T sɶ v =Q ( ( ˆ [ vɶ ] = ( ( ( sˆ T vˆ sˆ = argmin y Hsˆ j j {1,} ( j y Hs ( ˆ の中で最も小さい ŝ を判定信号とする 5.: F&B 9

32 Algorithm 5.1:Backward LLL Algorithm 1: Input H = [h 1,..., h M ],T = I M = [t 1,..., t M ] : set p M 1, δ = 3/4, ĥm = h M 3: for p = M 1 to 1 do 4: for q = p + 1 to M do 5: Calculate µ p,q = ĥh q h p ĥ q 6: h p h p µ p,q h q (LR 7: t p t p µ p,q t q 8: end for 9: Let ĥp = h p 10: for q = p + 1 to M do 11: Calculate µ p,q = ĥh q h p ĥ q 1: ĥ p ĥp µ p,q ĥ q (GS 13: end for 14: if δ ĥp+1 ĥp + µ p,p+1 ĥ p+1 then 15: p p 1 16: else if δ ĥp+1 > ĥp + µ p,p+1 ĥ p+1 then 17: swap the (p + 1-th columns h p+1,t p+1 and the p-th columns h p,t p of H and T,respectively. 18: p min(p + 1, M 1 19: if p M then 0: goto (5 1: else if p > M then : ĥ M h M 3: end if 4: end if 5: H H = [h 1,..., h M ], T = [t 1,..., t M ] 6: end for 30

33 5.4 M=N=4, M=N=6,M=N=8,. QPSK, 16QAM, 64QAM, MMSE E b /N 0, BER. 5.5,F&B LLL LR BER 3[dB]BER. BER., LLL T (j=1 LLL T (j= ŝ,. F&B LR., ML BER BER. 31

34 5.3: F&B LR QPSK (M=N=4 5.4: F&B LR QPSK (M=N=6 5.5: F&B LR QPSK (M=N=8 5.6: F&B LR 16QAM (M=N=4 5.7: F&B LR 16QAM (M=N=6 5.8: F&B LR 16QAM (M=N=8 3

35 5.9: F&B LR 64QAM (M=N=4 5.10: F&B LR 64QAM (M=N=6 5.11: F&B LR 64QAM (M=N=8 33

36 6 Seysen s 6.1 Seysen s LLL H. Seysen s. 6. Seysen s Seysen s. Seysen s H, H. H. (1 Lattice H = [h 1 h M ] (6.1 [ ] { (H DualLattice H = h 1 h M = H H } 1 H H H = (H H = (H H (6. T := [t 1 t M ] = I M (6.3,, G G. ( (3 G H H H (6.4 G H H H = ( H H H 1 (6.5 (6.6 Set H := H (6.7 H := H (6.8 34

37 (4 λ i,j = x i,j (6.9 ( G j,i with x i,j 1 G i,i G j,i G j,j = 1 ( h H j h i hh h j hi i h j for all (i, j(i j (6.10 G i,j G i j., G i,j G i j. (5 ( ( i,j = S H S H i,j = h i h i + h j h j h i h i h j h j ( = G j,j G i,i R{λ i,jx i,j } λ i,j for all(i, j, i j (6.11 where h i = h i + λ i,j hj (6.1 h j = h j λ i,j h i (6.13 (6 T = I, λ i,j (i, j 0 (i.e.,λ i,j = 0 for all (i, j. 1. (6.15,(s, t. ( ( (s, t = arg max i,j with i,j = S H S H i,j (i,j (6.14 = G j,j G i,i ( R{λ i,j x i,j } λ i,j (6.15. G G. H ] s (i.e., H = [ h 1 h h s 1 h s h s+1 h M with h i = h i + λ i,j h j,, G. G s,j = G s,s = H ( hs + λ s,t ht hj = ( hh s hj + λ s,t hh t hj = G s,j + λ s,t G t,j : j s (6.16 h H s (6.17 G j,s = G s,j = h T s h j = h H j h s (

38 ,G. And G t,j = G t,t = G j,t = G H j,t H ( h t λ s,t h ( hh s h j = t h j λ s,t h H h s j = G t,j + λ s,tg a,j : j s (6.19 h H s (6.0 (6.1 h s = h s + λ s,t ht (6. T s = t s + λ s,t t t (6.3 h t = h t λ s,t h s (6.4 ] H s,t = [ h 1 h h s 1 h s h s+1 h M (6.5 T s,t = [ t 1 t t s 1 t ] st s+1, t M (6.6 [ H s,t = h 1 h h t 1h h t t+1 h ] M (6.7 (7 λ i,j i = j (i, j 0. (8 ((7,( Seysen s LLL H. M=N=4, M=N=6, M=N=8 QPSK,16QAM,64QAM, MMSE

39 6.1: Seysen s LR QPSK (M=N=4 6.: Seysen s LR QPSK (M=N=6 6.3: Seysen s LR QPSK (M=N=8 6.4: Seysen s LR 16QAM (M=N=4 6.5: Seysen s LR 16QAM (M=N=6 6.6: Seysen s LR 16QAM (M=N=8 37

40 6.7: Seysen s LR 64QAM (M=N=4 6.8: Seysen s LR 64QAM (M=N=6 6.9: Seysen s LR 64QAM (M=N=8 38

41 6.4 M=N=4 LLL LR Seysen s LR 0.[dB] BER. M=N=6 LLL LR Seysen s LR 1.3[dB] BER. M=N=8 LLL LR Seysen s LR.5[dB] BER. Seysen s LLL,,, Seysen s., Seysen s, Seysen s Measure. Seysen s Measure H H, LLL,., BER. 39

42 7 Reciprocal Lattice-Reduction(LR LLL 7.1 LLL H H = [h 1 h M ].,,, H H 1., H = (H H = (H H LLL,, H T [ ( ]., H H [ (T ] H Reciprocal LR LLL H Reciprocal Lattice. H ( H H = H ( H H H 1 (7.1 (1LLL (LLL H = [ ] h 1 h M, T := I M (7. ĥ 1 = h 1 (7.3 H = ] [ ] [h 1 h M, T = t 1 t M (7.4. H = H T (7.5 40

43 (7.5. H H = ( H T H = T H H H = T H { ( H H } H = T H H (7.6 (7.6. (H H = (T H H = H (T H = H (T H 1 (7.7,T H. ( T H = ( T H 1. (7.7. ( y = Hs + z = H T H 1 ( T H s + z = H H v + z (7.8 ( H H ( = H T H 1, v = T H s. (7.8 ZF,MMSE. s (ZF = H y = ( H H H 1 H H y (7.9 s (MMSE = { (H H H + γ 1 I M 1 H H } y (7.10 s ŝ. ṽ = T H s (7.11 ˆv = Q [ṽ] (7.1 ( ŝ = T H 1 ˆv ( H Reciprocal Lattice LLL. M=N=4, M=N=6, M=N=8 QPSK,16QAM,64QAM, MMSE

44 7.1: Reciprocal LR QPSK (M=N=4 7.: Reciprocal LR QPSK (M=N=6 7.3: Reciprocal LR QPSK (M=N=8 7.4: Reciprocal LR 16QAM (M=N=4 4

45 7.5: Reciprocal LR 16QAM (M=N=6 7.6: Reciprocal LR 16QAM (M=N=8 7.7: Reciprocal LR 64QAM (M=N=4 7.8: Reciprocal LR 64QAM (M=N=6 43

46 7.9: Reciprocal LR 64QAM (M=N=8 7.4, Reciprocal LR LR BER=10 5, M=N=4 BER 0.3[dB], M=N=8 BER 3[dB]. Reciprocal LR BER. Seysen s,., Reciprocal,. F&B. 44

47 8 SIC Ordering SIC 8.1 Successive Interference Cancellation(SIC, LR, Ordering SIC(OSIC. 8. SIC(Successive Interference Cancellation SIC, M N MIMO (M 1 N, (M N.,, BER. 45

48 , ZF SIC. M = N = , 4 4 MIMO. H h h h h h h h h = h h h h h h h h s = s s s s z 1 z z 3 y y 1 y = y 3 y4 z 4 8.1: 4 4 MIMO 4 s 4 ZF. s = (H H H 1 H H y = [s 1, s, s 3, s 4 ] T (8.1, ZF s 4, y H. y (1 = y h 4 s 4 (8. = [h 1, h, h 3 ] T [s (1 1, s(1, s(1 3 ]T (8.3 = H (1 s (1 + z (8.4 (8.5 H (1 [h 1, h, h 3 ] T s (1 [s (1 1, s(1, s(1 3 ]T (8.6 y y (1,. 46

49 8., 3 4 MIMO. H ( = h h h h h h h h h h h h s s (1 1 (1 (1 = s s (1 3 z 1 z z 3 z 4 y y (1 1 y (1 (1 = (1 y 3 y (1 4 8.: 3 4 MIMO, 3 4 MIMO, 3 s (1 3 ZF. s (1 = (H (1H H (1 1 H (1H y (1 = [s (1 1, s(1, s(1 3 ]T (8.7, ZF s (1 3, y (1 H (1. y ( = y (1 h 3 s (1 3 (8.8 = [h 1, h ] T [s ( 1, s( ]T (8.9 = H ( s ( + z (8.10 (8.11 H ( [h 1, h ] T s ( [s ( 1, s( ]T (8.1 (

50 8.3, 4 MIMO. H ( h h h h = h h h h s ( ( s 1 = ( s z 1 z z 3 z 4 y y ( 1 y ( ( = ( y 3 y ( 4 8.3: 4 MIMO, 4 MIMO, s ( ZF. s ( = (H (H H ( 1 H (H y ( = [s ( 1, s( ]T (8.14, ZF s (, y ( H (. y (3 = y ( h s ( (8.15 = [h 1 ][s (3 1 ] (8.16 = H (3 s (3 + z (8.17 (8.18. H (3 [h 1 ] s (3 [s (3 1 ] (8.19 s = [s (3 1, s(, s(1 3, s 4] T (8.0, SIC. 48

51 8.3 LR with SIC SIC, s m y m 1 = y m h m s m. LR SIC. H 4 H 4. LR. y 4 = 1 y + ( P 1H 1 + j 1 + j 1 + j 1 + j (8.1 H 4 ṽ 4. ṽ 4 = (H H 4 H 4 1 H H 4 y 4 = W H 4 y 4 = [w 4,1, w 4, w 4,3 w 4,4 ] H y 4 (8. ṽ 4,4 = w4,4 H y 4. s v. v 4 ˆv 4,4., y 4, ˆv 4,4 y 3. y 3 = y 4 h 4,4ˆv 4,4 = [h 3,1, h 3,, h 3,3][v 3,1, v 3,, v 3,3 ] T + 1 T 1 z = H 3v T 1 z ( MIMO LR. ṽ 3 = (H H 3 H 3 1 H H 3 y 3 = W H 3 y 3 ṽ 3,3,. = [w 3,1, w 3,, w 3,3 ] H y 3 (8.4 ṽ 3,3 = w H 3,3y 3 (8.5, ṽ 3,3, ˆv 3,3. s v. v 3 ˆv 3,3., y 3, ˆv 3,3 y. 49

52 y = y 3 h 3,3ˆv 3,3 = [h,1, h,][v,1, v, ] T + 1 T 1 z = H v + 1 T 1 z (8.6 4 MIMO LR. ṽ = (H H H 1 H H y = W H y ṽ,,. = [w,1, w, ] H y (8.7 ṽ, = w H,y (8.8, ṽ,, ˆv,. s v. v ˆv,., y, ˆv, y 1. y 1 = y h,ˆv, = [h 1,1][v 1,1 ] + 1 T 1 z 1 4 MIMO LR. ṽ 1,1,. = H 1v T 1 z (8.9 ṽ 1,1 = w H 1,1y 1 (8.30, ṽ 1,1, ˆv 1,1. ˆv = [û 1,1, û,, û 3,3, û 4,4 ]. s = Tˆv ( P j 1 + j. 1 + j (8.31 ŝ, ŝ., LR with SIC. 8.5 SIC. 50

53 入力 H, y, m = M v H ɶ = w y,, v m m m m m m m = Q vɶ m m ˆ [ ],, if ( m > 1 NO m 1 m m, m m, m [,,, ] m 1 m 1,1 m 1, m 1, m 1 v v v m 1 ˆ [ ˆ,, ˆ,, ˆ ] m = y y h = H h h h v = = vɶ YES 1,1 m, m M, M 出力 = P + sˆ Tvˆ ( 1(1 1 j 8.4: SIC 51

54 8.4 LR with Ordering SIC(OSIC Ordering SIC, SIC BER BER., ˆv m.,.,. (H H H 1 ˆv m., (H H H 1 ˆv m SIC. ˆv.,,. y, H, s, z. s = [Re(s T Im(s T ] T (M 1 (8.3 y = [Re(y T Im(y T ] T (M 1 (8.33 z = [Re(z T Im(z T ] T (M 1 (8.34 [ ] H Re(H Im(H = (N M (8.35 Im(H Re(H M = N = 4, M = N = 6, M = N = 8 QPSK, 16QAM 64QAM E b /N 0 BER. 5

55 8.5: LR with OSIC QPSK (M=N=4 8.6: LR with OSIC QPSK (M=N=6 8.7: LR with OSIC QPSK (M=N=8 8.8: LR with OSIC 16QAM (M=N=4 53

56 8.9: LR with OSIC 16QAM (M=N=6 8.10: LR with OSIC 16QAM (M=N=8 8.11: LR with OSIC 64QAM (M=N=4 8.1: LR with OSIC 64QAM (M=N=6 54

57 8.13: LR with OSIC 64QAM (M=N=8 8.5 LR with OSIC, LRAD BER = 10 5, 5dB. 8 8MIMO 16QAM 64QAM, BER., SIC BER. SIC,, BER. 55

58 9 Reciprocal Lattice Forward&Backward LR (F&B Reciprocal Reciprocal Lattice 5 F&B LR F&B Reciprocal H ( H H = H ( H H H 1 (9.1 Reciprocal (9.1 H LLL., H LLL. LLL H (1, T (1, LLL H (, T (, (9., (9.3. LLL H (1,T (1, LLL H (, T (, (9.4, (9.5. H (1 = H ( = [h 1 h M ] (9. T (1 = T ( := I M (9.3 H (1 = [h 1 (1 h M (1 ] T (1 = [t 1 (1 t M (1 ] (9.4 H ( = [h 1 ( h M ( ] T ( = [t 1 ( t M ( ] (9.5 56

59 7 Reciprocal, (9.6. H (1 = H (1 T (1 H ( = H ( T ( (9.6 H H (1 = ( = T H (1 ( H H ( = = T H ( H (1 T (1 H = T H { ( H H } H H ( T ( H = T H { ( H H } H (9.7, (9.8 pseudo-inverse. ( H H (1 ( H H ( = ( = ( T H (1 H = H ( T H ( H = H ( T H (1 T H ( (1 H H 1 = T H (1 H (9.7 ( H H = T H ( H (9.8 = H ( = H ( (9.9, (9.10,. 1 T(1 H (9.9 T H ( 1 (9.10, y = Hs + z = H(T H (1 1 T H (1 s + z y = Hs + z = H(T H ( 1 T H ( s + z = (H H (1 v + z (9.11 = (H H ( v + z (9.1 (H H = H (T H 1 v = T H s (9.13 (9.11, (9.1. s (MMSE = H ȳ = ( H H H 1 Hȳ (9.14 ṽ (j = T (j H s (MMSE (9.15 ˆv (j = Q[ṽ (j ] (9.16 ŝ (j = (T (j H 1ˆv (j (9.17 ŝ = arg min j [1,] y Hŝ(j (

60 9.3 QPSK, 16QAM, 64QAM, 4 4MIMO, 6 6MIMO, 8 8MIMO F&B Reciprocal LRAD.,. CSI. 0, 1. 0, N 0 [W/Hz]. 9.4 BER F&B Reciprocal LRAD 4 4MIMO,6 6MIMO,8 8MIMO QPSK, 16QAM, 64QAM BER. 58

61 9.1: F&B Reciprocal QPSK (M=N=4 9.: F&B Reciprocal QPSK (M=N=6 9.3: F&B Reciprocal QPSK (M=N=8 9.4: F&B Reciprocal 16QAM (M=N=4 59

62 9.5: F&B Reciprocal 16QAM (M=N=6 9.6: F&B Reciprocal 16QAM (M=N=8 9.7: F&B Reciprocal 64QAM (M=N=4 9.8: F&B Reciprocal 64QAM (M=N=6 60

63 9.9: F&B Reciprocal 64QAM (M=N=8 9.5, F&B Reciprocal LRAD BER= MIMO 4dB BER. Reciprocal LR BER F&B Reciprocal LRAD BER BER= MIMO 1dB. LLL s (j=1 LLL s (j=,., Reciprocal LRAD F&B LRAD BER, BER. 61

64 10 Ordering SIC Forward&Backward LR(F&B OSIC Ordering-SIC 5 F&B LR F&B OSIC,., F&B LRAD, Lattice Reduction H (1, T (1, Lattice Reduction H (, T (,, (9.5. (9,1 (9,5, F&B LRAD. s (MMSE = H ȳ = ( H H H 1 H H ȳ (10.1 ṽ = T (j 1 s (MMSE : j 1, (10. ˆv = Q[ṽ (j ] (10.3 ŝ (j = T (jˆv (j (10.4 ŝ = arg min j 1, [ y Hŝ(j ] (10.5 F&B LRAD H (1,, H ( Ordering-SIC., (H (1H H (1 1, (H (H H ( 1,, ˆv m (1,ˆv m (,, SIC, [ˆv (1 m 1 ˆv(1 1 ],[ˆv( m 1 ˆv( 1 ] ˆv. 6

65 ,. ŝ (1 = T (1ˆv (1 (10.6 ŝ ( = T (ˆv ( (10.7 arg min i (1, y Hŝ(i ( M = N = 4, M = N = 6, M = N = 8, QPSK, 16QAM 64QAM E b /N 0 BER. 入力 H, sɶ Forward-LR: H (1 (1, T Backward-LR: H ( (, T Ordering : (1 H o Ordering : ( H o QR 分解 : (1 R QR 分解 : ( R SIC : (1 ˆv SIC : ( ˆv = (1 (1 (1 sˆ T vˆ = ( ( ( sˆ T vˆ s y Hs ˆ = argmin ˆ j j {1,} ( 10.1: 63

66 10.: F&B OSIC QPSK (M=N=4 10.3: F&B OSIC QPSK (M=N=6 10.4: F&B OSIC QPSK (M=N=8 10.5: F&B OSIC 16QAM (M=N=4 64

67 10.6: F&B OSIC 16QAM (M=N=6 10.7: F&B OSIC 16QAM (M=N=8 10.8: F&B OSIC 64QAM (M=N=4 10.9: F&B OSIC 64QAM (M=N=6 65

68 10.10: F&B OSIC 64QAM (M=N= F&B OSIC 4 4MIMO BER 0.dB, MIMO BER. F&B LR MIMO. 8 8MIMO 1dB. F&B LR OSIC BER.,,,. 66

69 11 Reciprocal lattice F&B LR OSIC Reciprocal Lattice 5 F&B LR., 8 Ordering-SIC, BER Reciprocal F&B LR OSIC(Reciprocal F&B OSIC 7 Reciprocal. H ( H H = H ( H H H 1 (11.1 9, (11.1 H LLL,, LLL. LLL H (1, T (1, LLL H (, T (., (11., (11.3. H (1 = H ( = [h 1 h M ] (11. T (1 = T ( := I M (11.3 LLL H (1,T (1, LLL H (, T (., (11.4, (11.5. H (1 = [h 1 (1 h M (1 ] T (1 = [t 1 (1 t M (1 ] (11.4 H ( = [h 1 ( h M ( ] T ( = [t 1 ( t M ( ] (

70 7 Reciprocal, (11.6. H (1 = H (1 T (1 H ( = H ( T ( (11.6 H H (1 = ( = T H (1 ( H H ( = = T H ( H (1 T (1 H = T H { ( H H } H H ( T ( H = T H { ( H H } H (1 H H (1 = T H (1 H (11.7 ( H H ( (11.7, (11.8 pseudo-inverse. ( ( H H (1 = T H (1 H ( ( = H T H (1 = H ( ( H H ( = T H ( H ( = H T H ( (11.9, (11.10,. = T H ( H ( T(1 H (11.9 = H ( T H ( 1 (11.10, y = Hs + z = H(T H (1 1 T H (1 s + z y = Hs + z = H(T H ( 1 T H ( s + z (H H = H (T H 1 = (H H (1 v + z (11.11 = (H H ( v + z (11.1 v = T H s ( H (1, H ( Ordering-SIC., (H H (1 H (1 1, (H H ( H ( 1, ˆv m (1,ˆv m (, SIC, [ˆv (1 m 1 ˆv(1 1 ],[ˆv( m 1 ˆv( 1 ] ˆv. ŝ (1 = (T H (1 1ˆv (1 (11.14 ŝ ( = (T H ( 1ˆv ( (11.15,. arg min j (1, y Hŝ (j (

71 11.1. M = N = 4, M = N = 6, M = N = 8 QPSK, 16QAM 64QAM E b /N 0 BER. # 入力 H, sɶ H H H H # H 1 H H [( ] 昇順 -LR: H T # #, (1 (1 降順 -LR: H T # #, ( ( Ordering : H QR 分解 : R # (1 # (1 Ordering : H QR 分解 : R # ( # ( SIC : (1 ˆv SIC : ( ˆv sˆ (1 # (1 =T vˆ (1 ( # ( sˆ =T vˆ ( s y Hs ˆ = argmin ˆ j j {1,} ( 11.1: 69

72 11.: Reciprocal F&B OSIC QPSK 11.3: Reciprocal F&B OSIC QPSK (M=N=4 (M=N=6 11.4: Reciprocal F&B OSIC QPSK 11.5: Reciprocal F&B OSIC 16QAM (M=N=8 (M=N=4 70

73 11.6: Reciprocal F&B OSIC 16QAM 11.7: Reciprocal F&B OSIC 16QAM (M=N=6 (M=N=8 11.8: Reciprocal F&B OSIC 64QAM 11.9: Reciprocal F&B OSIC 64QAM (M=N=4 (M=N=6 71

74 11.10: Reciprocal F&B OSIC 64QAM (M=N= Reciprocal F&B OSIC, 10 F&B LR OSIC BER.,, BER. 7

75 1 1.1, BER. BER.., BER,.,.,, H (T Flop. Flop Floating point operations. x y x+y, x-y, xy, x/y 1[Flop] M (N + M (N + M 1 A B. a 1,1 a 1,(N +M A =..... a M,1 a M,(N +M, B = b 1. b (N +M, a 1,1 a 1,(N +M b 1 b (N +M, (1.1 73

76 (N + M (N + M 1, 4(N + M 1[Flops]., A. A M, 4(N + M 1 M [Flops]., 8M (N + M M [Flops]. ( s = H ȳ, ṽ = H ȳ, ȳ = Q T ȳ 1.. M M M 1 A = a 1,1 a 1,M..... a M,1 a M,M, B = b 1. b M (1., a 1,1 a 1,M b 1 b M, M M 1, 4M 1[Flops]., A, A M, (4M 1 M [Flops]., 8M M [Flops]. (ṽ = T 1 s, ŝ = Tˆv, ṽ = R 1 ȳ, s = R 1 ȳ 1..3 M M M 1 A B. A = a 1,1 a 1, a 1,M 0 a, a,m , B = b 1. b M ( a M,M, a 1,1 a 1,M b 1 b M, 74

77 M M 1, 4M 1[Flops].,, a, a,m b b M, M 1 M. 4M 3[Flops]. A,.. ( SIC M m=1 (m 1 = [ 1 M (M + 1] M = 4M [F lops] ( ŝ ŝ = arg min s C s[ y Hs ] (1.5 Hs 8MN N [Flops]., y Hs N [Flops]., y Hs. y Hs N,. (y hs (y hs N, N N 1, 4N 1[Flops]. (8MN + 4N 1[Flops] Shift and Scale Shift-Back and Scale-Back Shift and Scale, Shift-Back and Scale-Back.,. Shift and Scale, Shift-Back and Scale-Back. Shift and Scale ȳ S 1 [ȳ + ( K 1H1] (1.6 75

78 Shift back and Scale back Shift and Scale, Shift Back and Scale Back,, 8N [Flops]. s S s S ( K 1 (1.7 4N 4N 76

79 1.3, LRAD, 4 (LRAD. 1.1: LRAD 1.: ( :[Flops] 77

80 1.3. F&B LR, (F&B LR. 1.3: F&B LRAD 1.4: ( :[Flops] Seysen s LR, (Seysen s LR. 1.5: Seysen s LRAD Shift and Scale vɶ = H y S sˆ = 合計 S Tvˆ (Seysen s Algorithmにより準直交化した H Shift back and Scale back 8 M 8N 8 M ( N + M M 8N M M MN M N 1.6: ( :[Flops] M = N = 4 M = N = 6 M = N =

81 1.3.4 Reciprocal LR, (Reciprocal LR. 1.7: Reciprocal LR 1.8: ( :[Flops] LR with OSIC, (LR with OSIC. 1.9: LR with OSIC 1.10: ( :[Flops] 79

82 ɶ { F&B Reciprocal, 9 (F&B Reciprocal. 1.11: F&B Reciprocal s = H y M ( N + M M } Shift and Scale = j ( j ( j S : [1, ] ɶ v H y = S ˆ ( j ˆ ( j s Tv Shift back and Scale back j 合計 8 N {8 M ( N + M M} (8 M 8 N ( j sˆ = arg min [ y Hs ] (8MN + 4N 1 [1,] M M 4MN 10M 3N 1.1: ( :[Flops] M = N = 4 M = N = 6 M = N = F&B OSIC, 10 (F&B OSIC. 1.13: F&B OSIC 1.14: ( :[Flops] 80

83 ɶ Recipeocal F&B OSIC, 11 (Recipeocal F&B OSIC. 1.15: Recipeocal F&B OSIC s = H y M ( N + M M Shift and Scale S y = vɶ = R y ( j 1 ( j S S IC = T S Q y S j j j ( ( ( sˆ T vˆ Shift back and Scale back 8 N 8 M ( N + M M M ( 4 M (8 M M 8 N 1.16: ( :[Flops] M = N = 4 M = N = 6 M = N = ( j sˆ = arg min [ y Hs ] (8MN 4N 1 j 合計 [1, ] M + 3 M N 4 M + 4 N 81

84 13 Forward&Backward LR with OSIC ( ,, BER Forward & Backward LR with OSIC(F&B OSIC,. 13. F&B OSIC F&B OSIC Lattice Reduction BER,,.. F&B OSIC,,. (13.1. arg min i (1, [ y Hŝ (i ] (13.1 y Hŝ (i = y HTT 1 ŝ (i = y H ˆv (i = y Q R ˆv (i = Q H y R ˆv (i = y R ˆv (i (13., (13.1 (8MN + 4N 1[Flops], (13. (4M + M[Flops]., y R ˆv (i. 8

85 13.3 1(,..,. LR with OSIC, LR with OSIC MIMO,6 6MIMO,8 8MIMO QPSK, 16QAM, 64QAM. 83

86 16 LR with OSIC correct y -R v (M=4 N=4 LR with OSIC error y -R v (M=4 N=4 35 LR with OSIC correct y -R v (M=6 N=6 LR with OSIC error y -R v (M=6 N= Average y -R v Average y -R v : QPSK (M=N=4 13.: QPSK (M=N=6 60 LR with OSIC correct y -R v (M=8 N=8 LR with OSIC error y -R v (M=8 N= LR with OSIC correct y -R v (M=4 N=4 LR with OSIC error y -R v (M=4 N= Average y -R v Average y -R v : 16QAM 13.3: QPSK (M=N=8 (M=N=4 84

87 30 LR with OSIC correct y -R v (M=6 N=6 LR with OSIC error y -R v (M=6 N= LR with OSIC correct y -R v (M=8 N=8 LR with OSIC error y -R v (M=8 N= Average y -R v 15 Average y -R v : 16QAM 13.6: 16QAM (M=N=6 (M=N=8 1 LR with OSIC correct y -R v (M=4 N=4 LR with OSIC error y -R v (M=4 N=4 5 LR with OSIC correct y -R v (M=6 N=6 LR with OSIC error y -R v (M=6 N= Average y -R v 6 Average y -R v : 64QAM 13.8: 64QAM (M=N=4 (M=N=6 85

88 45 40 LR with OSIC correct y -R v (M=8 N=8 LR with OSIC error y -R v (M=8 N= Average y -R v : 64QAM (M=N=8 9, LR with OSIC,., LR with OSIC X(E b /N 0., Forward LR with OSIC, Backward LR with OSIC ,4 4MIMO, 6 6MIMO, 8 8MIMO QPSK, 16QAM, 64QAM X(E b /N 0. (1Forward-LR-OSIC から推定値 If y Else go to ( (1 R v < ˆ X ( E N b 0 (Backward-LR-OSIC から推定値 ˆv (1 を導出 end ( ˆv を導出 13.10: 86

89 16 14 LR with OSIC correct y -R v (M=4 N=4 LR with OSIC error y -R v (M=4 N=4 X[E b /N 0 ] (M=4 N= LR with OSIC correct y -R v (M=6 N=6 LR with OSIC error y -R v (M=6 N=6 X[E b /N 0 ] (M=6 N=6 1 5 Average y -R v Average y -R v : (M=N=4 X(E b /N 0 QPSK 13.1: (M=N=6 X(E b /N 0 QPSK LR with OSIC correct y -R v (M=8 N=8 LR with OSIC error y -R v (M=8 N=8 X[E b /N 0 ] (M=8 N= LR with OSIC correct y -R v (M=4 N=4 LR with OSIC error y -R v (M=4 N=4 X(E b /N 0 (M=4 N= Average y -R v 30 Average y -R v : (M=N=8 X(E b /N 0 QPSK 13.14: X(E b /N 0 16QAM (M=N=4 87

90 30 LR with OSIC correct y -R v (M=6 N=6 LR with OSIC error y -R v (M=6 N=6 X[E b /N 0 ] (M=6 N= LR with OSIC correct y -R v (M=8 N=8 LR with OSIC error y -R v (M=8 N=8 X[E b /N 0 ] (M=8 N= Average y -R v 15 Average y -R v : X(E b /N 0 16QAM 13.16: X(E b /N 0 16QAM (M=N=6 (M=N=8 1 LR with OSIC correct y -R v (M=4 N=4 LR with OSIC error y -R v (M=4 N=4 X(E b /N 0 (M=4 N=4 5 LR with OSIC correct y -R v (M=6 N=6 LR with OSIC error y -R v (M=6 N=6 X[E b /N 0 ] (M=6 N= Average y -R v 6 Average y -R v : X(E b /N 0 64QAM 13.18: X(E b /N 0 64QAM (M=N=4 (M=N=6 88

91 45 40 LR with OSIC correct y -R v (M=8 N=8 LR with OSIC error y -R v (M=8 N=8 X[E b /N 0 ] (M=8 N= Average y -R v : X(E b /N 0 64QAM (M=N=8 9, MIMO, X(E b /N 0. F&B LR with OSIC, Forward LR with OSIC ˆv (1 Backward LR with OSIC ˆv (. X(E b /N 0, Forward LR with OSIC ˆv (1, Backward LR with OSIC ˆv (, X(E b /N 0,BER ,8 4 4MIMO, 6 6MIMO, 8 8MIMO QPSK, 16QAM, 64QAM BER Proposed method [1] QPSK (M=4 N=4 F&B LR with OSIC QPSK (M=4 N=4 LR with OSIC QPSK (M=4 N=4 ML QPSK (M=4 N=4 BER : 1 BER QPSK (M=N=4 89

92 10 0 Proposed method [1] QPSK (M=6 N=6 F&B LR with OSIC QPSK (M=6 N=6 LR with OSIC QPSK (M=6 N=6 ML QPSK (M=6 N= Proposed method [1] QPSK (M=8 N=8 F&B LR with OSIC QPSK (M=8 N=8 LR with OSIC QPSK (M=8 N=8 ML QPSK (M=8 N= BER BER : 1 BER QPSK 13.: 1 BER QPSK (M=N=6 (M=N= Proposed method [1] 16QAM (M=4 N=4 F&B LR with OSIC 16QAM (M=4 N=4 LR with OSIC 16QAM (M=4 N=4 ML 16QAM (M=4 N= Proposed method [1] 16QAM (M=6 N=6 F&B LR with OSIC 16QAM (M=6 N=6 LR with OSIC 16QAM (M=6 N=6 ML 16QAM (M=6 N= BER BER : 1 BER 16QAM 13.4: 1 BER 16QAM (M=N=4 (M=N=6 90

93 10 0 Proposed method [1] 16QAM (M=8 N=8 F&B LR with OSIC 16QAM (M=8 N=8 LR with OSIC 16QAM (M=8 N=8 ML 16QAM (M=8 N= Proposed method [1] 64QAM (M=4 N=4 F&B LR with OSIC 64QAM (M=4 N=4 LR with OSIC 64QAM (M=4 N=4 ML 64QAM (M=4 N= BER BER : 1 BER 16QAM 13.6: 1 BER 64QAM (M=N=8 (M=N= Proposed method [1] 64QAM (M=6 N=6 F&B LR with OSIC 64QAM (M=6 N=6 LR with OSIC 64QAM (M=6 N=6 ML 64QAM (M=6 N= Proposed method [1] 64QAM (M=8 N=8 F&B LR with OSIC 64QAM (M=8 N=8 LR with OSIC 64QAM (M=8 N=8 ML 64QAM (M=8 N= BER BER : 1 BER 64QAM 13.8: 1 BER 64QAM (M=N=6 (M=N=8 91

94 , X(E b /N 0, E b /N 0,, (1 (.,(1,, ( ,38.., 13.9, (1Forward Ordering-SIC が使われる確率 70% (Backward Ordering-SIC が使われる確率 30% とすると LR-MMSE LR-OSIC F&B-OSIC 8 8MIMO 163 [Flops] 1904 [Flops] 3760[Flops] (LR-OSIC+ ノルム計算 (F&B-OSIC = 606[Flops] となる (1 ( 13.9: 1 (M=N=8 9

95 1 0.9 Forward LR with OSIC BackwardLR with OSIC Forward LR with OSIC BackwardLR with OSIC Probability Probability : : 1 QPSK (M=N=4 QPSK (M=N= Forward LR with OSIC BackwardLR with OSIC Forward LR with OSIC BackwardLR with OSIC Probability Probability : : 1 QPSK (M=N=8 16QAM (M=N=4 93

96 1 0.9 Forward LR with OSIC BackwardLR with OSIC Forward LR with OSIC BackwardLR with OSIC Probability Probability : : 1 16QAM (M=N=6 16QAM (M=N= Forward LR with OSIC BackwardLR with OSIC Forward LR with OSIC BackwardLR with OSIC Probability Probability : : 1 64QAM (M=N=4 64QAM (M=N=6 94

97 1 0.9 Forward LR with OSIC BackwardLR with OSIC Probability : 1 64QAM (M=N=8 95

98 1400 Proposed method [1] QPSK (M=4 N=4 F&B LR with OSIC QPSK (M=4 N=4 LR with OSIC QPSK (M=4 N= Proposed method [1] QPSK (M=6 N=6 F&B LR with OSIC QPSK (M=6 N=6 LR with OSIC QPSK (M=6 N= FLOPS FLOPS : 1 QPSK 13.40: 1 QPSK (M=N=4 (M=N= Proposed method [1] QPSK (M=8 N=8 F&B LR with OSIC QPSK (M=8 N=8 LR with OSIC QPSK (M=8 N= Proposed method [1] 16QAM (M=4 N=4 F&B LR with OSIC 16QAM (M=4 N=4 LR with OSIC 16QAM (M=4 N= FLOPS 3000 FLOPS : 1 QPSK 13.4: (M=N=8 (M=N=4 1 16QAM 96

99 3000 Proposed method [1] 16QAM (M=6 N=6 F&B LR with OSIC 16QAM (M=6 N=6 LR with OSIC 16QAM (M=6 N= Proposed method [1] 16QAM (M=8 N=8 F&B LR with OSIC 16QAM (M=8 N=8 LR with OSIC 16QAM (M=8 N= FLOPS FLOPS : (M=N=6 1 16QAM 13.44: (M=N=8 1 16QAM 1400 Proposed method [1] 64QAM (M=4 N=4 F&B LR with OSIC 64QAM (M=4 N=4 LR with OSIC 64QAM (M=4 N= Proposed method [1] 64QAM (M=6 N=6 F&B LR with OSIC 64QAM (M=6 N=6 LR with OSIC 64QAM (M=6 N= FLOPS FLOPS : (M=N=4 1 64QAM 13.46: (M=N=6 1 64QAM 97

100 4500 Proposed method [1] 64QAM (M=8 N=8 F&B LR with OSIC 64QAM (M=8 N=8 LR with OSIC 64QAM (M=8 N= FLOPS : 1 64QAM (M=N=8 13.5,LR with OSIC, X(E b /N 0,., F&B LR with OSIC. BER F&B LR with OSIC, 1 BER., E b /N 0,, (1., E b /N 0, LR with OSIC,. 98

101 14 Sphere Detection (SD 14.1 ML Sphere Detection(SD. 14. Sphere Detection(SD SD, H s H s, y C 0,,,. y H s C 0 (14.1, H QR [ H N M = Q N M Q N (N M ] [ R M M 0 (N M M ] (14., Q Q R,. y = Q H y, C 0 = C 0 (Q H y, (14.1, y R s C 0 (14.3., R, M 1 y R s s.( 14.1,

102 y ɶ y h h h s M 1 y h h h s 1 M Hs = = y h h h sɶ N N1 N NM M ɶ ɶ ɶ ɶ ɶ ɶ y h s h s h s M y h s h s h s 1 1 M y h s h s h s ɶ ɶ ɶ N N1 1 N NM M M M ɶ ɶ y y 1 r r r s M 1 y r r sɶ M Rsɶ = ɶ y r s M 0 MM M ɶ ɶ ɶ y r s r s r s M M y r sɶ r sɶ M M = y r s ɶ M MM M ɶ 最下行に M 個の未知数 最下行に 1 個の未知数 14.1: ML 14.: SD y R s : y i r ii s i r im s M (i [1, M], y R s., s QPSK. SD,. y im r MM s M s M, y im r MM s M, s M (QPSK 4. 4 C 0 1, sm., 1 y M 1 r M 1M 1 s M 1 r M 1M s M, s M, s M., y M 1 r M 1M 1 s M 1 r M 1M s M s M 1, 4. 4, y M r MM s M + y M 1 r M 1M 1 s M 1 r M 1M s M C 0, s M 1., y M r MM s M + y M 1 r M 1M 1 s M 1 r M 1M s M C 0 sm 1, 1, s M,., C 0 1, C,.., s M s 1 s. 100

103 1 行目 : S 1 最小メトリック = 4 : 計算されたブランチメトリック 行目 : S 行目 : S 最小メトリック 4 を探索し終えるまでに要したブランチメトリックの演算回数は 0 回となる 14.3: M=3, QPSK, SD SD,. 14.3, M = 3, QPSK, SD.,,, SD.,, (., C 0., ,, C 0 C = 5., 1, 3, , 7 5,. 1, 4, 5, 4., 3 1,, 1, =4, 4. 1, 4,. 3, 101

104 ,., 3, 1, ,,. 1,, 14.3., 4, s 3, s, s , 0. ML,, 4 3 = 64,, 64 3 = 19, SD ML. SD ML,,,.,., SD. bestdist.,,,., P. y = 1 (y + ( P 1H[1,..., 1] T (

105 Algorithm :SD Algorithm 1: Input w = Q T y,g = R 1 : bestdist = 3: k K 4: dist k 0 5: e k = GW 6: x k = e kk 7: x k = max(x k, 0; x k = min(x k, Q max ; 8: y = (e kk x k /g kk 9: step k = sgn(v 10: while ( do 11: newdist = dist k + v 1: if (newdist < bestdist (x k 0 x k Q max then 13: if (k 1 then 14: for i = 1,..., k 1 do 15: e k 1,i = e ki vg ik 16: end for(14 17: k k 1 18: dist k = newdist 19: x k = e kk 0: x k = max(x k, 0; x k = min(x k, Q max ; 1: y = (e kk x k /g kk : step k = sgn(v 3: else 4: ˆx = x 5: bestdist = newdist 6: k k + 1 7: x k = x k + step k 8: step k = step k sgn(step k 9: if (x k < 0 x k > Q max then 30: x k = x k + step k 31: step k = step k sgn(step k 3: end if(9 33: y = (e kk x k /g kk 34: end if(13 35: else 36: if k = K then 37: {return ˆx} 38: else 39: k k : x k = x k + step k 41: step k = step k sgn(step k 4: if (x k < 0 x k > Q max then 43: x k = x k + step k 44: step k = step k sgn(step k 45: end if(4 46: y = (e kk x k /g kk 47: end if(36 48: end if(1 49: end while(10 103

106 14.3 QPSK MIMO M = N = 4 M = N = 6, M = N = 8 BER 14.4, 14.5, M = N = 4, M = N = 6 SD, C = 5, C = 10, C = 15, C =. M = N = 8 SD, C = 5, C = 10, C = 15, C = 0, C =., 16QAM M = N = 4 M = N = 6, M = N = 8 BER 14.7, 14.8, M = N = 4, M = N = 6 SD, C = 5, C = 10, C = 15, C =. M = N = 8 SD, C = 5, C = 10, C = 15, C = 0, C =., 64QAM M = N = 4 M = N = 6, M = N = 8 BER 14.7, 14.8, M = N = 4, M = N = 6 SD, C = 5, C = 10, C = 15, C =. M = N = 8 SD, C = 5, C = 10, C = 15, C = 0, C =., QPSK MIMO M = N = 4 M = N = 6, M = N = , 14.11, 14.1., 16QAM MIMO M = N = 4 M = N = 6, M = N = , 14.14, , 64QAM MIMO M = N = 4 M = N = 6, M = N = , 14.17,

107 10 0 SD QPSK (C=5 SD QPSK (C=10 SD QPSK (C=15 SD QPSK (C=INF 10 0 SD QPSK (C=5 SD QPSK (C=10 SD QPSK (C=15 SD QPSK (C=INF BER BER : SD QPSK BER (M=N=4 14.5: SD QPSK BER (M=N= SD QPSK (C=5 SD QPSK (C=10 SD QPSK (C=15 SD QPSK (C=0 SD QPSK (C=INF SD 16QAM (C=5 SD 16QAM (C=10 SD 16QAM (C=15 SD 16QAM (C=INF BER BER : SD QPSK BER (M=N=8 14.7: SD 16QAM BER (M=N=4 105

108 SD 16QAM (C=5 SD 16QAM (C=10 SD 16QAM (C=15 SD 16QAM (C=INF SD 16QAM (C=5 SD 16QAM (C=10 SD 16QAM (C=15 SD 16QAM (C=0 SD 16QAM (C=INF BER BER : SD 16QAM BER (M=N=6 14.9: SD 16QAM BER (M=N= SD 64QAM (C=5 SD 64QAM (C=10 SD 64QAM (C=15 SD 64QAM (C=INF 10 0 SD 64QAM (C=5 SD 64QAM (C=10 SD 64QAM (C=15 SD 64QAM (C=INF BER BER : SD 64QAM BER (M=N= : SD 64QAM BER (M=N=6 106

109 BER SD 64QAM (C=5 SD 64QAM (C=10 SD 64QAM (C=15 SD 64QAM (C=0 SD 64QAM (C=INF Number of Operations 10 3 SD QPSK (C=5 SD QPSK (C=10 SD QPSK (C=15 SD QPSK (C=INF : SD 64QAM BER (M=N= : SD QPSK (M=N=4 Number of Operations SD QPSK (C=5 SD QPSK (C=10 SD QPSK (C=15 SD QPSK (C=INF Number of Operations SD QPSK (C=5 SD QPSK (C=10 SD QPSK (C=15 SD QPSK (C=INF : SD QPSK (M=N= : SD QPSK (M=N=8 107

110 Number of Operations SD 16QAM (C=5 SD 16QAM (C=10 SD 16QAM (C=15 SD 16QAM (C=INF Number of Operations SD 16QAM (C=5 SD 16QAM (C=10 SD 16QAM (C=15 SD 16QAM (C=INF : SD 16QAM (M=N= : SD 16QAM (M=N=6 Number of Operations SD 16QAM (C=5 SD 16QAM (C=10 SD 16QAM (C=15 SD 16QAM (C=INF Number of Operations SD 64QAM (C=5 SD 64QAM (C=10 SD 64QAM (C=15 SD 64QAM (C=INF : SD 16QAM (M=N= : SD 64QAM (M=N=4 108

111 10 6 SD 64QAM (C=5 SD 64QAM (C=10 SD 64QAM (C=15 SD 64QAM (C=INF 10 8 SD 64QAM (C=5 SD 64QAM (C=10 SD 64QAM (C=15 SD 64QAM (C=INF Number of Operations Number of Operations : SD 64QAM (M=N=6 14.1: SD 64QAM (M=N= SD, C ML BER., ML., ML BER., C, 4 4 C = 5, 6 6 C = 10, 8 8 C = 15 E b /N 0 ML, E b /N 0 ML BER., BER=10 3 ML BER, BER. 109

112 15 LR-with OSIC Sphere Detection(SD ( ML SD LR with OSIC, ML,, SD. 15., LR with OSIC ṽ,, ˆv.. ȳ = Hs + z (15.1 ȳ = HTT 1 s + z (15. ȳ = H v + z (15.3 ȳ = Q R v + z (15.4 Q Tȳ = R v + Q T z (15.5 y = R v + z (15.6,(R T R 1, SIC ˆv m, ˆv m 1, ˆv 1. ˆv, y R ˆv. (15.6 y R ˆv z., y R ˆv, LR with OSIC. y = R v + z y R ˆv = z (

113 , X(E b /N 0. y Rˆv < X (E b /N 0 (15.8 (15.8,, LR with OSIC ˆv. ( 13 (15.8 ŝ. ŝ = Tˆv (15.9 y Rˆv > X (E b /N 0 (15.10, (15.10,, LR with OSIC, SD, SD ŝ.,, E b /N 0 SD BER, LR with OSIC, E b /N 0 ML BER, SD QPSK MIMO M = N = 4 M = N = 6, M = N = 8 BER 15.1, 15., M = N = 4 SD, C = 5. M = N = 6 SD, C = 10. M = N = 8 SD, C = 15., 16QAM M = N = 4 M = N = 6, M = N = 8 BER 15.4, 15.5, M = N = 4 SD, C = 5. M = N = 6 SD, C = 10. M = N = 8 SD, C = 15., 64QAM M = N = 4 M = N = 6, M = N = 8 BER 15.7, 15.8, M = N = 4 SD, C = 5. M = N = 6 SD, C = 10. M = N = 8 SD, C = 15., QPSK MIMO M = N = 4 M = N = 6, M = N = , 15.11, 15.1., 16QAM MIMO M = N = 4 M = N = 6, M = N = , 15.14, , 64QAM MIMO M = N = 4 M = N = 6, M = N = , 15.17,

114 10 0 Proposed method[] QPSK (C=5 SD QPSK (C=5 LR with OSIC QPSK ML QPSK 10 0 Proposed method[] QPSK (C=10 SD QPSK (C=10 LR with OSIC QPSK ML QPSK BER BER : QPSK BER 15.: QPSK BER (M=N=4 (M=N= Proposed method[] QPSK (C=15 SD QPSK (C=15 LR with OSIC QPSK ML QPSK 10 0 Proposed method[] 16QAM (C=5 SD 16QAM (C=5 LR with OSIC 16QAM ML 16QAM BER BER : QPSK BER 15.4: 16QAM BER (M=N=8 (M=N=4 11

115 10 0 Proposed method[] 16QAM (C=10 SD 16QAM (C=10 LR with OSIC 16QAM ML 16QAM 10 0 Proposed method[] 16QAM (C=15 SD 16QAM (C=15 LR with OSIC 16QAM ML 16QAM BER BER : 16QAM BER 15.6: 16QAM BER (M=N=6 (M=N= Proposed method[] 64QAM (C=5 SD 64QAM (C=5 LR with OSIC 64QAM ML 64QAM 10 0 Proposed method[] 64QAM (C=10 SD 64QAM (C=10 LR with OSIC 64QAM ML 64QAM BER BER : 64QAM BER 15.8: 64QAM BER (M=N=4 (M=N=6 113

116 10 0 Proposed method[] 64QAM (C=15 SD 64QAM (C=15 LR with OSIC 64QAM ML 64QAM Proposed method[] QPSK (C=5 QRM-MLD QPSK LR with OSIC QPSK SD QPSK(C=5 BER Number of Operations : 64QAM BER 15.10: QPSK (M=N=8 (M=N= Proposed method[] QPSK (C=10 QRM-MLD QPSK LR with OSIC QPSK SD QPSK (C= Proposed method[] QPSK (C=15 QRM-MLD QPSK LR with OSIC QPSK SD QPSK (C=15 Number of Operations 10 3 Number of Operations : QPSK 15.1: QPSK (M=N=6 (M=N=8 114

117 Number of Operations Proposed method[] (C=5 16QAM QRM-MLD 16QAM LR with OSIC 16QAM SD (C=5 16QAM Number of Operations Proposed method[] (C=10 16QAM QRM-MLD 16QAM LR with OSIC 16QAM SD(C=10 16QAM : 16QAM 15.14: 16QAM (M=N=4 (M=N= Proposed method[] 16QAM (C=15 QRM-MLD 16QAM LR with OSIC 16QAM SD 16QAM (C=15 Proposed method[] (C=5 64QAM QRM-MLD 64QAM LR with OSIC 64QAM SD (C=5 64QAM Number of Operations Number of Operations : 16QAM 15.16: 64QAM (M=N=8 (M=N=4 115

118 10 5 Proposed method[] (C=10 64QAM QRM-MLD 64QAM LR with OSIC 64QAM SD (C=10 64QAM 10 6 Proposed method[] 64QAM (C=15 QRM-MLD 64QAM LR with OSIC 64QAM SD 64QAM (C=15 Number of Operations 10 4 Number of Operations : 64QAM 15.18: 64QAM (M=N=6 (M=N= LR with OSIC ˆv y R ˆv, X(E b /N 0 SD., LR with OSIC., ML BER., MIMO, SD. 8 8MIMO 64QAM, BER

119 16 MIMO,, BER,. MIMO.,., BER., 1, MIMO, 3 ZF, MMSE, ML. 4 Lattice-Reduction(LR, 5 8 LR. 9 11,,. 1,, , 1, 10 (F&B OSIC LRAD,. 14, ML, Sphere Detection(SD,. 15,,. BER, LR with OSIC,MIMO 4 4 QPSK, ML BER., MIMO QAM, ML BER., SD, E b /N 0 QPSK, 16QAM, 64QAM,. E b /N 0, MIMO,., LR with OSIC, SD. 117

120 ,,.,. Hou Wei(,,,, 118

121 [1] Tadashi Fujino. Introduction to Lattice-Reduction Aided Detection(Rev.10 [] A.K.Lenstra, H.W.Lenstra Jr. and L.Lovasz, Factioring polynomials with rational coefficients, pp [3] T.Fujino and T.Shimokawa, Combined forward and backward lattice-reduction aided MMSE detection in MIMO systems, Proc.68thIEEEVehicularTechnol.Conf.(VTC 08 Fall,Calgary, Canada, Sep [4] Luis G.Barbero. A COMPARISON OF COMPLEX LATTICE REDUCTION ALGO- RITHM FOR MIMO DETECTION [5] LOW-COMPLEXITY MIMO DATA DETECTION USING SEYSEN S LATTICE REDUC- TION SLGORITHM [6] A Performance Study of MIMO Detectors [7] Tetsuyoshi Shimokawa. A combined forward and backward lattice reduction aided MMSE list detection [8] Kyungchun Lee, Joohwan Chun, and Lajos Hanzo. Optimal Lattice-Reduction Aided Successive Interference Cancellation for MIMO Systems 119

format

format MIMO 復調法 信号の検出方法について 2012 年 5 月 10 日 -1- Multiple-Input Multiple-Output MIMO 同一時刻 同一周波数で信号を複数のアンテナから多重送信. 複数のアンテナから受信し信号処理を行うことで情報を復元するシステム. 使用する帯域幅が狭く, 多くの情報を送ることができる. 情報 A 信号分割 送信機 送信信号 x 1 x 2 x X h

More information

DVIOUT-ma

DVIOUT-ma アンテナ伝搬 における設計 解析手法ワークショップ ( 第 45 回 ) やさしいマルチユーザ MIMO 西森健太郎 ( 新潟大学 ) 主催 : 電子情報通信学会 アンテナ 伝播研究専門委員会 協賛 : IEEE AP-S Japan Chapter 電子情報通信学会 無線通信システム研究会 電子情報通信学会 ソフトウエア無線研究会 目次 第 1 章 はじめに 1 1.1 技術背景 MIMO 技術による伝送速度の高速化......................

More information

ohgane

ohgane Signal Detection Based on Belief Propagation in a Massive MIMO System Takeo Ohgane Hokkaido University, Japan 28 October 2013 Background (1) 2 Massive MIMO An order of 100 antenna elements channel capacity

More information

it-ken_open.key

it-ken_open.key 深層学習技術の進展 ImageNet Classification 画像認識 音声認識 自然言語処理 機械翻訳 深層学習技術は これらの分野において 特に圧倒的な強みを見せている Figure (Left) Eight ILSVRC-2010 test Deep images and the cited4: from: ``ImageNet Classification with Networks et

More information

T rank A max{rank Q[R Q, J] t-rank T [R T, C \ J] J C} 2 ([1, p.138, Theorem 4.2.5]) A = ( ) Q rank A = min{ρ(j) γ(j) J J C} C, (5) ρ(j) = rank Q[R Q,

T rank A max{rank Q[R Q, J] t-rank T [R T, C \ J] J C} 2 ([1, p.138, Theorem 4.2.5]) A = ( ) Q rank A = min{ρ(j) γ(j) J J C} C, (5) ρ(j) = rank Q[R Q, (ver. 4:. 2005-07-27) 1 1.1 (mixed matrix) (layered mixed matrix, LM-matrix) m n A = Q T (2m) (m n) ( ) ( ) Q I m Q à = = (1) T diag [t 1,, t m ] T rank à = m rank A (2) 1.2 [ ] B rank [B C] rank B rank

More information

スライド タイトルなし

スライド タイトルなし (LNA) (LNA) (PA) ASK FSK PSK BER Bit Error Rate/ratio QPSK GMSK QAM OFDM ASK FSK PSK ASK(Amplitude-shift keying) e( t) = S( t)cos( ω t + θ ) c AM S(t) [+1,0] [+1/2, 1/2] 1 1 2 S(t) 0 1 2 e(t) C O B A E

More information

日本統計学会誌, 第44巻, 第2号, 251頁-270頁

日本統計学会誌, 第44巻, 第2号, 251頁-270頁 44, 2, 205 3 25 270 Multiple Comparison Procedures for Checking Differences among Sequence of Normal Means with Ordered Restriction Tsunehisa Imada Lee and Spurrier (995) Lee and Spurrier (995) (204) (2006)

More information

: : : : ) ) 1. d ij f i e i x i v j m a ij m f ij n x i =

: : : : ) ) 1. d ij f i e i x i v j m a ij m f ij n x i = 1 1980 1) 1 2 3 19721960 1965 2) 1999 1 69 1980 1972: 55 1999: 179 2041999: 210 211 1999: 211 3 2003 1987 92 97 3) 1960 1965 1970 1985 1990 1995 4) 1. d ij f i e i x i v j m a ij m f ij n x i = n d ij

More information

Grund.dvi

Grund.dvi 24 24 23 411M133 i 1 1 1.1........................................ 1 2 4 2.1...................................... 4 2.2.................................. 6 2.2.1........................... 6 2.2.2 viterbi...........................

More information

<4D F736F F F696E74202D2091E6824F82518FCD E838B C68CEB82E894AD90B B2E >

<4D F736F F F696E74202D2091E6824F82518FCD E838B C68CEB82E894AD90B B2E > 目次 参考文献安達著 : 通信システム工学, 朝倉書店,7 年. ディジタル変調. ディジタル伝送系モデル 3. 符号判定誤り確率 4. 元対称通信路 安達 : コミュニケーション符号理論 安達 : コミュニケーション符号理論 変調とは?. ディジタル変調 基底帯域 ( ベースバンド ) 伝送の信号波形は零周波数付近のスペクトルを持っている. しかし, 現実の大部分の通信路は零周波数付近を殆ど伝送することができない帯域通信路とみなされる.

More information

資料 ISDB-T SB 信号から FM 受信機への干渉実験結果 1 実験の目的および方法 実験の目的 90~108MHz 帯のISDB-T SB 信号からFM 放送波への影響について干渉実験を行う 実験方法 FM 放送波を 89.9MHz に ISDB-T SB 信号を 90~10

資料 ISDB-T SB 信号から FM 受信機への干渉実験結果 1 実験の目的および方法 実験の目的 90~108MHz 帯のISDB-T SB 信号からFM 放送波への影響について干渉実験を行う 実験方法 FM 放送波を 89.9MHz に ISDB-T SB 信号を 90~10 資料 4-6-3-1 ISDB-T SB 信号から FM 受信機への干渉実験結果 1 実験の目的および方法 実験の目的 9~8MHz 帯のISDB-T SB 信号からFM 放送波への影響について干渉実験を行う 実験方法 FM 放送波を 89.9MHz に ISDB-T SB 信号を 9~8MHz 帯に配 置し FM 放送の所要の受信品質を満足するための干渉 DU 比を求める 評価基準 S/N=5dBを満足する受信品質を所要の受信品質とする

More information

(Basics of Proability Theory). (Probability Spacees ad Radom Variables,, (Ω, F, P ),, X,. (Ω, F, P ) (probability space) Ω ( ω Ω ) F ( 2 Ω ) Ω σ (σ-fi

(Basics of Proability Theory). (Probability Spacees ad Radom Variables,, (Ω, F, P ),, X,. (Ω, F, P ) (probability space) Ω ( ω Ω ) F ( 2 Ω ) Ω σ (σ-fi I (Basics of Probability Theory ad Radom Walks) 25 4 5 ( 4 ) (Preface),.,,,.,,,...,,.,.,,.,,. (,.) (Basics of Proability Theory). (Probability Spacees ad Radom Variables...............2, (Expectatios,

More information

鉄鋼協会プレゼン

鉄鋼協会プレゼン NN :~:, 8 Nov., Adaptive H Control for Linear Slider with Friction Compensation positioning mechanism moving table stand manipulator Point to Point Control [G] Continuous Path Control ground Fig. Positoining

More information

n ξ n,i, i = 1,, n S n ξ n,i n 0 R 1,.. σ 1 σ i .10.14.15 0 1 0 1 1 3.14 3.18 3.19 3.14 3.14,. ii 1 1 1.1..................................... 1 1............................... 3 1.3.........................

More information

数学Ⅱ演習(足助・09夏)

数学Ⅱ演習(足助・09夏) II I 9/4/4 9/4/2 z C z z z z, z 2 z, w C zw z w 3 z, w C z + w z + w 4 t R t C t t t t t z z z 2 z C re z z + z z z, im z 2 2 3 z C e z + z + 2 z2 + 3! z3 + z!, I 4 x R e x cos x + sin x 2 z, w C e z+w

More information

Part () () Γ Part ,

Part () () Γ Part , Contents a 6 6 6 6 6 6 6 7 7. 8.. 8.. 8.3. 8 Part. 9. 9.. 9.. 3. 3.. 3.. 3 4. 5 4.. 5 4.. 9 4.3. 3 Part. 6 5. () 6 5.. () 7 5.. 9 5.3. Γ 3 6. 3 6.. 3 6.. 3 6.3. 33 Part 3. 34 7. 34 7.. 34 7.. 34 8. 35

More information

25 7 18 1 1 1.1 v.s............................. 1 1.1.1.................................. 1 1.1.2................................. 1 1.1.3.................................. 3 1.2................... 3

More information

出岡雅也 旭健作 鈴木秀和 渡邊晃 名城大学理工学部

出岡雅也 旭健作 鈴木秀和 渡邊晃 名城大学理工学部 ( ) Study of Access Control Method in Ad-hoc Networks that Prevents Hidden Terminal Problems using Strong Busy Tone Masaya Izuoka, Kensaku Asahi, Hidekazu Suzuki, Akira Watanabe(Meijo University) 1 2 IEEE802.11

More information

V 0 = + r pv (H) + qv (T ) = + r ps (H) + qs (T ) = S 0 X n+ (T ) = n S n+ (T ) + ( + r)(x n n S n ) = ( + r)x n + n (d r)s n = ( + r)v n + V n+(h) V

V 0 = + r pv (H) + qv (T ) = + r ps (H) + qs (T ) = S 0 X n+ (T ) = n S n+ (T ) + ( + r)(x n n S n ) = ( + r)x n + n (d r)s n = ( + r)v n + V n+(h) V I (..2) (0 < d < + r < u) X 0, X X = 0 S + ( + r)(x 0 0 S 0 ) () X 0 = 0, P (X 0) =, P (X > 0) > 0 0 H, T () X 0 = 0, X (H) = 0 us 0 ( + r) 0 S 0 = 0 S 0 (u r) X (T ) = 0 ds 0 ( + r) 0 S 0 = 0 S 0 (d r)

More information

技術協会STD紹介

技術協会STD紹介 JCTEA STD-018-1.0 FTTH 型ケーブルテレビシステム 光ネットワークの性能 ( 2007 年 10 月策定 ) 第 1 章 一般事項 1 第 2 章 システムの構成 4 2.1 FTTH 型ケーブルテレビシステムの構成例 4 2.2 FTTH 型ケーブルテレビシステムの構成要素 5 第 3 章 伝送信号の種類 6 第 4 章 電気信号に係る性能規定 7 4.1 ヘッドエンドの入力端子における入力信号

More information

050920_society_kmiz.odp

050920_society_kmiz.odp 1 リアルタイム伝搬測定にもとづく MIMO 固有モード間相関解析 Correlation Analysis of MIMO Eigenmodes Based on Real-Time Channel Measurement 水谷慶阪口啓高田潤一荒木純道 Kei Mizutani Kei Sakaguchi Jun-ichi Takada Kiyomichi Araki 東京工業大学 発表内容 研究背景

More information

2005 1

2005 1 2005 1 1 1 2 2 2.1....................................... 2 2.2................................... 5 2.3 VSWR................................. 6 2.4 VSWR 2............................ 7 2.5.......................................

More information

format

format 非直交多元接続 (NOMA) 慶應義塾大学理工学部電子工学科 眞田研究室 4 年 安藤健二 -1- 背景通信に使うことのできる周波数帯域は限られているため, 増加するトラフィックに対し帯域利用効率のよい多元接続方式が求められる -2-82.2 105.2 123.5 154.6 181.3 234.8 274.3 328.9 349.0 422.0 469.8 546.4 586.2 0 100 200

More information

untitled

untitled c 1. 2 2011 2012 0.248 0.252 1 Data Envelopment Analysis DEA 4 2 180 8633 3 3 1 IT DHARMA Ltd. 272 0122 1 14 12 13.10.7 14.5.27 DEA-AR (Assurance Region) 1 DEA 1 1 [1] 2011 2012 220 446 [2] 2. [2] 1 1

More information

応用数学III-4.ppt

応用数学III-4.ppt III f x ( ) = 1 f x ( ) = P( X = x) = f ( x) = P( X = x) =! x ( ) b! a, X! U a,b f ( x) =! " e #!x, X! Ex (!) n! ( n! x)!x! " x 1! " x! e"!, X! Po! ( ) n! x, X! B( n;" ) ( ) ! xf ( x) = = n n!! ( n

More information

31 gh gw

31 gh gw 30 31 gh gw 32 33 1406 1421 640 0 (mm) (mm) MAX1513 MIN349 MIN280 MAX900 gh gw 34 gh gh gw gw gh gh gw gw gh gh gw gw 35 175 176 177 178 179 180 181 195 196 197 198 202 203 2 1 L L L2 L2 L2 L 2 2 1 L L

More information

20 9 19 1 3 11 1 3 111 3 112 1 4 12 6 121 6 122 7 13 7 131 8 132 10 133 10 134 12 14 13 141 13 142 13 143 15 144 16 145 17 15 19 151 1 19 152 20 2 21 21 21 211 21 212 1 23 213 1 23 214 25 215 31 22 33

More information

(Basics of Proability Theory). (Probability Spacees ad Radom Variables,, (Ω, F, P ),, X,. (Ω, F, P ) (probability space) Ω ( ω Ω ) F ( 2 Ω ) Ω σ (σ-fi

(Basics of Proability Theory). (Probability Spacees ad Radom Variables,, (Ω, F, P ),, X,. (Ω, F, P ) (probability space) Ω ( ω Ω ) F ( 2 Ω ) Ω σ (σ-fi II (Basics of Probability Theory ad Radom Walks) (Preface),.,,,.,,,...,,.,.,,.,,. (Basics of Proability Theory). (Probability Spacees ad Radom Variables...............2, (Expectatios, Meas).............................

More information

20 6 4 1 4 1.1 1.................................... 4 1.1.1.................................... 4 1.1.2 1................................ 5 1.2................................... 7 1.2.1....................................

More information

Microsoft PowerPoint - ⑥説明者(太刀川).ppt

Microsoft PowerPoint - ⑥説明者(太刀川).ppt 高速無線 LAN の 安定な通信のための MC-CDMA 符号ダイバーシチ方式 長岡技術科学大学電気系准教授太刀川信一 Σ 1. 研究背景近年の高度無線情報通信の発展はめざましく ますます その利用範囲は広がっていく 現在の無線 LAN 携帯電話等の通信単一 ( 少数 ) の周波数に 1-1 等の情報を乗じて送る Single Carrier: SC f t 1 例 :DS/SS これからの高速無線

More information

v v = v 1 v 2 v 3 (1) R = (R ij ) (2) R (R 1 ) ij = R ji (3) 3 R ij R ik = δ jk (4) i=1 δ ij Kronecker δ ij = { 1 (i = j) 0 (i

v v = v 1 v 2 v 3 (1) R = (R ij ) (2) R (R 1 ) ij = R ji (3) 3 R ij R ik = δ jk (4) i=1 δ ij Kronecker δ ij = { 1 (i = j) 0 (i 1. 1 1.1 1.1.1 1.1.1.1 v v = v 1 v 2 v 3 (1) R = (R ij ) (2) R (R 1 ) ij = R ji (3) R ij R ik = δ jk (4) δ ij Kronecker δ ij = { 1 (i = j) 0 (i j) (5) 1 1.1. v1.1 2011/04/10 1. 1 2 v i = R ij v j (6) [

More information

SO(3) 7 = = 1 ( r ) + 1 r r r r ( l ) (5.17) l = 1 ( sin θ ) + sin θ θ θ ϕ (5.18) χ(r)ψ(θ, ϕ) l ψ = αψ (5.19) l 1 = i(sin ϕ θ l = i( cos ϕ θ l 3 = i ϕ

SO(3) 7 = = 1 ( r ) + 1 r r r r ( l ) (5.17) l = 1 ( sin θ ) + sin θ θ θ ϕ (5.18) χ(r)ψ(θ, ϕ) l ψ = αψ (5.19) l 1 = i(sin ϕ θ l = i( cos ϕ θ l 3 = i ϕ SO(3) 71 5.7 5.7.1 1 ħ L k l k l k = iϵ kij x i j (5.117) l k SO(3) l z l ± = l 1 ± il = i(y z z y ) ± (z x x z ) = ( x iy) z ± z( x ± i y ) = X ± z ± z (5.118) l z = i(x y y x ) = 1 [(x + iy)( x i y )

More information

http://www.ike-dyn.ritsumei.ac.jp/ hyoo/wave.html 1 1, 5 3 1.1 1..................................... 3 1.2 5.1................................... 4 1.3.......................... 5 1.4 5.2, 5.3....................

More information

50. (km) A B C C 7 B A 0

50. (km) A B C C 7 B A 0 49... 5 A B C. (. )?.. A A B C. A 4 0 50. (km) A B C..9 7. 4.5.9. 5. 7.5.0 4..4 7. 5.5 5.0 4. 4.. 8. 7 8.8 9.8. 8 5. 5.7.7 9.4 4. 4.7 0 4. 7. 8.0 4.. 5.8.4.8 8.5. 8 9 5 C 7 B 5 8 7 4 4 A 0 0 0 4 5 7 8

More information

新技術説明会 様式例

新技術説明会 様式例 1 周波数領域信号処理による 局部発振器位相雑音補償技術 東京工業大学理工学研究科電気電子工学専攻 助教タンザカン ミリ波帯を活用した無線通信システム ミリ波帯を活用した無線通信システムを実現するための取り組みが行われている. 屋内無線通信 (IEEE 802.11ad[1] など ) セルラネットワーク (5G) [2] ミリ波帯を活用することによって, より高速 大容量な通信を実現することができる.

More information

CDMA (high-compaciton multicarrier codedivision multiple access: HC/MC-CDMA),., HC/MC-CDMA,., 32.,, 64. HC/MC-CDMA, HC-MCM, i

CDMA (high-compaciton multicarrier codedivision multiple access: HC/MC-CDMA),., HC/MC-CDMA,., 32.,, 64. HC/MC-CDMA, HC-MCM, i 24 Investigation on HC/MC-CDMA Signals with Non-Uniform Frequency Intervals 1130401 2013 3 1 CDMA (high-compaciton multicarrier codedivision multiple access: HC/MC-CDMA),., HC/MC-CDMA,., 32.,, 64. HC/MC-CDMA,

More information

[ ] (Ising model) 2 i S i S i = 1 (up spin : ) = 1 (down spin : ) (4.38) s z = ±1 4 H 0 = J zn/2 i,j S i S j (4.39) i, j z 5 2 z = 4 z = 6 3

[ ] (Ising model) 2 i S i S i = 1 (up spin : ) = 1 (down spin : ) (4.38) s z = ±1 4 H 0 = J zn/2 i,j S i S j (4.39) i, j z 5 2 z = 4 z = 6 3 4.2 4.2.1 [ ] (Ising model) 2 i S i S i = 1 (up spin : ) = 1 (down spin : ) (4.38) s z = ±1 4 H 0 = J zn/2 S i S j (4.39) i, j z 5 2 z = 4 z = 6 3 z = 6 z = 8 zn/2 1 2 N i z nearest neighbors of i j=1

More information

A Bit flipping Reduction Method for Pseudo-random Patterns Using Don’t Care Identification on BAST Architecture

A Bit flipping Reduction Method for Pseudo-random Patterns Using Don’t Care Identification  on BAST Architecture 29 年 2 月 4 日日本大学大学院生産工学研究科数理情報工学専攻修士論文発表会 BAST アーキテクチャにおけるランダムパターンレジスタント故障ドントケア抽出を用いた擬似ランダムパターンのビット反転数削減法に関する研究 日本大学院生産工学研究科数理情報工学専攻万玲玲 背景 概要 BAST アーキテクチャ 目的と提案手法 ハンガリアンアルゴリズム ランダムパターンレジスタント故障検出用ドントケア抽出法

More information

28

28 y i = Z i δ i +ε i ε i δ X y i = X Z i δ i + X ε i [ ] 1 δ ˆ i = Z i X( X X) 1 X Z i [ ] 1 σ ˆ 2 Z i X( X X) 1 X Z i Z i X( X X) 1 X y i σ ˆ 2 ˆ σ 2 = [ ] y i Z ˆ [ i δ i ] 1 y N p i Z i δ ˆ i i RSTAT

More information

LINEAR ALGEBRA I Hiroshi SUZUKI Department of Mathematics International Christian University

LINEAR ALGEBRA I Hiroshi SUZUKI Department of Mathematics International Christian University LINEAR ALGEBRA I Hiroshi SUZUKI Department of Mathematics International Christian University 2002 2 2 2 2 22 2 3 3 3 3 3 4 4 5 5 6 6 7 7 8 8 9 Cramer 9 0 0 E-mail:hsuzuki@icuacjp 0 3x + y + 2z 4 x + y

More information

Microsoft PowerPoint - 【配布・WEB公開用】SAS発表資料.pptx

Microsoft PowerPoint - 【配布・WEB公開用】SAS発表資料.pptx 生存関数における信頼区間算出法の比較 佐藤聖士, 浜田知久馬東京理科大学工学研究科 Comparison of confidence intervals for survival rate Masashi Sato, Chikuma Hamada Graduate school of Engineering, Tokyo University of Science 要旨 : 生存割合の信頼区間算出の際に用いられる各変換関数の性能について被覆確率を評価指標として比較した.

More information

JPS_draft.pptx

JPS_draft.pptx LHC-ATLAS 実験における高い運動量を持つジェットの b- タグの開発及び評価 小林愛音 江成祐二 A 川本辰男 A 東大理 東大素セ A 9pSK-6 9th September 4 日本物理学会 4 年秋季大会 Introduction 5 年から始まる LHC の運転では高い運動量を持った物理の解析が重要 新しい重いレゾナンスの探索 (à WW, tt, hhà jets) VHà bb

More information

all.dvi

all.dvi 29 4 Green-Lagrange,,.,,,,,,.,,,,,,,,,, E, σ, ε σ = Eε,,.. 4.1? l, l 1 (l 1 l) ε ε = l 1 l l (4.1) F l l 1 F 30 4 Green-Lagrange Δz Δδ γ = Δδ (4.2) Δz π/2 φ γ = π 2 φ (4.3) γ tan γ γ,sin γ γ ( π ) γ tan

More information

:00-16:10

:00-16:10 3 3 2007 8 10 13:00-16:10 2 Diffie-Hellman (1976) K K p:, b [1, p 1] Given: p: prime, b [1, p 1], s.t. {b i i [0, p 2]} = {1,..., p 1} a {b i i [0, p 2]} Find: x [0, p 2] s.t. a b x mod p Ind b a := x

More information

0226_ぱどMD表1-ol前

0226_ぱどMD表1-ol前 No. MEDIA DATA 0 B O O K 00-090-0 0 000900 000 00 00 00 0000 0900 000900 AREA MAP 0,000 0,000 0,000 0,000 00,000 0,000 0,000 0,000 0,000 0,000 0,000 0,000 0,000 0,000 0,000 0,000 0,000 0,000 00,000 0,000

More information

n (1.6) i j=1 1 n a ij x j = b i (1.7) (1.7) (1.4) (1.5) (1.4) (1.7) u, v, w ε x, ε y, ε x, γ yz, γ zx, γ xy (1.8) ε x = u x ε y = v y ε z = w z γ yz

n (1.6) i j=1 1 n a ij x j = b i (1.7) (1.7) (1.4) (1.5) (1.4) (1.7) u, v, w ε x, ε y, ε x, γ yz, γ zx, γ xy (1.8) ε x = u x ε y = v y ε z = w z γ yz 1 2 (a 1, a 2, a n ) (b 1, b 2, b n ) A (1.1) A = a 1 b 1 + a 2 b 2 + + a n b n (1.1) n A = a i b i (1.2) i=1 n i 1 n i=1 a i b i n i=1 A = a i b i (1.3) (1.3) (1.3) (1.1) (ummation convention) a 11 x

More information

(Basic of Proability Theory). (Probability Spacees ad Radom Variables , (Expectatios, Meas) (Weak Law

(Basic of Proability Theory). (Probability Spacees ad Radom Variables , (Expectatios, Meas) (Weak Law I (Radom Walks ad Percolatios) 3 4 7 ( -2 ) (Preface),.,,,...,,.,,,,.,.,,.,,. (,.) (Basic of Proability Theory). (Probability Spacees ad Radom Variables...............2, (Expectatios, Meas).............................

More information

Optical Flow t t + δt 1 Motion Field 3 3 1) 2) 3) Lucas-Kanade 4) 1 t (x, y) I(x, y, t)

Optical Flow t t + δt 1 Motion Field 3 3 1) 2) 3) Lucas-Kanade 4) 1 t (x, y) I(x, y, t) http://wwwieice-hbkborg/ 2 2 4 2 -- 2 4 2010 9 3 3 4-1 Lucas-Kanade 4-2 Mean Shift 3 4-3 2 c 2013 1/(18) http://wwwieice-hbkborg/ 2 2 4 2 -- 2 -- 4 4--1 2010 9 4--1--1 Optical Flow t t + δt 1 Motion Field

More information

[I486S] 暗号プロトコル理論

[I486S]  暗号プロトコル理論 [I486S] 2018 5 1 (JAIST) 2018 5 1 1 / 22 : I486S I URL:https://wwwjaistacjp/~fujisaki/i486S (Tuesdays) 5 17:10 18:50 4/17, 4/24, 5/1, 5/15, 5/22, 5/29, 6/5, 6/19, 6/26, 7/3, 7/10, 7/17, 7/24, 7/31 (JAIST)

More information

X G P G (X) G BG [X, BG] S 2 2 2 S 2 2 S 2 = { (x 1, x 2, x 3 ) R 3 x 2 1 + x 2 2 + x 2 3 = 1 } R 3 S 2 S 2 v x S 2 x x v(x) T x S 2 T x S 2 S 2 x T x S 2 = { ξ R 3 x ξ } R 3 T x S 2 S 2 x x T x S 2

More information

<4D F736F F F696E74202D2091E6824F82568FCD8CEB82E892F990B382CC8CF889CA82BB82CC82515F B834E838A B9797A3959C8D F A282E982C682AB82CC8CEB82E897A62E >

<4D F736F F F696E74202D2091E6824F82568FCD8CEB82E892F990B382CC8CF889CA82BB82CC82515F B834E838A B9797A3959C8D F A282E982C682AB82CC8CEB82E897A62E > 第 7 章 誤り訂正の効果その : ユークリッド距離復号法を用いるときの誤り率 ユークリッド距離に基づく最尤復号ブロック符号のユークリッド距離に基づく最尤復号畳み込み符号のユークリッド距離に基づく最尤復号 安達 : コミュニケーション符号理論 ユークリッド距離に基づく最尤復号 送信情報系列 Xx x x x x x 5.. を符号化して得られた符号系列 5.. を送信する. 伝送路途中の雑音のため誤りが発生するので,

More information

(2 X Poisso P (λ ϕ X (t = E[e itx ] = k= itk λk e k! e λ = (e it λ k e λ = e eitλ e λ = e λ(eit 1. k! k= 6.7 X N(, 1 ϕ X (t = e 1 2 t2 : Cauchy ϕ X (t

(2 X Poisso P (λ ϕ X (t = E[e itx ] = k= itk λk e k! e λ = (e it λ k e λ = e eitλ e λ = e λ(eit 1. k! k= 6.7 X N(, 1 ϕ X (t = e 1 2 t2 : Cauchy ϕ X (t 6 6.1 6.1 (1 Z ( X = e Z, Y = Im Z ( Z = X + iy, i = 1 (2 Z E[ e Z ] < E[ Im Z ] < Z E[Z] = E[e Z] + ie[im Z] 6.2 Z E[Z] E[ Z ] : E[ Z ] < e Z Z, Im Z Z E[Z] α = E[Z], Z = Z Z 1 {Z } E[Z] = α = α [ α ]

More information

4. ϵ(ν, T ) = c 4 u(ν, T ) ϵ(ν, T ) T ν π4 Planck dx = 0 e x 1 15 U(T ) x 3 U(T ) = σt 4 Stefan-Boltzmann σ 2π5 k 4 15c 2 h 3 = W m 2 K 4 5.

4. ϵ(ν, T ) = c 4 u(ν, T ) ϵ(ν, T ) T ν π4 Planck dx = 0 e x 1 15 U(T ) x 3 U(T ) = σt 4 Stefan-Boltzmann σ 2π5 k 4 15c 2 h 3 = W m 2 K 4 5. A 1. Boltzmann Planck u(ν, T )dν = 8πh ν 3 c 3 kt 1 dν h 6.63 10 34 J s Planck k 1.38 10 23 J K 1 Boltzmann u(ν, T ) T ν e hν c = 3 10 8 m s 1 2. Planck λ = c/ν Rayleigh-Jeans u(ν, T )dν = 8πν2 kt dν c

More information

2012 September 21, 2012, Rev.2.2

2012 September 21, 2012, Rev.2.2 212 September 21, 212, Rev.2.2 4................. 4 1 6 1.1.................. 6 1.2.................... 7 1.3 s................... 8 1.4....................... 9 1.5..................... 11 2 12 2.1.........................

More information

スライド 1

スライド 1 61 SAS SAS LOHAS 18 18 12 01 LOHAS ( ) ( ) LOHAS 29% 35% LOHAS LOHAS 18 5 20 60 GMO 500 Yes No Q1 Q2 Q3 Q4 Q5 Q6 Q7 Q8 Q9 Q10 Q11 Q12 Q13 Q14 Q15 Q16 Q17 Q18 Q19 Q20 Q21 Q22 Q23 Q24 LOHAS Q25 LOHAS / 2

More information

Vol. 43 No. 2 Feb. 2002,, MIDI A Probabilistic-model-based Quantization Method for Estimating the Position of Onset Time in a Score Masatoshi Hamanaka

Vol. 43 No. 2 Feb. 2002,, MIDI A Probabilistic-model-based Quantization Method for Estimating the Position of Onset Time in a Score Masatoshi Hamanaka Vol. 43 No. 2 Feb. 2002,, MIDI A Probabilistic-model-based Quantization Method for Estimating the Position of Onset Time in a Score Masatoshi Hamanaka, Masataka Goto,, Hideki Asoh and Nobuyuki Otsu, This

More information

目次

目次 00D80020G 2004 3 ID POS 30 40 0 RFM i ... 2...2 2. ID POS...2 2.2...3 3...5 3....5 3.2...6 4...9 4....9 4.2...9 4.3...0 4.4...4 4.3....4 4.3.2...6 4.3.3...7 4.3.4...9 4.3.5...2 5...23 5....23 5.....23

More information

<4D F736F F D B B83578B6594BB2D834A836F815B82D082C88C60202E646F63>

<4D F736F F D B B83578B6594BB2D834A836F815B82D082C88C60202E646F63> 通信方式第 2 版 サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます. http://www.morikita.co.jp/books/mid/072662 このサンプルページの内容は, 第 2 版発行当時のものです. i 2 2 2 2012 5 ii,.,,,,,,.,.,,,,,.,,.,,..,,,,.,,.,.,,.,,.. 1990 5 iii 1 1

More information

n 2 + π2 6 x [10 n x] x = lim n 10 n n 10 k x 1.1. a 1, a 2,, a n, (a n ) n=1 {a n } n=1 1.2 ( ). {a n } n=1 Q ε > 0 N N m, n N a m

n 2 + π2 6 x [10 n x] x = lim n 10 n n 10 k x 1.1. a 1, a 2,, a n, (a n ) n=1 {a n } n=1 1.2 ( ). {a n } n=1 Q ε > 0 N N m, n N a m 1 1 1 + 1 4 + + 1 n 2 + π2 6 x [10 n x] x = lim n 10 n n 10 k x 1.1. a 1, a 2,, a n, (a n ) n=1 {a n } n=1 1.2 ( ). {a n } n=1 Q ε > 0 N N m, n N a m a n < ε 1 1. ε = 10 1 N m, n N a m a n < ε = 10 1 N

More information

+ 1 ( ) I IA i i i 1 n m a 11 a 1j a 1m A = a i1 a ij a im a n1 a nj a nm.....

+   1 ( ) I IA i i i 1 n m a 11 a 1j a 1m A = a i1 a ij a im a n1 a nj a nm..... + http://krishnathphysaitama-uacjp/joe/matrix/matrixpdf 1 ( ) I IA i i i 1 n m a 11 a 1j a 1m A = a i1 a ij a im a n1 a nj a nm (1) n m () (n, m) ( ) n m B = ( ) 3 2 4 1 (2) 2 2 ( ) (2, 2) ( ) C = ( 46

More information

Hanbury-Brown Twiss (ver. 2.0) van Cittert - Zernike mutual coherence

Hanbury-Brown Twiss (ver. 2.0) van Cittert - Zernike mutual coherence Hanbury-Brown Twiss (ver. 2.) 25 4 4 1 2 2 2 2.1 van Cittert - Zernike..................................... 2 2.2 mutual coherence................................. 4 3 Hanbury-Brown Twiss ( ) 5 3.1............................................

More information

PowerPoint プレゼンテーション

PowerPoint プレゼンテーション LDACS1 のビット誤り率特性の改善 監視通信領域 北折潤 塩見格一 2016/6/10 目次 はじめに LDACS1 概要 フェージング環境下のLDACS1 BER 特性 改善策 実験 考察 まとめ 1 はじめに Air Navigation Conference/11 十分な通信性能 ATMの効率化を考慮した通信の高度化が必要と勧告 Action Plan 17 洋上 陸域 空港面それぞれの領域に適切な通信システムを選定

More information

waseda2010a-jukaiki1-main.dvi

waseda2010a-jukaiki1-main.dvi November, 2 Contents 6 2 8 3 3 3 32 32 33 5 34 34 6 35 35 7 4 R 2 7 4 4 9 42 42 2 43 44 2 5 : 2 5 5 23 52 52 23 53 53 23 54 24 6 24 6 6 26 62 62 26 63 t 27 7 27 7 7 28 72 72 28 73 36) 29 8 29 8 29 82 3

More information

AHPを用いた大相撲の新しい番付編成

AHPを用いた大相撲の新しい番付編成 5304050 2008/2/15 1 2008/2/15 2 42 2008/2/15 3 2008/2/15 4 195 2008/2/15 5 2008/2/15 6 i j ij >1 ij ij1/>1 i j i 1 ji 1/ j ij 2008/2/15 7 1 =2.01/=0.5 =1.51/=0.67 2008/2/15 8 1 2008/2/15 9 () u ) i i i

More information

C-1 210C f f f f f f f f f f f f f f f f f f f f r f f f f f f f f f f f f f R R

C-1 210C f f f f f f f f f f f f f f f f f f f f r f f f f f f f f f f f f f R R 4 5 ff f f f f f f f f f f f f ff ff ff r f ff ff ff ff ff ff R R 7 b b ï φφ φφ φφ φ φ φφ φφφφφφφφ φφφφ φφφφ ù û û Æ φ ñ ó ò ô ö õ φφ! b ü ú ù û ü ß μ f f f f f f f f f f b b b z x c n 9 f φ φ φ φ φ φ

More information

NLMIXED プロシジャを用いた生存時間解析 伊藤要二アストラゼネカ株式会社臨床統計 プログラミング グループグルプ Survival analysis using PROC NLMIXED Yohji Itoh Clinical Statistics & Programming Group, A

NLMIXED プロシジャを用いた生存時間解析 伊藤要二アストラゼネカ株式会社臨床統計 プログラミング グループグルプ Survival analysis using PROC NLMIXED Yohji Itoh Clinical Statistics & Programming Group, A NLMIXED プロシジャを用いた生存時間解析 伊藤要二アストラゼネカ株式会社臨床統計 プログラミング グループグルプ Survival analysis using PROC NLMIXED Yohji Itoh Clinical Statistics & Programming Group, AstraZeneca KK 要旨 : NLMIXEDプロシジャの最尤推定の機能を用いて 指数分布 Weibull

More information

Appendix A BASIC BASIC Beginner s All-purpose Symbolic Instruction Code FORTRAN COBOL C JAVA PASCAL (NEC N88-BASIC Windows BASIC (1) (2) ( ) BASIC BAS

Appendix A BASIC BASIC Beginner s All-purpose Symbolic Instruction Code FORTRAN COBOL C JAVA PASCAL (NEC N88-BASIC Windows BASIC (1) (2) ( ) BASIC BAS Appendix A BASIC BASIC Beginner s All-purpose Symbolic Instruction Code FORTRAN COBOL C JAVA PASCAL (NEC N88-BASIC Windows BASIC (1 (2 ( BASIC BASIC download TUTORIAL.PDF http://hp.vector.co.jp/authors/va008683/

More information

<4D6963726F736F667420576F7264202D204850835483938376838B8379815B83578B6594BB2D834A836F815B82D082C88C60202E646F63>

<4D6963726F736F667420576F7264202D204850835483938376838B8379815B83578B6594BB2D834A836F815B82D082C88C60202E646F63> 誤 り 訂 正 技 術 の 基 礎 サンプルページ この 本 の 定 価 判 型 などは, 以 下 の URL からご 覧 いただけます http://wwwmorikitacojp/books/mid/081731 このサンプルページの 内 容 は, 第 1 版 発 行 時 のものです http://wwwmorikitacojp/support/ e mail editor@morikitacojp

More information

1 s 1 H(s 1 ) N s 1, s,, s N H({s 1,, s N }) = N H(s k ) k=1 Z N =Tr {s1,,s N }e βh({s 1,,s N }) =Tr s1 Tr s Tr sn e β P k H(s k) N = Tr sk e βh(s k)

1 s 1 H(s 1 ) N s 1, s,, s N H({s 1,, s N }) = N H(s k ) k=1 Z N =Tr {s1,,s N }e βh({s 1,,s N }) =Tr s1 Tr s Tr sn e β P k H(s k) N = Tr sk e βh(s k) 19 1 14 007 3 1 1 Ising 4.1................................. 4................................... 5 3 9 3.1........................ 9 3................... 9 3.3........................ 11 4 14 4.1 Legendre..............................

More information

I

I I 6 4 10 1 1 1.1............... 1 1................ 1 1.3.................... 1.4............... 1.4.1.............. 1.4................. 1.4.3........... 3 1.4.4.. 3 1.5.......... 3 1.5.1..............

More information

t.dvi

t.dvi T-1 http://adapt.cs.tsukuba.ac.jp/moodle263/course/view.php?id=7 (Keisuke.Kameyama@cs.tsukuba.ac.jp) 29 10 11 1 ( ) (a) (b) (c) (d) SVD Tikhonov 3 (e) 1: ( ) 1 Objective Output s Known system p(s) b =

More information

kawa (Spin-Orbit Tomography: Kawahara and Fujii 21,Kawahara and Fujii 211,Fujii & Kawahara submitted) 2 van Cittert-Zernike Appendix A V 2

kawa (Spin-Orbit Tomography: Kawahara and Fujii 21,Kawahara and Fujii 211,Fujii & Kawahara submitted) 2 van Cittert-Zernike Appendix A V 2 Hanbury-Brown Twiss (ver. 1.) 24 2 1 1 1 2 2 2.1 van Cittert - Zernike..................................... 2 2.2 mutual coherence................................. 3 3 Hanbury-Brown Twiss ( ) 4 3.1............................................

More information

#2 (IISEC)

#2 (IISEC) #2 (IISEC) 2007 10 6 E Y 2 = F (X) E(F p ) E : Y 2 = F (X) = X 3 + AX + B, A, B F p E(F p ) = {(x, y) F 2 p y2 = F (x)} {P } P : E(F p ) E F p - Given: E/F p : EC, P E(F p ), Q P Find: x Z/NZ s.t. Q =

More information

untitled

untitled 18 1 2,000,000 2,000,000 2007 2 2 2008 3 31 (1) 6 JCOSSAR 2007pp.57-642007.6. LCC (1) (2) 2 10mm 1020 14 12 10 8 6 4 40,50,60 2 0 1998 27.5 1995 1960 40 1) 2) 3) LCC LCC LCC 1 1) Vol.42No.5pp.29-322004.5.

More information

9 8 7 (x-1.0)*(x-1.0) *(x-1.0) (a) f(a) (b) f(a) Figure 1: f(a) a =1.0 (1) a 1.0 f(1.0)

9 8 7 (x-1.0)*(x-1.0) *(x-1.0) (a) f(a) (b) f(a) Figure 1: f(a) a =1.0 (1) a 1.0 f(1.0) E-mail: takio-kurita@aist.go.jp 1 ( ) CPU ( ) 2 1. a f(a) =(a 1.0) 2 (1) a ( ) 1(a) f(a) a (1) a f(a) a =2(a 1.0) (2) 2 0 a f(a) a =2(a 1.0) = 0 (3) 1 9 8 7 (x-1.0)*(x-1.0) 6 4 2.0*(x-1.0) 6 2 5 4 0 3-2

More information

1 1.1 H = µc i c i + c i t ijc j + 1 c i c j V ijklc k c l (1) V ijkl = V jikl = V ijlk = V jilk () t ij = t ji, V ijkl = V lkji (3) (1) V 0 H mf = µc

1 1.1 H = µc i c i + c i t ijc j + 1 c i c j V ijklc k c l (1) V ijkl = V jikl = V ijlk = V jilk () t ij = t ji, V ijkl = V lkji (3) (1) V 0 H mf = µc 013 6 30 BCS 1 1.1........................ 1................................ 3 1.3............................ 3 1.4............................... 5 1.5.................................... 5 6 3 7 4 8

More information

2000年度『数学展望 I』講義録

2000年度『数学展望 I』講義録 2000 I I IV I II 2000 I I IV I-IV. i ii 3.10 (http://www.math.nagoya-u.ac.jp/ kanai/) 2000 A....1 B....4 C....10 D....13 E....17 Brouwer A....21 B....26 C....33 D....39 E. Sperner...45 F....48 A....53

More information

December 28, 2018

December 28, 2018 e-mail : kigami@i.kyoto-u.ac.jp December 28, 28 Contents 2............................. 3.2......................... 7.3..................... 9.4................ 4.5............. 2.6.... 22 2 36 2..........................

More information

1 (1) X = AB + AB, Y = C D + C D, Z = AD + AD P A, B, C, D P = (XY + X Y + X Y )(Y Z + Y Z + Y Z )(ZX + Z X + Z X ) (2) Q A, B, C, D Q = AB C D + AB C

1 (1) X = AB + AB, Y = C D + C D, Z = AD + AD P A, B, C, D P = (XY + X Y + X Y )(Y Z + Y Z + Y Z )(ZX + Z X + Z X ) (2) Q A, B, C, D Q = AB C D + AB C 平成 28 年度 10 月期入学 / 平成 29 年度 4 月期入学京都大学大学院情報学研究科修士課程システム科学専攻入学者選抜試験問題 専門科目 試験日時 : 平成 28 年 8 月 8 日 ( 月 ) 午後 1 時 00 分より同 4 時 00 分 問題冊子頁数 ( 表紙 中表紙 裏表紙を除いて ): 15 頁 選択科目 : 下記の科目のうち 2 科目を選択し解答すること 注意 : 論理回路 (3)

More information

untitled

untitled ( œ ) œ 138,800 17 171,000 60,000 16,000 252,500 405,400 24,000 22 95,800 24 46,000 16,000 16,000 273,000 19,000 10,300 57,800 1,118,408,500 1,118,299,000 109,500 102,821,836 75,895,167 244,622 3,725,214

More information

( š ) š 13,448 1,243,000 1,249,050 1,243,000 1,243,000 1,249,050 1,249, , , ,885

( š ) š 13,448 1,243,000 1,249,050 1,243,000 1,243,000 1,249,050 1,249, , , ,885 ( š ) 7,000,000 191 191 6,697,131 5,845,828 653,450 197,853 4,787,707 577,127 4,000,000 146,580 146,580 64,000 100,000 500,000 120,000 60,000 60,000 60,000 60,000 60,000 200,000 150,000 60,000 60,000 100,000

More information

all.dvi

all.dvi I 1 Density Matrix 1.1 ( (Observable) Ô :ensemble ensemble average) Ô en =Tr ˆρ en Ô ˆρ en Tr  n, n =, 1,, Tr  = n n  n Tr  I w j j ( j =, 1,, ) ˆρ en j w j j ˆρ en = j w j j j Ô en = j w j j Ô j emsemble

More information

( ) ( ) ( ) ( ) ( )

( ) ( ) ( ) ( ) ( ) NAIST-IS-MT0751044 2.4GHz W-LAN 2008 8 20 ( ) ( ) ( ) ( ) ( ) 2.4GHz W-LAN ISM(Industrial, Sientific and Medical) 2.4GHz IEEE802.11b/gW-LAN 2.4GHz W-LAN 2.4GHz ISM (Industry Scientific and Medical) ISM

More information

行列代数2010A

行列代数2010A (,) A (,) B C = AB a 11 a 1 a 1 b 11 b 1 b 1 c 11 c 1 c a A = 1 a a, B = b 1 b b, C = AB = c 1 c c a 1 a a b 1 b b c 1 c c i j ij a i1 a i a i b 1j b j b j c ij = a ik b kj b 1j b j AB = a i1 a i a ik

More information

IA 2013 : :10722 : 2 : :2 :761 :1 (23-27) : : ( / ) (1 /, ) / e.g. (Taylar ) e x = 1 + x + x xn n! +... sin x = x x3 6 + x5 x2n+1 + (

IA 2013 : :10722 : 2 : :2 :761 :1 (23-27) : : ( / ) (1 /, ) / e.g. (Taylar ) e x = 1 + x + x xn n! +... sin x = x x3 6 + x5 x2n+1 + ( IA 2013 : :10722 : 2 : :2 :761 :1 23-27) : : 1 1.1 / ) 1 /, ) / e.g. Taylar ) e x = 1 + x + x2 2 +... + xn n! +... sin x = x x3 6 + x5 x2n+1 + 1)n 5! 2n + 1)! 2 2.1 = 1 e.g. 0 = 0.00..., π = 3.14..., 1

More information

2 1,384,000 2,000,000 1,296,211 1,793,925 38,000 54,500 27,804 43,187 41,000 60,000 31,776 49,017 8,781 18,663 25,000 35,300 3 4 5 6 1,296,211 1,793,925 27,804 43,187 1,275,648 1,753,306 29,387 43,025

More information

A

A A 2563 15 4 21 1 3 1.1................................................ 3 1.2............................................. 3 2 3 2.1......................................... 3 2.2............................................

More information

151021slide.dvi

151021slide.dvi : Mac I 1 ( 5 Windows (Mac Excel : Excel 2007 9 10 1 4 http://asakura.co.jp/ books/isbn/978-4-254-12172-8/ (1 1 9 1/29 (,,... (,,,... (,,, (3 3/29 (, (F7, Ctrl + i, (Shift +, Shift + Ctrl (, a i (, Enter,

More information

,, 2. Matlab Simulink 2018 PC Matlab Scilab 2

,, 2. Matlab Simulink 2018 PC Matlab Scilab 2 (2018 ) ( -1) TA Email : ohki@i.kyoto-u.ac.jp, ske.ta@bode.amp.i.kyoto-u.ac.jp : 411 : 10 308 1 1 2 2 2.1............................................ 2 2.2..................................................

More information

linearal1.dvi

linearal1.dvi 19 4 30 I 1 1 11 1 12 2 13 3 131 3 132 4 133 5 134 6 14 7 2 9 21 9 211 9 212 10 213 13 214 14 22 15 221 15 222 16 223 17 224 20 3 21 31 21 32 21 33 22 34 23 341 23 342 24 343 27 344 29 35 31 351 31 352

More information

( ) g 900,000 2,000,000 5,000,000 2,200,000 1,000,000 1,500, ,000 2,500,000 1,000, , , , , , ,000 2,000,000

( ) g 900,000 2,000,000 5,000,000 2,200,000 1,000,000 1,500, ,000 2,500,000 1,000, , , , , , ,000 2,000,000 ( ) 73 10,905,238 3,853,235 295,309 1,415,972 5,340,722 2,390,603 890,603 1,500,000 1,000,000 300,000 1,500,000 49 19. 3. 1 17,172,842 3,917,488 13,255,354 10,760,078 (550) 555,000 600,000 600,000 12,100,000

More information

untitled

untitled ,, 2 2.,, A, PC/AT, MB, 5GB,,,, ( ) MB, GB 2,5,, 8MB, A, MB, GB 2 A,,,? x MB, y GB, A (), x + 2y () 4 (,, ) (hanba@eee.u-ryukyu.ac.jp), A, x + 2y() x y, A, MB ( ) 8 MB ( ) 5GB ( ) ( ), x x x 8 (2) y y

More information

2019 1 5 0 3 1 4 1.1.................... 4 1.1.1......................... 4 1.1.2........................ 5 1.1.3................... 5 1.1.4........................ 6 1.1.5......................... 6 1.2..........................

More information

Trapezoidal Rule θ = 1/ x n x n 1 t = 1 [f(t n 1, x n 1 ) + f(t n, x n )] (6) 1. dx dt = f(t, x), x(t 0) = x 0 (7) t [t 0, t 1 ] f t [t 0, t 1 ], x x

Trapezoidal Rule θ = 1/ x n x n 1 t = 1 [f(t n 1, x n 1 ) + f(t n, x n )] (6) 1. dx dt = f(t, x), x(t 0) = x 0 (7) t [t 0, t 1 ] f t [t 0, t 1 ], x x University of Hyogo 8 8 1 d x(t) =f(t, x(t)), dt (1) x(t 0 ) =x 0 () t n = t 0 + n t x x n n x n x 0 x i i = 0,..., n 1 x n x(t) 1 1.1 1 1 1 0 θ 1 θ x n x n 1 t = θf(t n 1, x n 1 ) + (1 θ)f(t n, x n )

More information

ADM-Hamiltonian Cheeger-Gromov 3. Penrose

ADM-Hamiltonian Cheeger-Gromov 3. Penrose ADM-Hamiltonian 1. 2. Cheeger-Gromov 3. Penrose 0. ADM-Hamiltonian (M 4, h) Einstein-Hilbert M 4 R h hdx L h = R h h δl h = 0 (Ric h ) αβ 1 2 R hg αβ = 0 (Σ 3, g ij ) (M 4, h ij ) g ij, k ij Σ π ij = g(k

More information

コンピュータ概論

コンピュータ概論 4.1 For Check Point 1. For 2. 4.1.1 For (For) For = To Step (Next) 4.1.1 Next 4.1.1 4.1.2 1 i 10 For Next Cells(i,1) Cells(1, 1) Cells(2, 1) Cells(10, 1) 4.1.2 50 1. 2 1 10 3. 0 360 10 sin() 4.1.2 For

More information

LMC6022 Low Power CMOS Dual Operational Amplifier (jp)

LMC6022 Low Power CMOS Dual Operational Amplifier (jp) Low Power CMOS Dual Operational Amplifier Literature Number: JAJS754 CMOS CMOS (100k 5k ) 0.5mW CMOS CMOS LMC6024 100k 5k 120dB 2.5 V/ 40fA Low Power CMOS Dual Operational Amplifier 19910530 33020 23900

More information

Master's Thesis / 修士論文 携帯メールを介した対人コミュニケーショ ンの研究 篠塚和賢 三重大学, 2012. 三重大学大学院教育学研究科博士前期課程学校教育専攻学校教育専修 http://hdl.handle.net/10076/13374 f

More information