Browsing by Subject "Channel matrices"
Now showing 1 - 2 of 2
Results Per Page
Sort Options
Item Open Access Optimization of linear wire antenna arrays to increase MIMO capacity using swarm intelligence(Institution of Engineering and Technology, 2007) Olgun, Uğur; Tunç, Celal Alp; Aktaş, Defne; Ertürk, Vakur B.; Altıntaş, AyhanFree standing linear arrays (FSLA) are analyzed and optimized to increase MIMO capacity. A MIMO channel model based on electric fields is used. The effects of mutual interactions among the array elements are included into the channel matrix using method of moments (MoM) based full-wave solvers. A tool to design an antenna array of superior MIMO capacity for any specified volume is developed. Particle swarm optimization is used as the main engine for the optimization tasks of the tool. Uniform linear arrays, uniform circular arrays and non-uniform arrays are analyzed and compared in terms of their channel capacity.Item Open Access Upper bounds on the capacity of deletion channels using channel fragmentation(Institute of Electrical and Electronics Engineers Inc., 2015) Rahmati, M.; Duman, T. M.We study memoryless channels with synchronization errors as defined by a stochastic channel matrix allowing for symbol drop-outs or symbol insertions with particular emphasis on the binary and non-binary deletion channels. We offer a different look at these channels by considering equivalent models by fragmenting the input sequence where different subsequences travel through different channels. The resulting output symbols are combined appropriately to come up with an equivalent input-output representation of the original channel which allows for derivation of new upper bounds on the channel capacity. We consider both random and deterministic types of fragmentation processes applied to binary and nonbinary deletion channels. With two specific applications of this idea, a random fragmentation applied to a binary deletion channel and a deterministic fragmentation process applied to a nonbinary deletion channel, we prove certain inequality relations among the capacities of the original channels and those of the introduced subchannels. The resulting inequalities prove useful in deriving tighter capacity upper bounds for: 1) independent identically distributed (i.i.d.) deletion channels when the deletion probability exceeds 0.65 and 2) nonbinary deletion channels. Some extensions of these results, for instance, to the case of deletion/substitution channels are also explored. © 1963-2012 IEEE.