2,924 research outputs found

    Modified gravity as a common cause for cosmic acceleration and flat galaxy rotation curves

    Full text link
    Flat galaxy rotation curves and the accelerating Universe both imply the existence of a critical acceleration, which is of the same order of magnitude in both the cases, in spite of the galactic and cosmic length scales being vastly different. Yet, it is customary to explain galactic acceleration by invoking gravitationally bound dark matter, and cosmic acceleration by invoking a `repulsive` dark energy. Instead, might it not be the case that the flatness of rotation curves and the acceleration of the Universe have a common cause? In this essay we propose a modified theory of gravity. By applying the theory on galactic scales we demonstrate flat rotation curves without dark matter, and by applying it on cosmological scales we demonstrate cosmic acceleration without dark energy.Comment: 7 pages, 1 fgure. Honorable Mention in Gravity Research Foundation Essay Contest 2012. v2: Two minor typos correcte

    Approximate Linear Time ML Decoding on Tail-Biting Trellises in Two Rounds

    Full text link
    A linear time approximate maximum likelihood decoding algorithm on tail-biting trellises is prsented, that requires exactly two rounds on the trellis. This is an adaptation of an algorithm proposed earlier with the advantage that it reduces the time complexity from O(mlogm) to O(m) where m is the number of nodes in the tail-biting trellis. A necessary condition for the output of the algorithm to differ from the output of the ideal ML decoder is reduced and simulation results on an AWGN channel using tail-biting rrellises for two rate 1/2 convoluational codes with memory 4 and 6 respectively are reporte

    Approximate MAP Decoding on Tail-Biting Trellises

    Full text link
    We propose two approximate algorithms for MAP decoding on tail-biting trellises. The algorithms work on a subset of nodes of the tail-biting trellis, judiciously selected. We report the results of simulations on an AWGN channel using the approximate algorithms on tail-biting trellises for the (24,12)(24,12) Extended Golay Code and a rate 1/2 convolutional code with memory 6.Comment: 5 pages, 2 figures, ISIT 200
    corecore