Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Brian K. Classon

dblp:90/5037 · DBLP profile ↗
← Back
19ranked-venue papers
3as first author
0since 2021 · last 2014
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 6 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 2Graphics, computer vision, multimedia, augmented reality and games · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Coding theory · 100%
Computer networks
1 paper
Cellular and mobile networks · 50% Physical-layer communications · 50%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory
channel coding
0.112008
Contention-Free Interleavers for High-Throughput Turbo Decoding · IEEE Trans. Commun. 2008
Coding theory › channel coding › turbo codes
interleaver design
0.112008
Contention-Free Interleavers for High-Throughput Turbo Decoding · IEEE Trans. Commun. 2008
Coding theory › channel coding
turbo codes
0.112008
Contention-Free Interleavers for High-Throughput Turbo Decoding · IEEE Trans. Commun. 2008
Coding theory › error-correcting codes › decoding › iterative decoding › soft-input soft-output decoding
turbo decoding
0.112008
Contention-Free Interleavers for High-Throughput Turbo Decoding · IEEE Trans. Commun. 2008
Cellular and mobile networks › mobile networks › mobile network architecture › cellular network architecture
3GPP LTE
0.012008
Contention-Free Interleavers for High-Throughput Turbo Decoding · IEEE Trans. Commun. 2008
Physical-layer communications
channel coding
0.012008
Contention-Free Interleavers for High-Throughput Turbo Decoding · IEEE Trans. Commun. 2008

Methods — techniques the papers use, named apart from their topics

