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

Lin-Nan Lee

dblp:03/3185 · DBLP profile ↗
← Back
20ranked-venue papers
8as first author
0since 2021 · last 2020
—ORCID · none

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

Computer networks · 11 · 5 first-author

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
3 papers
Coding theory · 100%
Computer networks
3 papers
Content delivery and video streaming · 74% Vehicular, aerial and satellite networks · 15% Wireless networking · 10%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes
LDPC codes
0.112006
An innovative low-density parity-check code design with near-Shannon-limit performance and simple implementation · IEEE Trans. Commun. 2006
Coding theory › error-correcting codes › code construction › LDPC code design
parity-check matrix construction
0.112006
An innovative low-density parity-check code design with near-Shannon-limit performance and simple implementation · IEEE Trans. Commun. 2006
Content delivery and video streaming
video transmission
0.021991
Time-multiplexed video transmission system: a bandwidth efficient technique for high-quality television transmission via satellite · IEEE Trans. Commun. 1991
Time-Multiplexed Analog Transmission of Three Broadcast-Quality Television Channels Through One Satellite Transponder · IEEE J. Sel. Areas Commun. 1987
Vehicular, aerial and satellite networks
satellite communication
0.011991
Time-multiplexed video transmission system: a bandwidth efficient technique for high-quality television transmission via satellite · IEEE Trans. Commun. 1991
Image and video coding
bandwidth compression
0.011987
Time-Multiplexed Analog Transmission of Three Broadcast-Quality Television Channels Through One Satellite Transponder · IEEE J. Sel. Areas Commun. 1987
Wireless networking › multiple access protocols
demand assignment protocols
0.011977
Cpoda - a demand assignment protocol for satnet · SIGCOMM 1977
Wireless networking
multiple access protocols
0.011977
Cpoda - a demand assignment protocol for satnet · SIGCOMM 1977
Vehicular, aerial and satellite networks
satellite networks
0.011977
Cpoda - a demand assignment protocol for satnet · SIGCOMM 1977
Coding theory › error-correcting codes
concatenated codes
0.011977
Concatenated Coding Systems Employing a Unit-Memory Convolutional Code and a Byte-Oriented Decoding Algorithm · IEEE Trans. Commun. 1977
Coding theory › error-correcting codes › concatenated codes
reed-solomon outer codes
0.011977
Concatenated Coding Systems Employing a Unit-Memory Convolutional Code and a Byte-Oriented Decoding Algorithm · IEEE Trans. Commun. 1977
Coding theory › error-correcting codes › convolutional codes
unit memory codes
0.011977
Concatenated Coding Systems Employing a Unit-Memory Convolutional Code and a Byte-Oriented Decoding Algorithm · IEEE Trans. Commun. 1977
Coding theory › error-correcting codes
convolutional codes
0.011974
Real-Time Minimal-Bit-Error Probability Decoding of Convolutional Codes · IEEE Trans. Commun. 1974
Coding theory › error-correcting codes
decoding
0.011974
Real-Time Minimal-Bit-Error Probability Decoding of Convolutional Codes · IEEE Trans. Commun. 1974
Coding theory › error-correcting codes › convolutional codes › convolutional code decoding
viterbi decoding
0.011974
Real-Time Minimal-Bit-Error Probability Decoding of Convolutional Codes · IEEE Trans. Commun. 1974

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

