liu.seSearch for publications in DiVA
Endre søk
Begrens søket
1 - 9 of 9
RefereraExporteraLink til resultatlisten
Permanent link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Treff pr side
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sortering
  • Standard (Relevans)
  • Forfatter A-Ø
  • Forfatter Ø-A
  • Tittel A-Ø
  • Tittel Ø-A
  • Type publikasjon A-Ø
  • Type publikasjon Ø-A
  • Eldste først
  • Nyeste først
  • Skapad (Eldste først)
  • Skapad (Nyeste først)
  • Senast uppdaterad (Eldste først)
  • Senast uppdaterad (Nyeste først)
  • Disputationsdatum (tidligste først)
  • Disputationsdatum (siste først)
  • Standard (Relevans)
  • Forfatter A-Ø
  • Forfatter Ø-A
  • Tittel A-Ø
  • Tittel Ø-A
  • Type publikasjon A-Ø
  • Type publikasjon Ø-A
  • Eldste først
  • Nyeste først
  • Skapad (Eldste først)
  • Skapad (Nyeste først)
  • Senast uppdaterad (Eldste først)
  • Senast uppdaterad (Nyeste først)
  • Disputationsdatum (tidligste først)
  • Disputationsdatum (siste først)
Merk
Maxantalet träffar du kan exportera från sökgränssnittet är 250. Vid större uttag använd dig av utsökningar.
  • 1.
    Eriksson, Jonas
    Linköpings universitet, Institutionen för systemteknik. Linköpings universitet, Tekniska högskolan.
    A Probabilistic Lower Bound on the Maximum Size of a List-of-Two Decodable Code2007Rapport (Annet vitenskapelig)
  • 2.
    Eriksson, Jonas
    Linköpings universitet, Tekniska högskolan. Linköpings universitet, Institutionen för systemteknik, Datatransmission.
    A weight-based characterization of the set of correctable error patterns under list-of-2 decoding2007Inngår i: ADVANCES IN MATHEMATICS OF COMMUNICATIONS, ISSN 1930-5346, Vol. 1, nr 3, s. 331-356Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    List decoding of block codes is an alternative approach to the decoding problem with appealing qualities. The fairly recent development of efficient algorithms for list decoding of Reed-Solomon codes spur new fuel to the study of this decoding strategy. In this paper we give a weight-based characterization of the set of correctable error patterns under list-of-2 decoding of (tau, 2)-list-decodable linear codes with known weight distribution. We apply our characterization of the set of correctable error patterns to a few codes in a family of low-rate list-of-2 decodable Reed-Solomon codes. We study the increase in error-correction performance obtained in a symmetric AWGN channel by using list-of-2 decoding instead of traditional decoding for these codes. Some simulation results for list-of-2 decoding on QAM channels using the Guruswami-Sudan algorithm for decoding of Reed-Solomon codes are also presented.

  • 3.
    Eriksson, Jonas
    Linköpings universitet, Institutionen för systemteknik. Linköpings universitet, Tekniska högskolan.
    A Weight-Based Characterization of the Set of Correctable Error patterns Under List-of-2 Decoding2007Rapport (Annet vitenskapelig)
    Abstract [en]

    List decoding of block codes is an alternative approach to the decoding problem with appealing qualities. The fairly recent development of efficient algorithms for list decoding of Reed-Solomon codes spur new fuel to the study of this decoding strategy. In this paper we give a weight-based characterization of the set of correctable error patterns under list-of-2 decoding of (tau, 2)-list-decodable linear codes with known weight distribution. We apply our characterization of the set of correctable error patterns to a few codes in a family of low-rate list-of-2 decodable Reed-Solomon codes. We study the increase in error-correction performance obtained in a symmetric AWGN channel by using list-of-2 decoding instead of traditional decoding for these codes. Some simulation results for list-of-2 decoding on QAM channels using the Guruswami-Sudan algorithm for decoding of Reed-Solomon codes are also presented.

  • 4.
    Eriksson, Jonas
    Linköpings universitet, Institutionen för systemteknik, Datatransmission. Linköpings universitet, Tekniska högskolan.
    Aspects of List-of-Two Decoding2006Doktoravhandling, monografi (Annet vitenskapelig)
    Abstract [en]

    We study the problem of list decoding with focus on the case when we have a list size limited to two. Under this restriction we derive general lower bounds on the maximum possible size of a list-of-2-decodable code. We study the set of correctable error patterns in an attempt to obtain a characterization. For a special family of Reed-Solomon codes - which we identify and name 'class-I codes' - we give a weight-based characterization of the correctable error patterns under list-of-2 decoding. As a tool in this analysis we use the theoretical framework of Sudan's algorithm. The characterization is used in an exact calculation of the probability of transmission error in the symmetric channel when list-of-2 decoding is used. The results from the analysis and complementary simulations for QAM-systems show that a list-of-2 decoding gain of nearly 1 dB can be achieved.

    Further we study Sudan's algorithm for list decoding of Reed-Solomon codes for the special case of the class-I codes. For these codes algorithms are suggested for both the first and second step of Sudan's algorithm. Hardware solutions for both steps based on the derived algorithms are presented.

  • 5.
    Eriksson, Jonas
    Linköpings universitet, Institutionen för systemteknik. Linköpings universitet, Tekniska högskolan.
    List Decoding and Sudan's Algorithm.2000Inngår i: Winter School on Coding and Information Theory 2000 / [ed] Department of Telecommunications and Applied Information Theory TAIT, University of Ulm, 2000, s. 2-2Konferansepaper (Fagfellevurdert)
  • 6.
    Eriksson, Jonas
    et al.
    Linköpings universitet, Institutionen för systemteknik, Kommunikationssystem. Linköpings universitet, Tekniska högskolan.
    Moosavi, Reza
    Linköpings universitet, Institutionen för systemteknik, Kommunikationssystem. Linköpings universitet, Tekniska högskolan.
    Larsson, Erik G.
    Linköpings universitet, Institutionen för systemteknik, Kommunikationssystem. Linköpings universitet, Tekniska högskolan.
    Complexity Reduction of Blind Decoding Schemes Using CRC Splitting2012Inngår i: 2012 IEEE Global Communications Conference (GLOBECOM), IEEE , 2012, s. 3731-3736Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Blind decoding, used on control channels of some multi-user wireless  access systems, is a technique for achieving adaptive modulation and  coding. The idea is to adapt the modulation and coding scheme to the  channel quality but instead of signaling the parameters used  explicitly, the receiver blindly tries a number of fixed parameter  combinations until a successful decoding attempt is detected, with  the help of a cyclic redundancy check. In this paper we suggest a  new method for reducing the complexity and energy consumption  associated with such blind decoding schemes. Our idea is to use a  mini-CRC injected early in the data stream to determine if the  current decoding attempt is using the correct modulation and coding  parameters. We analyze and exemplify the complexity gain of this  approach and also investigate the impact of the rearrangement of the  CRC scheme in terms of the probability of undetected error. The  presented results for the complexity gain are promising and the  impact on the error detection capability turns out to be small if  any.

  • 7.
    Eriksson, Jonas
    et al.
    Linköpings universitet, Institutionen för systemteknik, Kommunikationssystem. Linköpings universitet, Tekniska högskolan.
    Moosavi, Reza
    Linköpings universitet, Institutionen för systemteknik, Kommunikationssystem. Linköpings universitet, Tekniska fakulteten.
    Larsson, Erik G.
    Linköpings universitet, Institutionen för systemteknik, Kommunikationssystem. Linköpings universitet, Tekniska högskolan.
    Wiberg, Niclas
    Ericsson AB, Sweden.
    Frenger, Pål
    Ericsson AB, Sweden.
    Gunnarsson, Fredrik
    Linköpings universitet, Institutionen för systemteknik, Reglerteknik. Linköpings universitet, Tekniska högskolan.
    On Coding of Scheduling Information in OFDM2009Inngår i: Proceedings of the 69th IEEE Vehicular Technology Conference, 2009Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Control signaling strategies for scheduling information in cellular OFDM systems are studied. A single-cell multiuser system model is formulated that provides system capacity estimates accounting for the signaling overhead. Different scheduling granularities are considered, including the one used in the specifications for the 3G Long Term Evolution (LTE). A greedy scheduling method is assumed, where each resource is assigned to the user for which it can support the highest number of bits. The simulation results indicate that the cost of control signaling does not outweigh the scheduling gain, when compared with a simple round-robin scheme that does not need signaling of scheduling information. Furthermore, in the studied scenario, joint coding and signaling of scheduling information over all selected users is found to be superior to separate coding and signaling for each user. The results also indicate that the scheduling granularity used for LTE provides better performance than the full granularity.

  • 8.
    Moosavi, Reza
    et al.
    Linköpings universitet, Institutionen för systemteknik, Kommunikationssystem. Linköpings universitet, Tekniska högskolan.
    Eriksson, Jonas
    Linköpings universitet, Institutionen för systemteknik, Kommunikationssystem. Linköpings universitet, Tekniska högskolan.
    Larsson, Erik G.
    Linköpings universitet, Institutionen för systemteknik, Kommunikationssystem. Linköpings universitet, Tekniska högskolan.
    Differential Signaling of Scheduling Information in Wireless Multiple Access Systems2010Inngår i: Proceedings of the IEEE Global Communications Conference (GLOBECOM), 2010, s. 1-6Konferansepaper (Fagfellevurdert)
    Abstract [en]

    This paper considers the control signaling on the downlink in wireless multiple access systems, with focus on the part of the control signaling that carries information on the user's time/frequency scheduling assignments. A new idea is presented to reduce the amount of channel resources needed for this signaling. The idea is to exploit the fact that provided that only one single user is scheduled on each channel resource, then the different users' scheduling assignments are correlated. This correlation can be exploited by encoding the scheduling information differentially. In order to recover the scheduling information, a user must then decode the scheduling information of some of the others. This is possible, because on the downlink, all users can hear the transmission by the base station so that users with a high SNR may decode the control signaling sent to users with a lower SNR. We present a practical scheme to exploit this idea. Both analytical analysis and numerical examples illustrate that the proposed technique can provide a substantial reduction in signaling traffic.

  • 9.
    Moosavi, Reza
    et al.
    Linköpings universitet, Institutionen för systemteknik, Kommunikationssystem. Linköpings universitet, Tekniska högskolan.
    Eriksson, Jonas
    Linköpings universitet, Institutionen för systemteknik, Kommunikationssystem. Linköpings universitet, Tekniska högskolan.
    Larsson, Erik G.
    Linköpings universitet, Institutionen för systemteknik, Kommunikationssystem. Linköpings universitet, Tekniska högskolan.
    Wiberg, Niclas
    Ericsson Research Center at Linköping.
    Frenger, Pål
    Ericsson Research Center at Linköping.
    Gunnarsson, Fredrik
    Ericsson Research Center at Linköping.
    Comparison of Strategies for Signaling of Scheduling Assignments in Wireless OFDMA2010Inngår i: IEEE Transactions on Vehicular Technology, ISSN 0018-9545, E-ISSN 1939-9359, Vol. 59, nr 9, s. 4527-4542Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    This paper considers transmission of scheduling information in  OFDMA-based cellular communication systems such as 3GPP long-term  evolution (LTE). These systems provide efficient usage of radio  resources by allowing users to be scheduled dynamically in both  frequency and time. This requires considerable amounts of scheduling  information to be sent to the users.  The paper compares two basic transmission strategies: transmitting a  separate scheduling message to each user versus broadcasting a joint  scheduling message to all users. Different scheduling granularities  are considered, as well as different scheduling algorithms. The  schemes are evaluated in the context of the LTE downlink using  multiuser system simulations, assuming a full-buffer situation.  The results show that separate transmission of the scheduling  information requires a slightly lower overhead than joint  broadcasting, when proportional fair scheduling is employed and the  users are spread out over the cell area. The results also indicate  that the scheduling granularity standardized for LTE provides a good  trade-off between scheduling granularity and overhead.

1 - 9 of 9
RefereraExporteraLink til resultatlisten
Permanent link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf