FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W1983390976> ?p ?o ?g. }

• W1983390976 abstract "We investigate the degrees of freedom (DoF) issue for multi-hop wireless networks with multiple-node layers under layered time-division-duplex (TDD) constraint. Our recent work about cascaded linear networks shows that the number of feasible network states is related to the famous Fibonacci sequence and the maximum achievable decode-and-forward (DF) rate is r*= min {C <sub xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>1</sub> C <sub xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>2</sub> /C <sub xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>1</sub> +C <sub xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>2</sub> , C <sub xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>2</sub> C <sub xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>3</sub> /C <sub xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>2</sub> +C <sub xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>3</sub> ,⋯, C <sub xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>K-1</sub> C <sub xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>K</sub> /C <sub xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>K-1</sub> +C <sub xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>K</sub> } for K-hop networks, where C <sub xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>k</sub> ; ∀k = 1, 2, ..., K, is the capacity of each hop. Based on these results, we studies the DoF aspect of multi-hop networks with multiple-node layers, mainly about achievable lower bound on the sum DoF, by viewing the network as cascaded X channels (XC). Then we analyze the ultimate case where the number of antennas at each relay layer goes to infinity, from which we find that compared with two-hop networks, larger sum DoF can be obtained if the number of hops is no less than three." @default.
• W1983390976 created "2016-06-24" @default.
• W1983390976 creator A5004874287 @default.
• W1983390976 creator A5010642871 @default.
• W1983390976 creator A5019271298 @default.
• W1983390976 creator A5065701256 @default.
• W1983390976 date "2013-08-01" @default.
• W1983390976 modified "2023-09-23" @default.
• W1983390976 title "An achievable degree of freedom for multi-hop wireless networks under layered TDD constraint" @default.
• W1983390976 cites W1532203639 @default.
• W1983390976 cites W1555881611 @default.
• W1983390976 cites W1595160571 @default.
• W1983390976 cites W1667950888 @default.
• W1983390976 cites W1979408141 @default.
• W1983390976 cites W2002531683 @default.
• W1983390976 cites W2094844913 @default.
• W1983390976 cites W2098969228 @default.
• W1983390976 cites W2106549261 @default.
• W1983390976 cites W2106955096 @default.
• W1983390976 cites W2108850836 @default.
• W1983390976 cites W2113998761 @default.
• W1983390976 cites W2121524146 @default.
• W1983390976 cites W2125016043 @default.
• W1983390976 cites W2130509920 @default.
• W1983390976 cites W2136608712 @default.
• W1983390976 cites W2143354557 @default.
• W1983390976 cites W2145403270 @default.
• W1983390976 cites W2161410889 @default.
• W1983390976 cites W2162370583 @default.
• W1983390976 cites W2168448439 @default.
• W1983390976 cites W2949078183 @default.
• W1983390976 cites W2949683706 @default.
• W1983390976 cites W2949786227 @default.
• W1983390976 cites W2953293975 @default.
• W1983390976 doi "https://doi.org/10.1109/chinacom.2013.6694595" @default.
• W1983390976 hasPublicationYear "2013" @default.
• W1983390976 type Work @default.
• W1983390976 sameAs 1983390976 @default.
• W1983390976 citedByCount "1" @default.
• W1983390976 countsByYear W19833909762015 @default.
• W1983390976 crossrefType "proceedings-article" @default.
• W1983390976 hasAuthorship W1983390976A5004874287 @default.
• W1983390976 hasAuthorship W1983390976A5010642871 @default.
• W1983390976 hasAuthorship W1983390976A5019271298 @default.
• W1983390976 hasAuthorship W1983390976A5065701256 @default.
• W1983390976 hasConcept C11413529 @default.
• W1983390976 hasConcept C154945302 @default.
• W1983390976 hasConcept C41008148 @default.
• W1983390976 hasConceptScore W1983390976C11413529 @default.
• W1983390976 hasConceptScore W1983390976C154945302 @default.
• W1983390976 hasConceptScore W1983390976C41008148 @default.
• W1983390976 hasLocation W19833909761 @default.
• W1983390976 hasOpenAccess W1983390976 @default.
• W1983390976 hasPrimaryLocation W19833909761 @default.
• W1983390976 hasRelatedWork W2051487156 @default.
• W1983390976 hasRelatedWork W2351491280 @default.
• W1983390976 hasRelatedWork W2358668433 @default.
• W1983390976 hasRelatedWork W2371447506 @default.
• W1983390976 hasRelatedWork W2386767533 @default.
• W1983390976 hasRelatedWork W2390279801 @default.
• W1983390976 hasRelatedWork W2748952813 @default.
• W1983390976 hasRelatedWork W2899084033 @default.
• W1983390976 hasRelatedWork W303980170 @default.
• W1983390976 hasRelatedWork W3107474891 @default.
• W1983390976 isParatext "false" @default.
• W1983390976 isRetracted "false" @default.
• W1983390976 magId "1983390976" @default.
• W1983390976 workType "article" @default.