routing elimination · 0.1modulation schemes · 0.1two-dimensional interfield processing · 0.0two-dimensional filtering · 0.0time-multiplexed component transmission · 0.0interpolation · 0.0computer simulation · 0.0analog multiplexing · 0.0soft-decision decoding · 0.0recursive decoding · 0.0minimal-byte-error probability decoding · 0.0feedback decoding · 0.0contention-based demand assignment · 0.0
YearPublicationVenuePosition
2020 Asynchronous Scrambled Coded Multiple Access for 5G Non-Orthogonal Multiple Access: System Level Performance
abstract
Asynchronous Scrambled Coded Multiple Access (ASCMA) technology presents several features that make it well suited for IoT and mMTC type applications over state-of-the-art terrestrial wireless networks. These include low-rate error correction coding combined with low complexity receiver processing and an ability to transmit data asynchronously using single as well as multiple-streams from a user terminal. The resulting advantages in terms of spectral efficiency, low-latency, and reduced power consumption have been quantified previously using link-level simulations. In this paper, we evaluate the system level performance of a 5G New Radio (NR) mobile network employing ASCMA for uplink mMTC type applications. Using an accurate system level simulator, we evaluate two different scheduling schemes for ASCMA, the first assumes a grant-based scheduling of user terminals over available network resources and the second assumes random access or grant-free scheduling of the same. A novel abstraction method is developed to aid the system level evaluations. Using extensive simulations, we demonstrate the ability of ASCMA technology to provide significant improvements to key network performance indicators such as packet loss rate, average retransmission rate, average cell throughput and cell-edge throughput.
Rohit Iyer Seshadri, Neal Becker, Mustafa Eroz, Lin-Nan Lee, Chin-Kuo Jao, Ting-Yu Yeh, Chun-Yen Wang
VTC Spring4
2019 New Results in Asynchronous Scrambled Coded Multiple Access: Multi-Stream Transmission and Application to 5G Small Data Networks
abstract
Asynchronous Scrambled Coded Multiple Access (A- SCMA) has been shown to offer high spectral efficiencies on Random Access (RA) channels. By allowing unscheduled data transmission, latency is reduced and power can be conserved, making such techniques well suited for IoT type applications. In this paper multi-stream (multi- layer) transmission from a single terminal is demonstrated which enables higher per-terminal spectral efficiency. The application of ASCMA with single and multi-stream on both Additive White Gaussian Noise (AWGN) as well as terrestrial fading channels is presented.
Mustafa Eroz, Neal Becker, Rohit Iyer Seshadri, Lin-Nan Lee
VTC Fall4
2018 Scrambled Coded Multiple Access, Variations and Improvements
abstract
A family of new non-orthogonal multiple access techniques named Scrambled Coded Multiple Access (SCMA) is described. It allows different users of a communications system to efficiently share the same bandwidth by using specific scramblers to separate user bursts. SCMA technology is designed for satellite communications with extremely small antenna terminals for potential applications such as asset tracking, sensor networking, and smart grid; and also for latency reduction. The latest variation, Asynchronous Scrambled Coded Multiple Access (A-SCMA) on the other hand, not only removes the need for timeslot synchronization and precise power control, but also offers an unprecedented system throughput of more than 4 bits/symbol at a modest per user signal to noise ratio (SNR).
Lin-Nan Lee, Mustafa Eroz, Neal Becker, Stan Kay, Victor Liau, Rohit Iyer Seshadri
GLOBECOM1
2016 Spread Asynchronous Scrambled Coded Multiple Access (SA-SCMA) - A New Efficient Random Access Method
abstract
Asynchronous Scrambled Coded Multiple Access (A- SCMA) has been shown to offer high spectral efficiencies on Random Access (RA) channels. This paper describes a new multiple access scheme, SA- SCMA, that adds spreading. Even modest spreading provides significant gains in spectral efficiency, while the use of large RRC rolloff combined with adjacent channel interference cancellation (ACIC) further enhances performance. Spectral efficiencies achieved are high enough to offer data transfer over RA, eliminating the usual 2-way propagation delay needed to assign resources, lowering latency, an important consideration for geostationary satellite inroutes. Additionally, spreading reduces flux density, enabling smaller antenna apertures needed for lower cost applications. The use of SA- SCMA on a saturated radio to further reduce user terminal cost is also discussed.
Neal Becker, Stan Kay, Lin-Nan Lee, Mustafa Eroz
GLOBECOM3
2016 Asynchronous Scrambled Coded Multiple Access (A-SCMA) - A New High Efficiency Random Access Method
abstract
Fixed, portable and mobile terminals use Random Access (RA) to transfer data or request more spectrally efficient dedicated resources. This paper describes a new multiple access scheme, A- SCMA, that operates with unsynchronized transmission and low power, making it particularly suitable to small machine-to-machine communications in satellite or terrestrial applications. A multicarrier version operates with large and variable packet sizes without reduced throughput or large delays.
Neal Becker, Mustafa Eroz, Stan Kay, Lin-Nan Lee
VTC Fall4
2014 Modulation, Coding, and Synchronization for Mobile and Small Satellite Terminals: An Update of the DVB-S2 Standard
abstract
After ten years of successful deployment, the second generation satellite standard for digital video broadcasting, DVB-S2, has been updated to include very low signal-to-noise ratio modes to better support mobile and very small terminal applications without changing its fundamental structure. This paper provides a high level discussion on several of the most important aspects of the updated standard.
Lin-Nan Lee, Mustafa Eroz, Neal Becker
VTC Fall1
2011 Scrambled Coded Multiple Access
abstract
The advantages of Interleave Division Multiple Access (IDMA) are taken one step further by Scrambled Coded Multiple Access (SCMA) where user specific, long interleave tables are replaced by a common scrambling sequence that can be used for all users with a simple shift.
Mustafa Eroz, Lin-Nan Lee
VTC Fall2
2010 On FEC Design for Interleave Division Multiple Access
abstract
Unlike other conventional multiple access techniques such as TDMA or FDMA, this paper demonstrates that the proper choice of forward error control (FEC) codes for Interleave Division Multiple Access (IDMA) is a function of the number of users. By means of Extrinsic Information Transfer (EXIT) charts and Monte-Carlo simulations it is shown that extremely weak single user codes can surprisingly be the best choice when the number of users is high.
Mustafa Eroz, Lin-Nan Lee
VTC Spring2
2007 Low Rate Coded Interleave Division Multiple Access on Rician Fading Channels
abstract
The performance of Interleave Division Multiple Access (IDMA) with a new set of low rate turbo codes is evaluated on Additive White Gaussian Noise (AWGN) and Rician fading channels. Despite the simplicity of the scheme and excessive multiuser interference, very good performance close to theoretical limit is demonstrated. The effect of varying number of users, code rate and channel characteristics on the performance is investigated.
Mustafa Eroz, Lin-Nan Lee
GLOBECOM2
2006 An innovative low-density parity-check code design with near-Shannon-limit performance and simple implementation
abstract
A novel parity-check matrix design for low-density parity-check (LDPC) codes is described. By eliminating the routing problem associated with LDPC codes, the design results in a small implementation area, and the codes have outstanding error-rate performance close to the Shannon limit for a wide range of code rates, from 1/4 to 9/10, and for various modulation schemes such as binary phase-shift keying (PSK), quaternary PSK, 8-PSK, 16-amplitude PSK (APSK), and 32-APSK. As a result, LDPC codes designed with this method have been standardized for next-generation digital video broadcasting.
Mustafa Eroz, Feng-Wen Sun, Lin-Nan Lee
IEEE Trans. Commun.3
2004 Impact of near Shannon-limit codes on wireless communications technology
abstract
Tremendous progress has been made on channel coding techniques during the last decade, starting from the invention of turbo codes and the rediscovery of the low-density parity check (LDPC) codes. These codes essentially closed the gap between the Shannon capacity limit and practical implementation. Commercial adoption of these new coding techniques, however, depends heavily on the introduction of the technology into communication standards. In this paper, we briefly review the considerations when turbo codes and LDPC codes were introduced to the 3/sup rd/ generation wireless standards (3GPP and 3GPP2), and the digital video broadcast for satellite standard (DVB-S2), respectively. We then examine a few possible approaches to take advantage of these powerful codes for future wireless channels.
Mustafa Eroz, Lin-Nan Lee, Feng-Wen Sun
PIMRC2
2000 Wireless communications technology and network architecture for the new millennium
abstract
Wireless data applications have just begun to gain popularity in the marketplace. The rollout of 3rd generation (3G) wireless networks is anticipated in the next few years. We examine wireless data networks that are complementary to the 3G wireless networks, their technologies and the challenges. In particular, we present some of the industry initiatives in the millimeter wave frequency bands for broadband and satellite delivered fixed wireless data network. Furthermore, we offer our perspectives on how these different networks will evolve and inter-work together to provide a seamless experience for the end users. Fixed data networks need to be competitive with wire-line services, this requires us to push advanced signal processing technologies further. We present the latest advances that we have made in channel coding and signal processing technologies to approach that goal.
Lin-Nan Lee, Mustafa Eroz, A. Roger Hammons Jr., Feng-Wen Sun
PIMRC1
1999 Throughput and performance enhancement for high-speed TDMA data in a bandwidth constrained frequency reuse environment
abstract
Enhanced Data for GSM Evolution (EDGE) and IS-136HS have been considered as the high-speed data air-interface for GSM and North America TDMA evolution. Deploying such a high-speed data air-interface in a very limited bandwidth requires a very small reuse factor. This paper describes the challenges brought on by the small reuse factor and several approaches to enhance the throughput and performance of such systems. Simulation and analysis results are used to demonstrate the tradeoffs.
Lin-Nan Lee, Jack Rozmaryn
WCNC1
1998 Third generation wireless technologies-expectations and realities
abstract
The telecommunication industry is evolving at an unprecedented pace. As the PCS operators are just rolling out their network, the ITU (International Telecommunication Union) has already initiated the development of the third generation mobile communication standards. This paper presents an overview of the design issues and technical innovations as being developed during the process of the standard developments.
Lin-Nan Lee, Khalid Karimullah, Feng-Wen Sun, Mustafa Eroz
PIMRC1
1991 Time-multiplexed video transmission system: a bandwidth efficient technique for high-quality television transmission via satellite
abstract
A bandwidth-efficient television transmission technique called time-multiplexed video transmission (TMVT) is described. The TMVT system uses a two-dimensional filtering and interpolation technique to reduce the transmission bandwidth of TV signals, thereby increasing the utilization efficiency of a satellite transponder by approximately 50%. The system adopts the time-multiplexed component transmission scheme with a single carrier to eliminate interference between different TV signals transmitted through the same satellite transponder, and to avoid the intermodulation between the multiple FM carriers, as in the conventional frequency division multiplexing (FDM) approach. A prototype hardware system has been built and tested, with results closely matching the theoretical analysis.>
Yih-Sien Kao, Lin-Nan Lee, Tahsin L. Lin, Farhad B. Verahrami, Donald W. Power
IEEE Trans. Commun.2
1987 Time-Multiplexed Analog Transmission of Three Broadcast-Quality Television Channels Through One Satellite Transponder
abstract
This paper describes a TV signal compression scheme which may become a common practice for analog video transmission and broadcast via satellite by the year 2000. The technique uses twodimensional interfield processing to reduce the video bandwidth with minimum degradation in subjective quality, and time multiplexed with analog multiplexing technique for transmission in component format. Computer simulations of the processing technique on the test slides, and analysis of subjective quality andS/Nexpected over a typical satellite link, are reported. A proof-of-concept prototype being developed at COMSAT Laboratories is also outlined.
Yih-Sien Kao, Lin-Nan Lee
IEEE J. Sel. Areas Commun.2
1977 Cpoda - a demand assignment protocol for satnet
abstract
A new contention-based demand assignment protocol (CPODA) is described. The protocol is designed to handle packetized data and voice traffic in a multiple access satellite broadcast channel, where the channel is typically shared by hundreds of earth stations. A sophisticated traffic environment is assumed, including multiple priority and delay class distinctions, variable message lengths, and an arbitrary load distribution among the stations. In addition, stations may have different receiving rate capabilities. The CPODA protocol is part of a broader research project concerned with developing protocols for a one-hop satellite network (SATNET). The CPODA and other protocols are currently undergoing experimental evaluation using an INTELSAT IV-A satellite and four earth stations in the Atlantic region.
Irwin Mark Jacobs, Lin-Nan Lee, Andrew J. Viterbi, Richard Binder, Robert D. Bressler, Nai-Ting Hsu, Robert Weissler
SIGCOMM2
1977 Concatenated Coding Systems Employing a Unit-Memory Convolutional Code and a Byte-Oriented Decoding Algorithm
abstract
Concatenated coding systems utilizing a convolutional code as the inner code and a Reed-Solomon code as the outer code are considered. In order to obtain very reliable communications over a very noisy channel with relatively modest coding complexity, it is proposed to concatenate a byte-oriented unit-memory convolutional code with an RS outer code whose symbol size is one byte. It is further proposed to utilize a real-time minimal-byte-error probability decoding algorithm, together with feedback from the outer decoder, in the decoder for the inner convolutional code. The performance of the proposed concatenated coding system is studied, and the improvement over conventional concatenated systems due to each additional feature is isolated.
Lin-Nan Lee
IEEE Trans. Commun.1
1974 Real-Time Minimal-Bit-Error Probability Decoding of Convolutional Codes
abstract
A recursive procedure is derived for decoding of rateR = 1/nbinary convolutional codes which minimizes the probability of the individual decoding decisions for each information bit, subject to the constraint that the decoding delay be limited to Δ branches. This new decoding algorithm is similar to, but somewhat more complex than, the Viterbi decoding algorithm. A "real-time," i.e., fixed decoding delay, version of the Viterbi algorithm is also developed and used for comparison to the new algorithm on simulated channels. It is shown that the new algorithm offers advantages over Viterbi decoding in soft-decision applications, such as in the inner coding system for concatenated coding.
Lin-Nan Lee
IEEE Trans. Commun.1
1974 Author's Reply
Lin-Nan Lee
IEEE Trans. Commun.1