IEEE Transactions on Communications
- Vol: 60 Issue: 1
- Vol: 60 Issue: 2
- Vol: 60 Issue: 3
- Vol: 60 Issue: 4
- Vol: 60 Issue: 5
- Vol: 60 Issue: 6
- Vol: 60 Issue: 7
- Vol: 60 Issue: 8
- Vol: 60 Issue: 9
- Vol: 60 Issue: 10
- Vol: 60 Issue: 11
- Vol: 60 Issue: 12
- Vol: 59 Issue: 1
- Vol: 59 Issue: 2
- Vol: 59 Issue: 3
- Vol: 59 Issue: 4
- Vol: 59 Issue: 5
- Vol: 59 Issue: 6
- Vol: 59 Issue: 7
- Vol: 59 Issue: 8
- Vol: 59 Issue: 9
- Vol: 59 Issue: 10
- Vol: 59 Issue: 11
- Vol: 59 Issue: 12
- Vol: 58 Issue: 1
- Vol: 58 Issue: 2
- Vol: 58 Issue: 3
- Vol: 58 Issue: 4
- Vol: 58 Issue: 5
- Vol: 58 Issue: 6
- Vol: 58 Issue: 7
- Vol: 58 Issue: 8
- Vol: 58 Issue: 9
- Vol: 58 Issue: 10
- Vol: 58 Issue: 11
- Vol: 58 Issue: 12
- Vol: 57 Issue: 1
- Vol: 57 Issue: 2
- Vol: 57 Issue: 3
- Vol: 57 Issue: 4
- Vol: 57 Issue: 5
- Vol: 57 Issue: 6
- Vol: 57 Issue: 7
- Vol: 57 Issue: 8
- Vol: 57 Issue: 9
- Vol: 57 Issue: 10
- Vol: 57 Issue: 11
- Vol: 57 Issue: 12
- Vol: 46 Issue: 1
- Vol: 46 Issue: 2
- Vol: 46 Issue: 3
- Vol: 46 Issue: 4
- Vol: 46 Issue: 5
- Vol: 46 Issue: 6
- Vol: 46 Issue: 7
- Vol: 46 Issue: 8
- Vol: 46 Issue: 9
- Vol: 46 Issue: 10
- Vol: 46 Issue: 11
- Vol: 46 Issue: 12
- Vol: 24 Issue: 1
- Vol: 24 Issue: 2
- Vol: 24 Issue: 3
- Vol: 24 Issue: 4
- Vol: 24 Issue: 5
- Vol: 24 Issue: 6
- Vol: 24 Issue: 7
- Vol: 24 Issue: 8
- Vol: 24 Issue: 9
- Vol: 24 Issue: 10
- Vol: 24 Issue: 11
- Vol: 24 Issue: 12
- Vol: 56 Issue: 1
- Vol: 56 Issue: 2
- Vol: 56 Issue: 3
- Vol: 56 Issue: 4
- Vol: 56 Issue: 5
- Vol: 56 Issue: 6
- Vol: 56 Issue: 7
- Vol: 56 Issue: 8
- Vol: 56 Issue: 9
- Vol: 56 Issue: 10
- Vol: 56 Issue: 11
- Vol: 56 Issue: 12
- Vol: 45 Issue: 1
- Vol: 45 Issue: 2
- Vol: 45 Issue: 3
- Vol: 45 Issue: 4
- Vol: 45 Issue: 5
- Vol: 45 Issue: 6
- Vol: 45 Issue: 7
- Vol: 45 Issue: 8
- Vol: 45 Issue: 9
- Vol: 45 Issue: 10
- Vol: 45 Issue: 11
- Vol: 45 Issue: 12
- Vol: 23 Issue: 1
- Vol: 23 Issue: 2
- Vol: 23 Issue: 3
- Vol: 23 Issue: 4
- Vol: 23 Issue: 5
- Vol: 23 Issue: 6
- Vol: 23 Issue: 7
- Vol: 23 Issue: 8
- Vol: 23 Issue: 9
- Vol: 23 Issue: 10
- Vol: 23 Issue: 11
- Vol: 23 Issue: 12
- Vol: 55 Issue: 1
- Vol: 55 Issue: 2
- Vol: 55 Issue: 3
- Vol: 55 Issue: 4
- Vol: 55 Issue: 5
- Vol: 55 Issue: 6
- Vol: 55 Issue: 7
- Vol: 55 Issue: 8
- Vol: 55 Issue: 9
- Vol: 55 Issue: 10
- Vol: 55 Issue: 11
- Vol: 55 Issue: 12
- Vol: 44 Issue: 1
- Vol: 44 Issue: 2
- Vol: 44 Issue: 3
- Vol: 44 Issue: 4
- Vol: 44 Issue: 5
- Vol: 44 Issue: 6
- Vol: 44 Issue: 7
- Vol: 44 Issue: 8
- Vol: 44 Issue: 9
- Vol: 44 Issue: 10
- Vol: 44 Issue: 11
- Vol: 44 Issue: 12
- Vol: 22 Issue: 1
- Vol: 22 Issue: 2
- Vol: 22 Issue: 3
- Vol: 22 Issue: 4
- Vol: 22 Issue: 5
- Vol: 22 Issue: 6
- Vol: 22 Issue: 7
- Vol: 22 Issue: 8
- Vol: 22 Issue: 9
- Vol: 22 Issue: 10
- Vol: 22 Issue: 11
- Vol: 22 Issue: 12
- Vol: 54 Issue: 1
- Vol: 54 Issue: 2
- Vol: 54 Issue: 3
- Vol: 54 Issue: 4
- Vol: 54 Issue: 5
- Vol: 54 Issue: 6
- Vol: 54 Issue: 7
- Vol: 54 Issue: 8
- Vol: 54 Issue: 9
- Vol: 54 Issue: 10
- Vol: 54 Issue: 11
- Vol: 54 Issue: 12
- Vol: 43 Issue: 1
- Vol: 43 Issue: 2/3/4
- Vol: 43 Issue: 5
- Vol: 43 Issue: 6
- Vol: 43 Issue: 7
- Vol: 43 Issue: 8
- Vol: 43 Issue: 9
- Vol: 43 Issue: 10
- Vol: 43 Issue: 11
- Vol: 43 Issue: 12
- Vol: 21 Issue: 1
- Vol: 21 Issue: 2
- Vol: 21 Issue: 3
- Vol: 21 Issue: 4
- Vol: 21 Issue: 5
- Vol: 21 Issue: 6
- Vol: 21 Issue: 7
- Vol: 21 Issue: 8
- Vol: 21 Issue: 9
- Vol: 21 Issue: 10
- Vol: 21 Issue: 11
- Vol: 21 Issue: 12
- Vol: 53 Issue: 1
- Vol: 53 Issue: 2
- Vol: 53 Issue: 3
- Vol: 53 Issue: 4
- Vol: 53 Issue: 5
- Vol: 53 Issue: 6
- Vol: 53 Issue: 7
- Vol: 53 Issue: 8
- Vol: 53 Issue: 9
- Vol: 53 Issue: 10
- Vol: 53 Issue: 11
- Vol: 53 Issue: 12
- Vol: 42 Issue: 1
- Vol: 42 Issue: 5
- Vol: 42 Issue: 6
- Vol: 42 Issue: 7
- Vol: 42 Issue: 8
- Vol: 42 Issue: 9
- Vol: 42 Issue: 10
- Vol: 42 Issue: 11
- Vol: 42 Issue: 12
- Vol: 42 Issue: 234 Part: 1
- Vol: 42 Issue: 234 Part: 2
- Vol: 42 Issue: 234 Part: 3
- Vol: 20 Issue: 1
- Vol: 20 Issue: 2
- Vol: 20 Issue: 3 Part: 2
- Vol: 20 Issue: 4
- Vol: 20 Issue: 5
- Vol: 20 Issue: 6
- Vol: 52 Issue: 1
- Vol: 52 Issue: 2
- Vol: 52 Issue: 3
- Vol: 52 Issue: 4
- Vol: 52 Issue: 5
- Vol: 52 Issue: 6
- Vol: 52 Issue: 7
- Vol: 52 Issue: 8
- Vol: 52 Issue: 9
- Vol: 52 Issue: 10
- Vol: 52 Issue: 11
- Vol: 52 Issue: 12
- Vol: 41 Issue: 1
- Vol: 41 Issue: 2
- Vol: 41 Issue: 3
- Vol: 41 Issue: 4
- Vol: 41 Issue: 5
- Vol: 41 Issue: 6
- Vol: 41 Issue: 7
- Vol: 41 Issue: 8
- Vol: 41 Issue: 9
- Vol: 41 Issue: 10
- Vol: 41 Issue: 11
- Vol: 41 Issue: 12
- Vol: 51 Issue: 1
- Vol: 51 Issue: 2
- Vol: 51 Issue: 3
- Vol: 51 Issue: 4
- Vol: 51 Issue: 5
- Vol: 51 Issue: 6
- Vol: 51 Issue: 7
- Vol: 51 Issue: 8
- Vol: 51 Issue: 9
- Vol: 51 Issue: 10
- Vol: 51 Issue: 11
- Vol: 51 Issue: 12
- Vol: 40 Issue: 1
- Vol: 40 Issue: 2
- Vol: 40 Issue: 3
- Vol: 40 Issue: 4
- Vol: 40 Issue: 5
- Vol: 40 Issue: 6
- Vol: 40 Issue: 7
- Vol: 40 Issue: 8
- Vol: 40 Issue: 9
- Vol: 40 Issue: 10
- Vol: 40 Issue: 11
- Vol: 40 Issue: 12
- Vol: 50 Issue: 1
- Vol: 50 Issue: 2
- Vol: 50 Issue: 3
- Vol: 50 Issue: 4
- Vol: 50 Issue: 5
- Vol: 50 Issue: 6
- Vol: 50 Issue: 7
- Vol: 50 Issue: 8
- Vol: 50 Issue: 9
- Vol: 50 Issue: 10
- Vol: 50 Issue: 11
- Vol: 50 Issue: 12
- Vol: 39 Issue: 1
- Vol: 39 Issue: 2
- Vol: 39 Issue: 3
- Vol: 39 Issue: 4
- Vol: 39 Issue: 5
- Vol: 39 Issue: 6
- Vol: 39 Issue: 7
- Vol: 39 Issue: 8
- Vol: 39 Issue: 9
- Vol: 39 Issue: 10
- Vol: 39 Issue: 11
- Vol: 39 Issue: 12
- Vol: 27 Issue: 1
- Vol: 27 Issue: 2 Part: 1
- Vol: 27 Issue: 3
- Vol: 27 Issue: 4
- Vol: 27 Issue: 5
- Vol: 27 Issue: 6
- Vol: 27 Issue: 7
- Vol: 27 Issue: 8
- Vol: 27 Issue: 9
- Vol: 27 Issue: 10 Part: 1
- Vol: 27 Issue: 11
- Vol: 27 Issue: 12
- Vol: 26 Issue: 1
- Vol: 26 Issue: 2
- Vol: 26 Issue: 3
- Vol: 26 Issue: 4
- Vol: 26 Issue: 5
- Vol: 26 Issue: 6
- Vol: 26 Issue: 7
- Vol: 26 Issue: 8
- Vol: 26 Issue: 9
- Vol: 26 Issue: 10
- Vol: 26 Issue: 11 Part: 1 and 2
- Vol: 26 Issue: 12
- Vol: 47 Issue: 1
- Vol: 47 Issue: 2
- Vol: 47 Issue: 3
- Vol: 47 Issue: 4
- Vol: 47 Issue: 5
- Vol: 47 Issue: 6
- Vol: 47 Issue: 7
- Vol: 47 Issue: 8
- Vol: 47 Issue: 9
- Vol: 47 Issue: 10
- Vol: 47 Issue: 11
- Vol: 47 Issue: 12
- Vol: 25 Issue: 1
- Vol: 25 Issue: 2
- Vol: 25 Issue: 3
- Vol: 25 Issue: 4
- Vol: 25 Issue: 5
- Vol: 25 Issue: 6
- Vol: 25 Issue: 7
- Vol: 25 Issue: 8
- Vol: 25 Issue: 9
- Vol: 25 Issue: 10
- Vol: 25 Issue: 11
- Vol: 25 Issue: 12
- Vol: 49 Issue: 1
- Vol: 49 Issue: 2
- Vol: 49 Issue: 3
- Vol: 49 Issue: 4
- Vol: 49 Issue: 5
- Vol: 49 Issue: 6
- Vol: 49 Issue: 7
- Vol: 49 Issue: 8
- Vol: 49 Issue: 9
- Vol: 49 Issue: 10
- Vol: 49 Issue: 11
- Vol: 49 Issue: 12
- Vol: 38 Issue: 1
- Vol: 38 Issue: 2
- Vol: 38 Issue: 3
- Vol: 38 Issue: 4
- Vol: 38 Issue: 5
- Vol: 38 Issue: 6
- Vol: 38 Issue: 7
- Vol: 38 Issue: 8
- Vol: 38 Issue: 9
- Vol: 38 Issue: 10
- Vol: 38 Issue: 11
- Vol: 38 Issue: 12
- Vol: 48 Issue: 1
- Vol: 48 Issue: 2
- Vol: 48 Issue: 3
- Vol: 48 Issue: 4
- Vol: 48 Issue: 5
- Vol: 48 Issue: 6
- Vol: 48 Issue: 7
- Vol: 48 Issue: 8
- Vol: 48 Issue: 9
- Vol: 48 Issue: 10
- Vol: 48 Issue: 11
- Vol: 48 Issue: 12
- Vol: 35 Issue: 1
- Vol: 35 Issue: 2
- Vol: 35 Issue: 3
- Vol: 35 Issue: 4
- Vol: 35 Issue: 5
- Vol: 35 Issue: 6
- Vol: 35 Issue: 7
- Vol: 35 Issue: 8
- Vol: 35 Issue: 9
- Vol: 35 Issue: 10
- Vol: 35 Issue: 11
- Vol: 35 Issue: 12
- Vol: 34 Issue: 1
- Vol: 34 Issue: 2
- Vol: 34 Issue: 3
- Vol: 34 Issue: 4
- Vol: 34 Issue: 5
- Vol: 34 Issue: 6
- Vol: 34 Issue: 7
- Vol: 34 Issue: 8
- Vol: 34 Issue: 9
- Vol: 34 Issue: 10
- Vol: 34 Issue: 11
- Vol: 34 Issue: 12
- Vol: 33 Issue: 1
- Vol: 33 Issue: 2
- Vol: 33 Issue: 3
- Vol: 33 Issue: 4
- Vol: 33 Issue: 5
- Vol: 33 Issue: 6
- Vol: 33 Issue: 7
- Vol: 33 Issue: 8
- Vol: 33 Issue: 9
- Vol: 33 Issue: 10
- Vol: 33 Issue: 11
- Vol: 33 Issue: 12
- Vol: 65 Issue: 1
- Vol: 65 Issue: 2
- Vol: 65 Issue: 3
- Vol: 65 Issue: 4
- Vol: 65 Issue: 5
- Vol: 65 Issue: 6
- Vol: 65 Issue: 7
- Vol: 65 Issue: 8
- Vol: 65 Issue: 9
- Vol: 65 Issue: 10
- Vol: 65 Issue: 11
- Vol: 65 Issue: 12
- Vol: 32 Issue: 1
- Vol: 32 Issue: 2
- Vol: 32 Issue: 3
- Vol: 32 Issue: 4
- Vol: 32 Issue: 5
- Vol: 32 Issue: 6
- Vol: 32 Issue: 7
- Vol: 32 Issue: 8
- Vol: 32 Issue: 9
- Vol: 32 Issue: 10
- Vol: 32 Issue: 11
- Vol: 32 Issue: 12
- Vol: 64 Issue: 1
- Vol: 64 Issue: 2
- Vol: 64 Issue: 3
- Vol: 64 Issue: 4
- Vol: 64 Issue: 5
- Vol: 64 Issue: 6
- Vol: 64 Issue: 7
- Vol: 64 Issue: 8
- Vol: 64 Issue: 9
- Vol: 64 Issue: 10
- Vol: 64 Issue: 11
- Vol: 64 Issue: 12
- Vol: 31 Issue: 1
- Vol: 31 Issue: 2
- Vol: 31 Issue: 3
- Vol: 31 Issue: 4
- Vol: 31 Issue: 5
- Vol: 31 Issue: 6
- Vol: 31 Issue: 7
- Vol: 31 Issue: 8
- Vol: 31 Issue: 9
- Vol: 31 Issue: 10
- Vol: 31 Issue: 11
- Vol: 31 Issue: 12
- Vol: 63 Issue: 1
- Vol: 63 Issue: 2
- Vol: 63 Issue: 3
- Vol: 63 Issue: 4
- Vol: 63 Issue: 5
- Vol: 63 Issue: 6
- Vol: 63 Issue: 7
- Vol: 63 Issue: 8
- Vol: 63 Issue: 9
- Vol: 63 Issue: 10
- Vol: 63 Issue: 11
- Vol: 63 Issue: 12
- Vol: 30 Issue: 1 Part: 1
- Vol: 30 Issue: 1 Part: 2
- Vol: 30 Issue: 2
- Vol: 30 Issue: 3
- Vol: 30 Issue: 4
- Vol: 30 Issue: 5 Part: 1
- Vol: 30 Issue: 5 Part: 2
- Vol: 30 Issue: 6
- Vol: 30 Issue: 7 Part: 1
- Vol: 30 Issue: 7 Part: 2
- Vol: 30 Issue: 8
- Vol: 30 Issue: 9
- Vol: 30 Issue: 10
- Vol: 30 Issue: 11
- Vol: 30 Issue: 12
- Vol: 62 Issue: 1
- Vol: 62 Issue: 2
- Vol: 62 Issue: 3
- Vol: 62 Issue: 4
- Vol: 62 Issue: 5
- Vol: 62 Issue: 6
- Vol: 62 Issue: 7
- Vol: 62 Issue: 8
- Vol: 62 Issue: 9
- Vol: 62 Issue: 10
- Vol: 62 Issue: 11
- Vol: 62 Issue: 12
- Vol: 29 Issue: 1
- Vol: 29 Issue: 2
- Vol: 29 Issue: 3
- Vol: 29 Issue: 4
- Vol: 29 Issue: 5
- Vol: 29 Issue: 6
- Vol: 29 Issue: 7
- Vol: 29 Issue: 8
- Vol: 29 Issue: 9
- Vol: 29 Issue: 10
- Vol: 29 Issue: 11
- Vol: 29 Issue: 12
- Vol: 61 Issue: 1
- Vol: 61 Issue: 2
- Vol: 61 Issue: 3
- Vol: 61 Issue: 4
- Vol: 61 Issue: 5
- Vol: 61 Issue: 6
- Vol: 61 Issue: 7
- Vol: 61 Issue: 8
- Vol: 61 Issue: 9
- Vol: 61 Issue: 10
- Vol: 61 Issue: 11
- Vol: 61 Issue: 12
- Vol: 28 Issue: 1
- Vol: 28 Issue: 2
- Vol: 28 Issue: 3
- Vol: 28 Issue: 4
- Vol: 28 Issue: 5
- Vol: 28 Issue: 6
- Vol: 28 Issue: 7
- Vol: 28 Issue: 8 Part: 1
- Vol: 28 Issue: 8 Part: 2
- Vol: 28 Issue: 9 Part: 1
- Vol: 28 Issue: 9 Part: 2
- Vol: 28 Issue: 10
- Vol: 28 Issue: 11
- Vol: 28 Issue: 12
- Vol: 60 Issue: 1
- Vol: 60 Issue: 2
- Vol: 60 Issue: 3
- Vol: 60 Issue: 4
- Vol: 60 Issue: 5
- Vol: 60 Issue: 6
- Vol: 60 Issue: 7
- Vol: 60 Issue: 8
- Vol: 60 Issue: 9
- Vol: 60 Issue: 10
- Vol: 60 Issue: 11
- Vol: 60 Issue: 12
- Vol: 59 Issue: 1
- Vol: 59 Issue: 2
- Vol: 59 Issue: 3
- Vol: 59 Issue: 4
- Vol: 59 Issue: 5
- Vol: 59 Issue: 6
- Vol: 59 Issue: 7
- Vol: 59 Issue: 8
- Vol: 59 Issue: 9
- Vol: 59 Issue: 10
- Vol: 59 Issue: 11
- Vol: 59 Issue: 12
- Vol: 58 Issue: 1
- Vol: 58 Issue: 2
- Vol: 58 Issue: 3
- Vol: 58 Issue: 4
- Vol: 58 Issue: 5
- Vol: 58 Issue: 6
- Vol: 58 Issue: 7
- Vol: 58 Issue: 8
- Vol: 58 Issue: 9
- Vol: 58 Issue: 10
- Vol: 58 Issue: 11
- Vol: 58 Issue: 12
- Vol: 57 Issue: 1
- Vol: 57 Issue: 2
- Vol: 57 Issue: 3
- Vol: 57 Issue: 4
- Vol: 57 Issue: 5
- Vol: 57 Issue: 6
- Vol: 57 Issue: 7
- Vol: 57 Issue: 8
- Vol: 57 Issue: 9
- Vol: 57 Issue: 10
- Vol: 57 Issue: 11
- Vol: 57 Issue: 12
- Vol: 46 Issue: 1
- Vol: 46 Issue: 2
- Vol: 46 Issue: 3
- Vol: 46 Issue: 4
- Vol: 46 Issue: 5
- Vol: 46 Issue: 6
- Vol: 46 Issue: 7
- Vol: 46 Issue: 8
- Vol: 46 Issue: 9
- Vol: 46 Issue: 10
- Vol: 46 Issue: 11
- Vol: 46 Issue: 12
- Vol: 24 Issue: 1
- Vol: 24 Issue: 2
- Vol: 24 Issue: 3
- Vol: 24 Issue: 4
- Vol: 24 Issue: 5
- Vol: 24 Issue: 6
- Vol: 24 Issue: 7
- Vol: 24 Issue: 8
- Vol: 24 Issue: 9
- Vol: 24 Issue: 10
- Vol: 24 Issue: 11
- Vol: 24 Issue: 12
- Vol: 56 Issue: 1
- Vol: 56 Issue: 2
- Vol: 56 Issue: 3
- Vol: 56 Issue: 4
- Vol: 56 Issue: 5
- Vol: 56 Issue: 6
- Vol: 56 Issue: 7
- Vol: 56 Issue: 8
- Vol: 56 Issue: 9
- Vol: 56 Issue: 10
- Vol: 56 Issue: 11
- Vol: 56 Issue: 12
- Vol: 45 Issue: 1
- Vol: 45 Issue: 2
- Vol: 45 Issue: 3
- Vol: 45 Issue: 4
- Vol: 45 Issue: 5
- Vol: 45 Issue: 6
- Vol: 45 Issue: 7
- Vol: 45 Issue: 8
- Vol: 45 Issue: 9
- Vol: 45 Issue: 10
- Vol: 45 Issue: 11
- Vol: 45 Issue: 12
- Vol: 23 Issue: 1
- Vol: 23 Issue: 2
- Vol: 23 Issue: 3
- Vol: 23 Issue: 4
- Vol: 23 Issue: 5
- Vol: 23 Issue: 6
- Vol: 23 Issue: 7
- Vol: 23 Issue: 8
- Vol: 23 Issue: 9
- Vol: 23 Issue: 10
- Vol: 23 Issue: 11
- Vol: 23 Issue: 12
- Vol: 55 Issue: 1
- Vol: 55 Issue: 2
- Vol: 55 Issue: 3
- Vol: 55 Issue: 4
- Vol: 55 Issue: 5
- Vol: 55 Issue: 6
- Vol: 55 Issue: 7
- Vol: 55 Issue: 8
- Vol: 55 Issue: 9
- Vol: 55 Issue: 10
- Vol: 55 Issue: 11
- Vol: 55 Issue: 12
- Vol: 44 Issue: 1
- Vol: 44 Issue: 2
- Vol: 44 Issue: 3
- Vol: 44 Issue: 4
- Vol: 44 Issue: 5
- Vol: 44 Issue: 6
- Vol: 44 Issue: 7
- Vol: 44 Issue: 8
- Vol: 44 Issue: 9
- Vol: 44 Issue: 10
- Vol: 44 Issue: 11
- Vol: 44 Issue: 12
- Vol: 22 Issue: 1
- Vol: 22 Issue: 2
- Vol: 22 Issue: 3
- Vol: 22 Issue: 4
- Vol: 22 Issue: 5
- Vol: 22 Issue: 6
- Vol: 22 Issue: 7
- Vol: 22 Issue: 8
- Vol: 22 Issue: 9
- Vol: 22 Issue: 10
- Vol: 22 Issue: 11
- Vol: 22 Issue: 12
- Vol: 54 Issue: 1
- Vol: 54 Issue: 2
- Vol: 54 Issue: 3
- Vol: 54 Issue: 4
- Vol: 54 Issue: 5
- Vol: 54 Issue: 6
- Vol: 54 Issue: 7
- Vol: 54 Issue: 8
- Vol: 54 Issue: 9
- Vol: 54 Issue: 10
- Vol: 54 Issue: 11
- Vol: 54 Issue: 12
- Vol: 43 Issue: 1
- Vol: 43 Issue: 2/3/4
- Vol: 43 Issue: 5
- Vol: 43 Issue: 6
- Vol: 43 Issue: 7
- Vol: 43 Issue: 8
- Vol: 43 Issue: 9
- Vol: 43 Issue: 10
- Vol: 43 Issue: 11
- Vol: 43 Issue: 12
- Vol: 21 Issue: 1
- Vol: 21 Issue: 2
- Vol: 21 Issue: 3
- Vol: 21 Issue: 4
- Vol: 21 Issue: 5
- Vol: 21 Issue: 6
- Vol: 21 Issue: 7
- Vol: 21 Issue: 8
- Vol: 21 Issue: 9
- Vol: 21 Issue: 10
- Vol: 21 Issue: 11
- Vol: 21 Issue: 12
- Vol: 53 Issue: 1
- Vol: 53 Issue: 2
- Vol: 53 Issue: 3
- Vol: 53 Issue: 4
- Vol: 53 Issue: 5
- Vol: 53 Issue: 6
- Vol: 53 Issue: 7
- Vol: 53 Issue: 8
- Vol: 53 Issue: 9
- Vol: 53 Issue: 10
- Vol: 53 Issue: 11
- Vol: 53 Issue: 12
- Vol: 42 Issue: 1
- Vol: 42 Issue: 5
- Vol: 42 Issue: 6
- Vol: 42 Issue: 7
- Vol: 42 Issue: 8
- Vol: 42 Issue: 9
- Vol: 42 Issue: 10
- Vol: 42 Issue: 11
- Vol: 42 Issue: 12
- Vol: 42 Issue: 234 Part: 1
- Vol: 42 Issue: 234 Part: 2
- Vol: 42 Issue: 234 Part: 3
- Vol: 20 Issue: 1
- Vol: 20 Issue: 2
- Vol: 20 Issue: 3 Part: 2
- Vol: 20 Issue: 4
- Vol: 20 Issue: 5
- Vol: 20 Issue: 6
- Vol: 52 Issue: 1
- Vol: 52 Issue: 2
- Vol: 52 Issue: 3
- Vol: 52 Issue: 4
- Vol: 52 Issue: 5
- Vol: 52 Issue: 6
- Vol: 52 Issue: 7
- Vol: 52 Issue: 8
- Vol: 52 Issue: 9
- Vol: 52 Issue: 10
- Vol: 52 Issue: 11
- Vol: 52 Issue: 12
- Vol: 41 Issue: 1
- Vol: 41 Issue: 2
- Vol: 41 Issue: 3
- Vol: 41 Issue: 4
- Vol: 41 Issue: 5
- Vol: 41 Issue: 6
- Vol: 41 Issue: 7
- Vol: 41 Issue: 8
- Vol: 41 Issue: 9
- Vol: 41 Issue: 10
- Vol: 41 Issue: 11
- Vol: 41 Issue: 12
- Vol: 51 Issue: 1
- Vol: 51 Issue: 2
- Vol: 51 Issue: 3
- Vol: 51 Issue: 4
- Vol: 51 Issue: 5
- Vol: 51 Issue: 6
- Vol: 51 Issue: 7
- Vol: 51 Issue: 8
- Vol: 51 Issue: 9
- Vol: 51 Issue: 10
- Vol: 51 Issue: 11
- Vol: 51 Issue: 12
- Vol: 40 Issue: 1
- Vol: 40 Issue: 2
- Vol: 40 Issue: 3
- Vol: 40 Issue: 4
- Vol: 40 Issue: 5
- Vol: 40 Issue: 6
- Vol: 40 Issue: 7
- Vol: 40 Issue: 8
- Vol: 40 Issue: 9
- Vol: 40 Issue: 10
- Vol: 40 Issue: 11
- Vol: 40 Issue: 12
- Vol: 50 Issue: 1
- Vol: 50 Issue: 2
- Vol: 50 Issue: 3
- Vol: 50 Issue: 4
- Vol: 50 Issue: 5
- Vol: 50 Issue: 6
- Vol: 50 Issue: 7
- Vol: 50 Issue: 8
- Vol: 50 Issue: 9
- Vol: 50 Issue: 10
- Vol: 50 Issue: 11
- Vol: 50 Issue: 12
- Vol: 39 Issue: 1
- Vol: 39 Issue: 2
- Vol: 39 Issue: 3
- Vol: 39 Issue: 4
- Vol: 39 Issue: 5
- Vol: 39 Issue: 6
- Vol: 39 Issue: 7
- Vol: 39 Issue: 8
- Vol: 39 Issue: 9
- Vol: 39 Issue: 10
- Vol: 39 Issue: 11
- Vol: 39 Issue: 12
- Vol: 27 Issue: 1
- Vol: 27 Issue: 2 Part: 1
- Vol: 27 Issue: 3
- Vol: 27 Issue: 4
- Vol: 27 Issue: 5
- Vol: 27 Issue: 6
- Vol: 27 Issue: 7
- Vol: 27 Issue: 8
- Vol: 27 Issue: 9
- Vol: 27 Issue: 10 Part: 1
- Vol: 27 Issue: 11
- Vol: 27 Issue: 12
- Vol: 26 Issue: 1
- Vol: 26 Issue: 2
- Vol: 26 Issue: 3
- Vol: 26 Issue: 4
- Vol: 26 Issue: 5
- Vol: 26 Issue: 6
- Vol: 26 Issue: 7
- Vol: 26 Issue: 8
- Vol: 26 Issue: 9
- Vol: 26 Issue: 10
- Vol: 26 Issue: 11 Part: 1 and 2
- Vol: 26 Issue: 12
- Vol: 47 Issue: 1
- Vol: 47 Issue: 2
- Vol: 47 Issue: 3
- Vol: 47 Issue: 4
- Vol: 47 Issue: 5
- Vol: 47 Issue: 6
- Vol: 47 Issue: 7
- Vol: 47 Issue: 8
- Vol: 47 Issue: 9
- Vol: 47 Issue: 10
- Vol: 47 Issue: 11
- Vol: 47 Issue: 12
- Vol: 25 Issue: 1
- Vol: 25 Issue: 2
- Vol: 25 Issue: 3
- Vol: 25 Issue: 4
- Vol: 25 Issue: 5
- Vol: 25 Issue: 6
- Vol: 25 Issue: 7
- Vol: 25 Issue: 8
- Vol: 25 Issue: 9
- Vol: 25 Issue: 10
- Vol: 25 Issue: 11
- Vol: 25 Issue: 12
- Vol: 49 Issue: 1
- Vol: 49 Issue: 2
- Vol: 49 Issue: 3
- Vol: 49 Issue: 4
- Vol: 49 Issue: 5
- Vol: 49 Issue: 6
- Vol: 49 Issue: 7
- Vol: 49 Issue: 8
- Vol: 49 Issue: 9
- Vol: 49 Issue: 10
- Vol: 49 Issue: 11
- Vol: 49 Issue: 12
- Vol: 38 Issue: 1
- Vol: 38 Issue: 2
- Vol: 38 Issue: 3
- Vol: 38 Issue: 4
- Vol: 38 Issue: 5
- Vol: 38 Issue: 6
- Vol: 38 Issue: 7
- Vol: 38 Issue: 8
- Vol: 38 Issue: 9
- Vol: 38 Issue: 10
- Vol: 38 Issue: 11
- Vol: 38 Issue: 12
- Vol: 48 Issue: 1
- Vol: 48 Issue: 2
- Vol: 48 Issue: 3
- Vol: 48 Issue: 4
- Vol: 48 Issue: 5
- Vol: 48 Issue: 6
- Vol: 48 Issue: 7
- Vol: 48 Issue: 8
- Vol: 48 Issue: 9
- Vol: 48 Issue: 10
- Vol: 48 Issue: 11
- Vol: 48 Issue: 12
- Vol: 35 Issue: 1
- Vol: 35 Issue: 2
- Vol: 35 Issue: 3
- Vol: 35 Issue: 4
- Vol: 35 Issue: 5
- Vol: 35 Issue: 6
- Vol: 35 Issue: 7
- Vol: 35 Issue: 8
- Vol: 35 Issue: 9
- Vol: 35 Issue: 10
- Vol: 35 Issue: 11
- Vol: 35 Issue: 12
- Vol: 34 Issue: 1
- Vol: 34 Issue: 2
- Vol: 34 Issue: 3
- Vol: 34 Issue: 4
- Vol: 34 Issue: 5
- Vol: 34 Issue: 6
- Vol: 34 Issue: 7
- Vol: 34 Issue: 8
- Vol: 34 Issue: 9
- Vol: 34 Issue: 10
- Vol: 34 Issue: 11
- Vol: 34 Issue: 12
- Vol: 33 Issue: 1
- Vol: 33 Issue: 2
- Vol: 33 Issue: 3
- Vol: 33 Issue: 4
- Vol: 33 Issue: 5
- Vol: 33 Issue: 6
- Vol: 33 Issue: 7
- Vol: 33 Issue: 8
- Vol: 33 Issue: 9
- Vol: 33 Issue: 10
- Vol: 33 Issue: 11
- Vol: 33 Issue: 12
- Vol: 65 Issue: 1
- Vol: 65 Issue: 2
- Vol: 65 Issue: 3
- Vol: 65 Issue: 4
- Vol: 65 Issue: 5
- Vol: 65 Issue: 6
- Vol: 65 Issue: 7
- Vol: 65 Issue: 8
- Vol: 65 Issue: 9
- Vol: 65 Issue: 10
- Vol: 65 Issue: 11
- Vol: 65 Issue: 12
- Vol: 32 Issue: 1
- Vol: 32 Issue: 2
- Vol: 32 Issue: 3
- Vol: 32 Issue: 4
- Vol: 32 Issue: 5
- Vol: 32 Issue: 6
- Vol: 32 Issue: 7
- Vol: 32 Issue: 8
- Vol: 32 Issue: 9
- Vol: 32 Issue: 10
- Vol: 32 Issue: 11
- Vol: 32 Issue: 12
- Vol: 64 Issue: 1
- Vol: 64 Issue: 2
- Vol: 64 Issue: 3
- Vol: 64 Issue: 4
- Vol: 64 Issue: 5
- Vol: 64 Issue: 6
- Vol: 64 Issue: 7
- Vol: 64 Issue: 8
- Vol: 64 Issue: 9
- Vol: 64 Issue: 10
- Vol: 64 Issue: 11
- Vol: 64 Issue: 12
- Vol: 31 Issue: 1
- Vol: 31 Issue: 2
- Vol: 31 Issue: 3
- Vol: 31 Issue: 4
- Vol: 31 Issue: 5
- Vol: 31 Issue: 6
- Vol: 31 Issue: 7
- Vol: 31 Issue: 8
- Vol: 31 Issue: 9
- Vol: 31 Issue: 10
- Vol: 31 Issue: 11
- Vol: 31 Issue: 12
- Vol: 63 Issue: 1
- Vol: 63 Issue: 2
- Vol: 63 Issue: 3
- Vol: 63 Issue: 4
- Vol: 63 Issue: 5
- Vol: 63 Issue: 6
- Vol: 63 Issue: 7
- Vol: 63 Issue: 8
- Vol: 63 Issue: 9
- Vol: 63 Issue: 10
- Vol: 63 Issue: 11
- Vol: 63 Issue: 12
- Vol: 30 Issue: 1 Part: 1
- Vol: 30 Issue: 1 Part: 2
- Vol: 30 Issue: 2
- Vol: 30 Issue: 3
- Vol: 30 Issue: 4
- Vol: 30 Issue: 5 Part: 1
- Vol: 30 Issue: 5 Part: 2
- Vol: 30 Issue: 6
- Vol: 30 Issue: 7 Part: 1
- Vol: 30 Issue: 7 Part: 2
- Vol: 30 Issue: 8
- Vol: 30 Issue: 9
- Vol: 30 Issue: 10
- Vol: 30 Issue: 11
- Vol: 30 Issue: 12
- Vol: 62 Issue: 1
- Vol: 62 Issue: 2
- Vol: 62 Issue: 3
- Vol: 62 Issue: 4
- Vol: 62 Issue: 5
- Vol: 62 Issue: 6
- Vol: 62 Issue: 7
- Vol: 62 Issue: 8
- Vol: 62 Issue: 9
- Vol: 62 Issue: 10
- Vol: 62 Issue: 11
- Vol: 62 Issue: 12
- Vol: 29 Issue: 1
- Vol: 29 Issue: 2
- Vol: 29 Issue: 3
- Vol: 29 Issue: 4
- Vol: 29 Issue: 5
- Vol: 29 Issue: 6
- Vol: 29 Issue: 7
- Vol: 29 Issue: 8
- Vol: 29 Issue: 9
- Vol: 29 Issue: 10
- Vol: 29 Issue: 11
- Vol: 29 Issue: 12
- Vol: 61 Issue: 1
- Vol: 61 Issue: 2
- Vol: 61 Issue: 3
- Vol: 61 Issue: 4
- Vol: 61 Issue: 5
- Vol: 61 Issue: 6
- Vol: 61 Issue: 7
- Vol: 61 Issue: 8
- Vol: 61 Issue: 9
- Vol: 61 Issue: 10
- Vol: 61 Issue: 11
- Vol: 61 Issue: 12
- Vol: 28 Issue: 1
- Vol: 28 Issue: 2
- Vol: 28 Issue: 3
- Vol: 28 Issue: 4
- Vol: 28 Issue: 5
- Vol: 28 Issue: 6
- Vol: 28 Issue: 7
- Vol: 28 Issue: 8 Part: 1
- Vol: 28 Issue: 8 Part: 2
- Vol: 28 Issue: 9 Part: 1
- Vol: 28 Issue: 9 Part: 2
- Vol: 28 Issue: 10
- Vol: 28 Issue: 11
- Vol: 28 Issue: 12
Volume 58 Issue 7 • July 2010
Sponsor
Filter Results
Previous Titles
- 1964 - IEEE Transactions on Communication and Electronics
- ( 1964 - 1971 ) IEEE Transactions on Communication Technology
- ( 1963 - 1964 ) IEEE Transactions on Communications Systems
- ( 1956 - 1962 ) IRE Transactions on Communications Systems
- ( 1953 - 1955 ) Transactions of the IRE Professional Group on Communications Systems
- ( 1952 - 1963 ) Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics
- ( 1884 - 1951 ) Transactions of the American Institute of Electrical Engineers
-
-
-
On Computing the Feedback Capacity of Channels and the Feed-Forward Rate-Distortion Function of Sources
Publication Year: 2010, Page(s):1889 - 1896
Cited by: Papers (6)The problem of computing the capacity-cost function of channels with feedback and the rate-distortion function of sources with feed-forward is considered. Sufficient conditions are derived on : a) the structure of the cost function for a chosen joint distribution to achieve the optimal feedback capacity-cost function, b) the structure of the distortion function for a chosen joint distribution to a... View full abstract»
-
Systematic Design of Iterative ML Receivers for Flat Fading Channels
Publication Year: 2010, Page(s):1897 - 1901
Cited by: Papers (9)We extend the methodology in [1] to flat fading channels. The systematically derived receiver structure corresponds to an iterative solution of the joint maximum likelihood (ML) optimization problem. The heuristically derived BICM with iterative decoding is shown to be the outcome of this joint ML optimization problem. View full abstract»
-
Detection of Offset QPSK with Orthogonal Space-Time Block Codes over a Static Channel
Publication Year: 2010, Page(s):1902 - 1906In this letter we examine the application of space-time block codes (STBC) to offset QPSK (OQPSK). We present the maximum-likelihood (ML) decoder for STBC-OQPSK as well as a simplified decoder. We show through analysis and simulation that the simplified decoder matches the performance of the ML decoder. View full abstract»
-
Modulation Selection from a Battery Power Efficiency Perspective
Publication Year: 2010, Page(s):1907 - 1911
Cited by: Papers (12)In this paper, we compare the battery power efficiencies of various pulse-based modulations widely adopted for their low complexity. Taking into account circuit modules and battery imperfectness, we establish simple closed-form analytical formulas which can be used to conveniently determine the relative preference between arbitrary pulse-based modulation pairs in terms of their actual average batt... View full abstract»
-
M-ary PPM for Transmitted Reference Ultra-Wideband Communications
Publication Year: 2010, Page(s):1912 - 1917
Cited by: Papers (3)In this paper, we investigate the multiple-access (MA) performance of transmitted reference (TR) ultra-wideband (UWB) systems employing M-ary PPM in multipath environments. Because we assume there is no power control in the network, interfering power levels from users can vary over many 10's of dB. We categorize the interfering users into two groups with respect to power levels. A new method for d... View full abstract»
-
Linear Non-Regenerative Multicarrier MIMO Relay Communications Based on MMSE Criterion
Publication Year: 2010, Page(s):1918 - 1923
Cited by: Papers (17)In this letter we propose linear non-regenerative multicarrier multiple-input multiple-output (MIMO) relay technique that aims to minimize the mean-squared error (MSE) of the signal waveform estimation at the destination. We generalize the existing result on the structure of the optimal relay amplifying matrix by considering the direct source-destination link. To minimize the MSE, a power loading ... View full abstract»
-
Interference Management Using Nonlinear Relaying
Publication Year: 2010, Page(s):1924 - 1930
Cited by: Papers (9)We consider the three-node Gaussian relay channel where the relay observes a noisy version of the interference present in the source--destination link. We investigate three fundamental relaying approaches: linear relaying, memoryless nonlinear relaying, and compress-and-forward (CF). For interference-limited cases, we illustrate that optimized memoryless nonlinear relaying almost achieves the capa... View full abstract»
-
Robust Power Allocation Algorithms for Wireless Relay Networks
Publication Year: 2010, Page(s):1931 - 1938
Cited by: Papers (48)Resource allocation promises significant benefits in wireless networks. In order to fully reap these benefits, it is important to design efficient resource allocation algorithms. Here, we develop relay power allocation (RPA) algorithms for coherent and noncoherent amplify-and-forward (AF) relay networks. The goal is to maximize the output signal-to-noise ratio under individual as well as aggregate... View full abstract»
-
Convolutionally Coded Transmission over Markov-Gaussian Channels: Analysis and Decoding Metrics
Publication Year: 2010, Page(s):1939 - 1949
Cited by: Papers (18)It has been widely acknowledged that the aggregate interference at the receiver for various practical communication channels can often deviate markedly from the classical additive white Gaussian noise (AWGN) assumption due to various ambient phenomena. Moreover, the physical nature of the underlying interference generating process in such cases can lead to a bursty behaviour of the interfering sig... View full abstract»
-
New Constructions of High-Performance Low-Complexity Convolutional Codes
Publication Year: 2010, Page(s):1950 - 1961
Cited by: Papers (10)In this paper, new constructions of low trellis complexity convolutional codes are presented. New codes are found by searching into a specific class of time varying convolutional codes, which is shaped by some basic properties and search restrictions. An efficient technique for obtaining minimal trellis modules for the proposed codes is provided. Finally, new low complexity convolutional codes of ... View full abstract»
-
Performance Analysis for BICM Transmission over Gaussian Mixture Noise Fading Channels
Publication Year: 2010, Page(s):1962 - 1972
Cited by: Papers (22)Bit-interleaved coded modulation (BICM) has been adopted in many systems and standards for spectrally efficient coded transmission. The analytical evaluation of BICM performance parameters, in particular bit-error rate (BER), has received considerable attention in the recent past. In this paper, we derive BER approximations for BICM transmission over general fading channels impaired by Gaussian mi... View full abstract»
-
Analog Network Coding Mappings in Gaussian Multiple-Access Relay Channels
Publication Year: 2010, Page(s):1973 - 1983
Cited by: Papers (16)We consider the multiple-access relay channel with two source nodes, one relay node and one destination node. For practical simplicity, we consider orthogonal transmission of the source messages and half-duplex relaying. We also assume that the relay is memoryless and is implemented based on a two-to-one deterministic mapping. Our focus is on proposing and investigating such mappings. Essentially,... View full abstract»
-
Joint Source-Channel Coding of Sources with Memory using Turbo Codes and the Burrows-Wheeler Transform
Publication Year: 2010, Page(s):1984 - 1992
Cited by: Papers (6)The Burrows-Wheeler Transform (BWT) is a block sorting algorithm which has been proven to be useful in compressing text data . More recently, schemes based on the BWT have been proposed for lossless data compression using LDPC and Fountain codes, as well as for joint source-channel coding of sources with memory. In this paper we propose a source-controlled Turbo coding scheme for the transmission ... View full abstract»
-
Communications over the Best Singular Mode of a Reciprocal MIMO Channel
Publication Year: 2010, Page(s):1993 - 2001
Cited by: Papers (10)We consider two nodes equipped with multiple antennas that intend to communicate i.e. both of which transmit and receive data. We model the responses of the communication channels between these nodes as linear and reciprocal (time invariant or with very slow time variations). In practice, we exploit the closed loop conversation between these nodes and present an efficient algorithm allowing to ada... View full abstract»
-
Capacity Limits of Multi-Antenna Multicasting Under Correlated Fading Channels
Publication Year: 2010, Page(s):2002 - 2013
Cited by: Papers (9)Physical layer multicasting in wireless networks has been proposed to efficiently send an identical message to multiple users simultaneously. In this paper, we consider multiple antenna multicasting where the transmitter is equipped with Mt antennas and data is transmitted to K single-antenna users. When the downlink channels are assumed to follow an uncorrelated Rayleigh distribution, ... View full abstract»
-
Limits to Performance of Optimum Combining with Dense Multiple Correlated Antennas
Publication Year: 2010, Page(s):2014 - 2022
Cited by: Papers (7)An analytical expression is derived for the average output signal-to-interference-plus-noise ratio of optimum combining for a spatially correlated array of antennas in the presence of a single interferer and Rayleigh fading. Using the derived expression and based on an asymptotic analysis of the eigenvalues of dense correlation matrices, the asymptotic performance of optimum combining is evaluated... View full abstract»
-
Optimal Receive Antenna Selection in Time-Varying Fading Channels with Practical Training Constraints
Publication Year: 2010, Page(s):2023 - 2034
Cited by: Papers (30)Hardware constraints, which motivate receive antenna selection, also require that various antenna elements at the receiver be sounded sequentially to obtain estimates required for selecting the `best' antenna and for coherently demodulating data thereafter. Consequently, the channel state information at different antennas is outdated by different amounts and corrupted by noise. We show that, for t... View full abstract»
-
A Systematic Framework for Iterative Maximum Likelihood Receiver Design
Publication Year: 2010, Page(s):2035 - 2045
Cited by: Papers (4)In this paper, we link the turbo principle to unconstrained maximum likelihood (ML) sequence detection and joint ML parameter estimation. First, we demonstrate for memoryless channels with complete channel state information how the turbo decoder can be systematically derived starting from the ML sequence detection criterion. In particular, we show that a method to solve the ML sequence detection p... View full abstract»
-
Iterative Multisymbol Noncoherent Reception of Coded CPFSK
Publication Year: 2010, Page(s):2046 - 2054
Cited by: Papers (5)A system involving the multisymbol noncoherent reception of coded continuous-phase frequency-shift keying is developed, optimized, and analyzed. Unlike coherent systems, the modulation index of the waveform does not need to be rational with a small denominator, and the oscillator only needs to be stable for the duration of a small block of symbols. The achievable performance over AWGN and Rayleigh... View full abstract»
-
MIMO Downlink Scheduling with Non-Perfect Channel State Knowledge
Publication Year: 2010, Page(s):2055 - 2066
Cited by: Papers (47) | Patents (2)Downlink scheduling schemes are well-known and widely investigated under the assumption that the channel state is perfectly known to the scheduler. In the multiuser MIMO (broadcast) case, downlink scheduling in the presence of non-perfect channel state information (CSI) is only scantly treated. In this paper we provide a general framework that addresses the problem systematically. Also, we illumin... View full abstract»
-
Cross-Layer Based Analysis of Multi-Hop Wireless Networks
Publication Year: 2010, Page(s):2067 - 2076In this work, we revisit classical packet radio networks with a modern treatment of physical-layer (PHY) procedures, medium-access (MAC) and geographic channel-driven routing protocols. Our network model assumes that nodes are randomly distributed on the plane according to a homogeneous spatial Poisson process, using which we provide a novel representation of interference statistics resulting from... View full abstract»
-
Channel Access Delay and Buffer Distribution of Two-User Opportunistic Scheduling Schemes in Wireless Networks
Publication Year: 2010, Page(s):2077 - 2087
Cited by: Papers (6)In our earlier works, we proposed rate adaptive hierarchical modulation-assisted two-best user opportunistic scheduling (TBS) and hybrid two-user scheduling (HTS) schemes. The proposed schemes are innovative in the sense that they include a second user in the transmission opportunistically using hierarchical modulations. As such the frequency of information access of the users increases without an... View full abstract»
-
Load-Balanced IP Routing Scheme Based on Shortest Paths in Hose Model
Publication Year: 2010, Page(s):2088 - 2096
Cited by: Papers (25)This paper proposes a simple shortest-path-based load-balanced Internet-Protocol (IP) routing scheme based on the hose model. The proposed scheme is an extension of the Smart-OSPF (S-OSPF) scheme. The proposed scheme, the same as S-OSPF, splits traffic demand only at source edge nodes and transmits the traffic along the shortest path routes. In S-OSPF, the split ratios are determined for each sour... View full abstract»
Aims & Scope
IEEE Transactions on Communications focuses on all telecommunications including telephone, telegraphy, facsimile, and point-to-point television by electromagnetic propagation.
Meet Our Editors
Editor-in-Chief
Naofal Al-Dhahir
University of Texas at Dallas