E. Agrell, T. Eriksson, A. Vardy, and K. Zeger, "Closest point search in lattices," IEEE Transaction on Information Theory, vol. 48, no. 8, pp. 2201--2214, Aug. 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Efficient List Decoding for Lattices - Kind, Grant (2003) (Correct)
.... lattice decoding are in vector quantisation for speech recognition [5] and image compression [6] decoding of Euclidean mapped algebraic codes [7] and cryptanalysis of certain ciphers [8] An excellent summary of stateof the art algorithms for finding the shortest vector in a lattice is given in [9]. Recently, the capacity approaching performance of turbolike codes combined with iterative decoding techniques has led to the ubiquitous implementation of powerful and efficient iterative receivers. These iterative receivers are usually cased on symbol by symbol a posteriori probability (APP) ....
....minimum distance subsequences for a given prefix, according to (4) The algorithm is similar to the implementation in [11] with two notable exceptions . The first is simply a computational efficiency boost; we sort the valid symbols in each dimension with respect to the search centre, as in [9, 14]. This helps the decoder locate the best sequences early in the search so that less replacement of sequences in the list occurs. Secondly, the search space is restricted to only the relevant partition. In partition l, the parameters for dimension i = M=L 1; l 1)L are recursively ....
[Article contains additional citation context not shown here]
E. Agrell, T. Eriksson, A. Vardy, and K. Zeger, "Closest Point Search in Lattices," IEEE Trans. Information Theory, vol. 48, pp. 2201--2214, 2002.
A New Lattice Decoding For Space Time Block Codes.. - H, Ghaderipoor.. (Correct)
....of decoding. Exploiting the lattice structure of these codes, lattice decoders [3] 4] can be used for decoding of these codes. Hence, the decoding of STBCs is equivalent to finding the closest point in a lattice to the received point. Finding the closest point in a lattice is NP hard [5] In [6] a comprehensive survey of Closest Point Search (CPS) methods for lattices without a regular structure is presented. In this paper, we modify the CPS algorithm that is based on the Schnorr Euchner variation of the Pohst method [6] and use it to decode the STBCs with an arbitrary number of ....
....point. Finding the closest point in a lattice is NP hard [5] In [6] a comprehensive survey of Closest Point Search (CPS) methods for lattices without a regular structure is presented. In this paper, we modify the CPS algorithm that is based on the Schnorr Euchner variation of the Pohst method [6] and use it to decode the STBCs with an arbitrary number of transmit and receive antennas. Then, we exploit low complex algorithm for decoding of the orthogonal STBC. We show that this method performs the same as ML decoding with lower complexity and lower sensitivity to fading channel ....
[Article contains additional citation context not shown here]
E. Agrell, T. Eriksson, A. Vardy and K. Zeger "Closest Point Search in Lattices" Submitted to IEEE Trans Inform. Theory, Oct 26, 2000
Chemical Library Subset Selection Algorithms: A.. - Hamprecht, Thiel.. (Correct)
....in section 3.5 and recommend instead use of the more favorable lattices in Fig. 12. When the lattice is not simple cubic, finding the closest lattice point for any point in space cannot be accomplished with a simple modulus operation, but e#cient searches are nonetheless possible [31, chapter 20] [72] (for a highly readable account, see the introduction of [37] 6.5 Unrelated criteria Methods which we cannot easily derive from kriging include the cosine criterion [73] criticized in [62] the weight of the minimum spanning tree [57] which is, as noted by the authors themselves, not ....
Agrell, E.; Eriksson, T.; Vardy, A.; Zeger, K. Closest point search in lattices. IEEE Trans. Inform. Theory to appear, 2002.
A Near Maximum Likelihood Decoding Algorithm for.. - Mobasher.. (2005) (Correct)
No context found.
E. Agrell, T. Eriksson, A. Vardy, and K. Zeger, "Closest point search in lattices," IEEE Transaction on Information Theory, vol. 48, no. 8, pp. 2201--2214, Aug. 2002.
A Near Maximum Likelihood Decoding Algorithm for.. - Mobasher.. (2005) (Correct)
No context found.
E. Agrell, T. Eriksson, A. Vardy, and K. Zeger, "Closest point search in lattices," IEEE Transaction on Information Theory, vol. 48, no. 8, pp. 2201--2214, Aug. 2002.
Communication over MIMO Broadcast Channels Using.. - Taherzadeh.. (Correct)
No context found.
E. Agrell, T. Eriksson, A. Vardy, , and K. Zeger, "Closest point search in lattices," IEEE Trans. Info. Theory, vol. 48, pp. 2201--2214, August 2002.
Soft-Input Soft-Output Lattice Sphere Decoder for.. - Boutros, Gresset.. (2003) (1 citation) (Correct)
No context found.
E. Agrell, T. Eriksson, A. Vardy and K. Zeger, "Closest point search in lattices," IEEE Trans. on Inf. Theory, pp. 2201-2214, August 2002.
New Space-Time Coding Techniques with Bit Interleaved Coded.. - GRESSET (2004) (Correct)
No context found.
E. Agrell, T. Eriksson, A. Vardy and K. Zeger, "Closest point search in lattices," IEEE Transactions on Information Theory, pp. 2201-2214, August 2002.
Universal Lattice Decoding: Principle and Recent Advances - Mow (2003) (4 citations) (Correct)
No context found.
E. Agrell, T. Eriksson. A. Vardy, K. Zeger. Closest Point Search in Lattices. IEEE Trans. Inform. Theory 2002, 48: 2201--2213.
Reduced Complexity Receivers for Layered Space-Time CPM - Zhao, Giannakis (Correct)
No context found.
E. Agrell, T. Eriksson, A. Vardy, and K. Zeger, "Closest point search in lattices," IEEE Trans. on Inform. Theory, vol. 48, no. 8, pp. 2201--2214, Aug. 2002.
On Maximum-Likelihood Detection and the Search for the.. - Damen, Gamal, Caire (2003) (2 citations) (Correct)
No context found.
E. Agrell, T. Eriksson, A. Vardy, and K. Zeger, "Closest point search in lattices," IEEE Trans. Inform. Theory, vol. 48, pp. 2201--2214, Aug. 2002.
Optimum Receivers and Low-Dimensional Spreaded Modulation.. - Brehler, Varanasi (2001) (Correct)
No context found.
E. Agrell, T. Eriksson, A. Vardy, and K. Zeger, "Closest point search in lattices," IEEE Trans. Inform. Theory, vol. 48, no. 8, pp. 2201--2214, Aug. 2002.
Reduced Complexity Closest Point Decoding Algorithms for.. - Zhao, Giannakis (2003) (Correct)
No context found.
E. Agrell, T. Eriksson, A. Vardy, and K. Zeger, "Closest point search in lattices," IEEE Trans. on Inform. Theory, vol. 48, no. 8, pp. 2201--2214, Aug. 2002.
Efficient Implementation Of Sphere Demodulation - Ami Wiesel Xavier (2003) (Correct)
No context found.
E. Agrell, T. Eriksson, A. Vardy, and K. Zeger, "Closest point search in lattices," IEEE Transactions on Information Theory, vol. vol. 48, pp. pp. 2201--2214, Aug. 2002.
Soft-Input Soft-Output Lattice Sphere Decoder for.. - Boutros, Gresset.. (2003) (1 citation) (Correct)
No context found.
E. Agrell, T. Eriksson, A. Vardy and K. Zeger, "Closest point search in lattices," IEEE Trans. on Inf. Theory, pp. 2201-2214, August 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC