scispace - formally typeset
Topic

Throughput (business)

About: Throughput (business) is a(n) research topic. Over the lifetime, 27182 publication(s) have been published within this topic receiving 335078 citation(s).

...read more

Papers
  More

Journal ArticleDOI: 10.1109/TWC.2008.060869
Abstract: In a cognitive radio network, the secondary users are allowed to utilize the frequency bands of primary users when these bands are not currently being used. To support this spectrum reuse functionality, the secondary users are required to sense the radio frequency environment, and once the primary users are found to be active, the secondary users are required to vacate the channel within a certain amount of time. Therefore, spectrum sensing is of significant importance in cognitive radio networks. There are two parameters associated with spectrum sensing: probability of detection and probability of false alarm. The higher the probability of detection, the better the primary users are protected. However, from the secondary users' perspective, the lower the probability of false alarm, the more chances the channel can be reused when it is available, thus the higher the achievable throughput for the secondary network. In this paper, we study the problem of designing the sensing duration to maximize the achievable throughput for the secondary network under the constraint that the primary users are sufficiently protected. We formulate the sensing-throughput tradeoff problem mathematically, and use energy detection sensing scheme to prove that the formulated problem indeed has one optimal sensing time which yields the highest throughput for the secondary network. Cooperative sensing using multiple mini-slots or multiple secondary users are also studied using the methodology proposed in this paper. Computer simulations have shown that for a 6 MHz channel, when the frame duration is 100 ms, and the signal-to-noise ratio of primary user at the secondary receiver is -20 dB, the optimal sensing time achieving the highest throughput while maintaining 90% detection probability is 14.2 ms. This optimal sensing time decreases when distributed spectrum sensing is applied.

...read more

Topics: Cognitive radio (59%), Throughput (business) (54%), Throughput (53%) ...read more

2,766 Citations


Open accessJournal ArticleDOI: 10.1109/4.126534
Abstract: Motivated by emerging battery-operated applications that demand intensive computation in portable environments, techniques are investigated which reduce power consumption in CMOS digital circuits while maintaining computational throughput. Techniques for low-power operation are shown which use the lowest possible supply voltage coupled with architectural, logic style, circuit, and technology optimizations. An architecturally based scaling strategy is presented which indicates that the optimum voltage is much lower than that determined by other scaling considerations. This optimum is achieved by trading increased silicon area for reduced power consumption. >

...read more

Topics: CMOS (57%), Energy consumption (56%), Logic gate (55%) ...read more

2,651 Citations


Open accessProceedings ArticleDOI: 10.1145/1468075.1468121
Kenneth E. Batcher1Institutions (1)
30 Apr 1968-
Abstract: To achieve high throughput rates today's computers perform several operations simultaneously. Not only are I/O operations performed concurrently with computing, but also, in multiprocessors, several computing operations are done concurrently. A major problem in the design of such a computing system is the connecting together of the various parts of the system (the I/O devices, memories, processing units, etc.) in such a way that all the required data transfers can be accommodated. One common scheme is a high-speed bus which is time-shared by the various parts; speed of available hardware limits this scheme. Another scheme is a cross-bar switch or matrix; limiting factors here are the amount of hardware (an m × n matrix requires m × n cross-points) and the fan-in and fan-out of the hardware.

...read more

  • Figure 1 - Symbol for a comparison element
    Figure 1 - Symbol for a comparison element
  • Figure 2 - State diagram for a serial comparison element (most-
    Figure 2 - State diagram for a serial comparison element (most-
  • Figure 10 - A multi-access memory
    Figure 10 - A multi-access memory
  • Figure 3 - Symbol for an ‘‘s by t’’ merging network
    Figure 3 - Symbol for an ‘‘s by t’’ merging network
  • Figure 4 - Iterative rule for odd-even merging networks
    Figure 4 - Iterative rule for odd-even merging networks
  • + 4

Topics: Sorting network (55%), Bitonic sorter (53%), External sorting (52%) ...read more

2,424 Citations


Open accessJournal Article
Abstract: Motivated by emerging battery-operated applications that demand intensive computation in portable environments, techniques are investigated which reduce power consumption in CMOS digital circuits while maintaining computational throughput Techniques for low-power operation are shown which use the lowest possible supply voltage coupled with architectural, logic style, circuit, and technology optimizations An architecturally based scaling strategy is presented which indicates that the optimum voltage is much lower than that determined by other scaling considerations This optimum is achieved by trading increased silicon area for reduced power consumption >

...read more

Topics: CMOS (62%), FO4 (57%), Throughput (business) (56%)

2,293 Citations


Open access
01 Jan 2004-
Topics: Throughput (business) (62%)

2,180 Citations


Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202223
20211,482
20201,464
20191,550
20181,515
20171,412

Top Attributes

Show by:

Topic's top 5 most impactful authors

Viktor K. Prasanna

40 papers, 955 citations

Norbert Wehn

18 papers, 339 citations

Kenichi Higuchi

17 papers, 186 citations

Senem Velipasalar

16 papers, 125 citations

Hanho Lee

15 papers, 163 citations

Network Information
Related Topics (5)
Scheduling (computing)

78.6K papers, 1.3M citations

80% related
Dynamic priority scheduling

28.2K papers, 585.1K citations

80% related
Fair-share scheduling

24.7K papers, 516.6K citations

80% related
Error detection and correction

29.4K papers, 409.3K citations

79% related
Redundancy (engineering)

28.2K papers, 400.6K citations

79% related