permutation polynomial design · 0.2Log-MAP decoding · 0.2
YearPublicationVenuePosition
2014 Design of a D2D Overlay for Next Generation LTE
abstract
With the ever-growing popularity of smartphones, new services are emerging where the local and positioning aspects becomes more important. Additionally, new types of traffic, such as vehicle-to-vehicle communications are being developed. In order to address these new trends, release-12 of LTE has started to evaluate, and possibly standardize, solutions for device-to-device (D2D) communication. This provides the foundations for the deployment of a D2D overlay. However, this should be viewed as a first step, and future LTE releases should encompass more advanced D2D communication techniques and architectures. In this paper, after reviewing the standardization progress for LTE in release-12, several possible improvements are examined for future releases both D2D discovery and communication. It is shown that the future D2D architecture should exploit the network when possible in order to provide an improved user experience and satisfy the need for more local services.
Philippe J. Sartori, Hossein Bagheri, Vip Desai, Brian K. Classon, Anthony C. K. Soong, Mazin Al-Shalash, Weimin Xiao, Deping Liu
VTC Fall4
2008 TDD design for UMTS Long-Term Evolution
abstract
Long-Term Evolution (LTE) will provide substantial enhancements to UMTS 3G systems including improved system capacity and coverage, low latency, reduced operating costs, multi-antenna support, flexible bandwidth operations and seamless integration with existing systems. LTE supports both Frequency Division Duplex (FDD) and Time Division Duplex (TDD) modes to provide deployment flexibility in accordance with operator’s preference and spectrum allocation. This paper presents an overview of LTE TDD design and highlights key differences with FDD. Design challenges unique to TDD are presented together with adopted technical solutions. Finally, simulation results are provided to demonstrate typical TDD system performance with data applications.
Rapeepat Ratasuk, Amitava Ghosh, Weimin Xiao, Robert Love, Ravi Nory, Brian K. Classon
PIMRC6
2008 Analysis of Circular Buffer Rate Matching for LTE Turbo Code
abstract
This paper discusses circular buffer rate matching (CBRM) algorithms for the turbo code in the long term evolution (LTE) of the WCDMA-based air interface. To enhance performance at high code rates, systematic bit puncturing is incorporated in conjunction with the CBRM. The RM algorithm is further optimized based on the algebraic properties of the QPP interleavers and the 8-state recursive systematic convolutional code of the LTE turbo code.
Jung-Fu Cheng, Ajit Nimbalker, Yufei W. Blankenship, Brian K. Classon, Keith T. Blankenship
VTC Fall4
2008 Frequency Semi-Selective Scheduling for a DFT-SOFDM Based Uplink
abstract
This paper describes a scheduling technique for the DFT-SOFDM (SC-FDMA) based uplink of the 3GPP LTE standard. Traditionally, scheduling has been either Frequency- Selective (FS), or Frequency Non Selective (FNS). FS scheduling assigns a user to a portion of the channel bandwidth having high channel-quality. At low mobility, FS typically performs much better than FNS, but at the cost of increased channel-quality feedback overhead. A new class of scheduling methods, called Frequency Semi-Selective (FSS) is introduced, and is shown to perform nearly as well as pure FS scheduling, but with reduced feedback overhead. The technique only requires minimum tracking of the channel and one-bit of additional feedback over FNS techniques.
Arvind Krishnamoorthy, Philippe J. Sartori, Kevin L. Baum, Vijay Nangia, Brian K. Classon
VTC Fall5
2008 Downlink Control Channel Design for 3GPP LTE
abstract
With the emergence of packet-based wireless broadband systems, work has begun on long term evolution (LTE) of the UMTS Terrestrial Radio Access and Radio Access Network aimed for commercial deployment in 2010. Goals for the evolved system include support for improved system capacity and coverage, high peak data rates, low latency, reduced operating costs, multi-antenna support, flexible bandwidth operations and seamless integration with existing systems. To reach these goals, a new design for the air interface including control channel is envisioned. This paper provides a preliminary look at an efficient downlink control channel design to reduce the overhead required to support data transmission. Initial performance results show that close to optimal system performance can be achieved with downlink control overhead of less than 14%.
Robert Love, Ravi Kuchibhotla, Amitava Ghosh, Rapeepat Ratasuk, Brian K. Classon, Yufei W. Blankenship
WCNC5
2008 ARP and QPP Interleavers for LTE Turbo Coding
abstract
The Long Term Evolution (LTE) of the WCDMA standard requires turbo decoding throughputs of up to 100 Mbps. Unfortunately, the existing WCDMA turbo interleaver does not permit an efficient high throughput implementation. The almost regular permutation (ARP) and quadratic polynomial permutation (QPP) interleavers were proposed to rectify this situation with QPP selected for LTE. In this paper, the interleavers are compared and a full suite of LTE designs and performance results for both are presented.
Ajit Nimbalker, Yufei W. Blankenship, Brian K. Classon, Keith T. Blankenship
WCNC3
2008 Contention-Free Interleavers for High-Throughput Turbo Decoding
abstract
This paper presents a low-complexity interleaver design that facilitates the high throughput turbo decoding required for next generation wireless systems. Specifically, it addresses the interleaver design issues that arise when several Log-MAP processors are used in parallel to improve turbo decoding throughput. In such a parallel decoder, memory access contentions occur when more than one extrinsic value is to be written to or read from the same memory block at the same time. These contentions may be avoided by designing contention- free (CF) interleavers that incorporate hardware constraints into the interleaver description. The paper first derives bounds on the number of CF interleavers, demonstrating that the fraction of interleavers of a given size that are contention-free is quite small. In spite of this, a class of contention-free "inter-window shuffle" (IWS) interleavers are shown via simulation to achieve near-WCDMA performance. Further, the paper shows that the memory requirement of CF IWS interleavers is small compared to an alternate contention-resolving method that uses a modified memory addressing scheme. Finally, we note that the advantages of contention-free interleavers have led to the adoption of a CF quadratic permutation polynomial (QPP) interleaver in the 3 GPP long term evolution (LTE) standard.
Ajit Nimbalker, Keith T. Blankenship, Brian K. Classon, Thomas E. Fuja, Daniel J. Costello Jr.
IEEE Trans. Commun.3
2007 Uplink Control Channel Design for 3GPP LTE
abstract
Long term evolution (LTE) of the UMTS Terrestrial Radio Access and Radio Access Network is aimed for commercial deployment in 2010. Goals for the evolved system include support for improved system capacity and coverage, high peak data rates, low latency, reduced operating costs, multi-antenna support, flexible bandwidth operations and seamless integration with existing systems. To reach these goals, a new design for the air interface is currently being specified in the 3GPP standards body. The Uplink (UL) for LTE is based on Single Carrier Frequency Division Multiple Access. The UL control channel carries non-data associated control signaling like CQI, ACK/NACK, Scheduling request etc. To maintain the low PA power de-rating, the single carrier property of the UL has to be maintained. As such, special consideration should be given to the UL control channel design. This paper discusses in detail the LTE UL control channel design and its performance.
Amitava Ghosh, Rapeepat Ratasuk, Weimin Xiao, Brian K. Classon, Vijay Nangia, Robert Love, Dale Schwent
PIMRC4
2007 Enhanced Link Adaptation Methods for Wireless Multi-Carrier Systems
abstract
This work describes a family of low feedback, high performance link adaptation algorithms for multi-carrier systems. The methods include the use of the exponential effective SNR mapping (EESM) method as part of the modulation/coding selection process. The drawbacks of current link adaptation algorithms are reviewed, and means of combating the effect of Doppler and fading gain variation are proposed. In addition, a method enabling conventional SNR feedback reports to be converted to the effective SNR domain is described. This allows the effect of variable power allocation on coded BER to be more accurately estimated. Simulation results show that the proposed methods are effective.
Arvind Krishnamoorthy, Yufei W. Blankenship, Philippe J. Sartori, Kevin L. Baum, Brian K. Classon
VTC Spring5
2006 Turbo-like Decoding Algorithm for Structured LDPC codes
abstract
This paper presents a high-speed "turbo-like" decoding algorithm for certain structured LDPC codes such as those adopted in IEEE 802.16e and in the draft 802.11n standards. It is shown that after a key modification, such LDPC codes may be processed as generalized repeat accumulate codes, codes which are known to support "turbo-like" decoding. A GRA-like encoder of structured LDPC codes is derived, which in turn leads to the decoding algorithm. It is also shown that the "structured" properties result in an inherent parallelism, leading to an efficient high speed decoder implementation
Ajit Nimbalker, Yufei W. Blankenship, Brian K. Classon
ISIT3
2006 Overview of UMTS Air-Interface Evolution
abstract
With the emergence of packet-based wireless broadband systems such as 802.16e, it is evident that a comprehensive evolution of the universal mobile telecommunications system specifications is required to remain competitive. As a result, work has begun on long term evolution (LTE) of the UMTS terrestrial radio access and radio access network aimed for commercial deployment in 2010. Goals for the evolved system include support for improved system capacity and coverage, high peak data rates, low latency, reduced operating costs, multi-antenna support, flexible bandwidth operations and seamless integration with existing systems. To reach these goals, a new design for the air interface is envisioned. This paper provides a preliminary look at the air interface for Evolved UTRA (E-UTRA) and associated key technologies required to reach its design objectives. Initial E-UTRA system performance results show a 2 to 3x improvement over a reference Rel-6 UMTS system configuration [1, 2] for both uplink and downlink.
Brian K. Classon, Kevin L. Baum, Vijay Nangia, Robert Love, Yakun Sun, Ravi Nory, Kenneth Stewart, Amitava Ghosh, Rapeepat Ratasuk, Weimin Xiao
VTC Fall1
2006 Multi-User Scheduling for OFDM Downlink with Limited Feedback for Evolved UTRA
abstract
Multi-user scheduling and OFDM techniques are well regarded as promising candidates to provide high data- rate and reliable transmissions in future communication systems. To optimally exploit multi-user diversity and frequency selectivity, exhaustive channel information is needed for every user - an impracticality given limited feedback bandwidth. Simple and efficient feedback schemes therefore become a crucial task in designing a next generation standard. In this paper, two near-optimal feedback schemes are proposed that achieve most of the multi-user scheduling benefit with very few feedback bits. It is also shown that the feedback schemes are robust to long feedback intervals. As expected, at higher Doppler spread, the performance gap using the proposed schemes becomes larger but still provides satisfactory performance.
Yakun Sun, Weimin Xiao, Robert Love, Kenneth Stewart, Amitava Ghosh, Rapeepat Ratasuk, Brian K. Classon
VTC Fall7
2006 Efficient OFDM-HARQ system evaluation using a recursive EESM link error prediction
abstract
OFDM system-level simulations require a performance estimate for each link, but it is typically infeasible to conduct simultaneous link-level simulations for multiple users within a reasonable amount of time. Therefore, it is critical to have a simple link error probability predictor that accurately models coded OFDM performance. The exponential ESM (EESM) method was shown to be a very good link error prediction method for multi-carrier systems in the case of single transmission. Here, the EESM method is extended to cover hybrid ARQ (HARQ) techniques: Chase combining, incremental redundancy (IR) or an arbitrary combination of both. Further simplifications are introduced to greatly reduce the amount of memory necessary to utilize EESM for modeling OFDM-HARQ transmissions
Brian K. Classon, Philippe J. Sartori, Yufei W. Blankenship, Kevin L. Baum, Robert Love, Yakun Sun
WCNC1
2006 Error prediction for adaptive modulation and coding in multiple-antenna OFDM systems
Sébastien Simoens, Stéphanie Rouquette-Léveil, Philippe J. Sartori, Yufei W. Blankenship, Brian K. Classon
Signal Process.5
2004 Contention-free interleavers
abstract
Interleavers that avoid memory contentions in parallelized log-MAP decoding are analyzed and designed. Bounds are derived demonstrating that the fraction of interleavers that are contention-free is small. Nevertheless, contention-free "inter-window shuffle" interleavers with a simple implementation and reasonable memory requirements are shown to surpass 3GPP performance.
Ajit Nimbalker, Thomas E. Fuja, Daniel J. Costello Jr., Keith T. Blankenship, Brian K. Classon
ISIT5
2003 Multi-dimensional adaptation and multi-user scheduling techniques for wireless OFDM systems
abstract
This paper considers techniques to increase the performance of the broadband wireless OFDM system through adaptation in both the time and frequency domains. System throughput estimates are provided for frequency non-selective coding and frequency selective coding for single antenna, Alamouti, and selective closed-loop MIMO configurations. Additional gains from performing multi-user frequency-domain scheduling are achieved and determined using proportional fair and maximum C/I schedulers. The performance gains of multi-dimensional adaptation and scheduling techniques are contrasted with the amount of feedback required. Measured data from a 20 MHz experimental system and turbo coding simulations are used to estimate the size of each feedback report, and an accepted user speed distribution is used to estimate an appropriate feedback rate.
Brian K. Classon, Philippe J. Sartori, Vijay Nangia, Xiangyang Zhuang, Kevin L. Baum
ICC1
2002 Unequal error protection design using convolutional codes
abstract
The introduction of adaptive multi-rate (AMR) speech coders in wireless standards, such as GSM, imposes new challenges for forward error correction (FEC) design. Traditional FEC techniques of providing unequal error protection (UEP) may not maximize performance for a given set of design requirements, such as complexity limits. This paper introduces a new FEC technique that improves error correction performance while satisfying complexity constraints. This technique is applied to the new wideband AMR standard for a performance and complexity comparison.
Vip Desai, Brian K. Classon, Yufei W. Blankenship
ICC2
2002 Incremental redundancy for evolutions of 3G CDMA systems
abstract
An overview of the hybrid ARQ used by the 3G CDMA evolutions (1xEV-DV for cdma2000 and HSDPA for WCDMA) is provided, along with simulation data supporting several of the key design decisions. Enhancements to AMC and hybrid ARQ operation are also discussed.
Robert Love, Brian K. Classon, Amitava Ghosh, Mark Cudak
VTC Spring2
2002 Quasi-static method for predicting link-level performance
abstract
In this paper, we investigate the performance of a quasi-static method used to predict link-level error performance in dynamic system simulations. Two flavors of the quasi-static approach are used to model the link characteristics: (a) static curves with fudge factors; and (b) short-term frame error curves. For the fudge factor based method, we examine the various factors (or penalties) required for the method to work properly, their limitations in capturing the various features of the high-speed packet data channel, and their effects on the overall accuracy of the technique. Here, we concentrate on three important penalties: puncturing penalty, Doppler penalty, and demapping penalty. The quasistatic method based on short-term frame error curves is used to generate frame erasures for voice and control channels associated with high-speed packet data channels. From simulation results, it is shown that both variations of the quasi-static method can provide accurate prediction of link-level performance at certain operating ranges, provided that the penalties are correctly obtained. At low frame error rates and moderate to high speeds, however, the quasi-static method often fails to accurately reflect frame error performance at the link level.
Rapeepat Ratasuk, Amitava Ghosh, Brian K. Classon
VTC Spring3