Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 10,000 papers for “Bitstream”

FAMC bitstream description

Khaled Mamou, Marius Preda, Titus Zaharia et al. · HAL (Le Centre pour la Communication Scientifique Directe) · 2007

ISO/IEC JTC1/SC29/WG11, MPEG2007/M14491 , San Jose, CA

Cited by 0

Bitstream binding language

Joseph Thomas-Kerr, Lee Burnett, Phil Ciufo · RMIT Research Repository (RMIT University Library) · 2005

Bitstream Binding Language (BBL) provides an abstraction layer between XML multimedia containers and the way their resources and metadata are published in a bitstream. It allows multiple bindings from a single source document to facilitate interoperability and applicability of the multimedia content to a wide range of terminals and users. BBL introduces a number of features not found in other XML fragmentation techniques - such as support for random-access - and provides a highly general framework for combining metadata with multimedia content in a transport format. This paper presents an overview of BBL and provides details of a Java implementation using the MPEG-21 Multimedia Framework as a sample application.

Cited by 1Open access

Test Item Bitstream

Evans, J · Cardinal Scholar (Ball State University) · 2023

SUNY Alfred State College

Cited by 0

Programmable IIR bitstream filters

L. Fernandes, C.A. Leme, J.E. Franca · 2002

This paper presents a compact realization of cascaded biquad digital filters using 2nd order /spl Delta//spl Sigma/ modulators to avoid the need for multibit multipliers. A bit stream biquad is derived with just one /spl Delta//spl Sigma/ modulator for each pair of poles with no significant degradation of sensitivity nor of dynamic range. The proposed structure leads to a straightforward programmable implementation due to its compactness and modularity.

Cited by 1

TFAN bitstream syntax update

Khaled Mamou, Titus Zaharia, Marius Preda et al. · HAL (Le Centre pour la Communication Scientifique Directe) · 2009

Report of 88th MPEG Meeting, ISO/IEC JTC 1/SC 29/WG 11, coding of moving pictures and audio - Maui(HI)

Cited by 0

Diving Into the Bitstream

Barry Dumas · 2012

Nationwide, and indeed worldwide, there has been a growing awareness of the importance of access to information. Accordingly, information technology (IT), broadly defined and its role beyond the internal workings of businesses has leapt into the social consciousness. Diving into the Bitstream distinguishes itself by weaving together the concepts and conditions of IT. What distinguishes these trends is their focus on the impacts of IT on societies, and the responsibilities of IT’s creators and users. The author pulls together important, often complex issues in the relationships among information, information technologies, and societal constructs. The text explores a synopsis of these issues that are foundations for further consideration.

Cited by 11

Watermarking in JPEG bitstream

Robert J. Berger, Bijan G. Mobasseri · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 2005

In a previous work we proposed an algorithm to embed watermark bits directly in a compressed bitstream. The embedding algorithm is reversible, requires no decompression, causes no increase in file size, and is fast. The problem is that the watermarked bitstream will either lose format-compliance or suffer unacceptable visual degradation. We have now solved these problems for JPEG streams. The algorithm determines the AC VLC codespace that is actually used by the image. Watermarking specific VLCs places the resulting codewords outside of the used codespace, but still within the orignal VLC table specified in JPEG standard. To keep the watermarked stream format-compliant and visually acceptable, the run/size values of watermarked VLCs are remapped in a way to keep visual degradation to a minimum. Since watermarked VLCs are never used in the image, this remapping does not alter the image outside of watermarked VLC codespace.

Cited by 13

MPEG compliance bitstream design

Paul A. Meehan, Norm Hurst, Michael Isnardi et al. · 2005

A method is described for designing bitstreams that can be used to test MPEG decoders without requiring prior knowledge of the particular circuit implementation. Visual inspection of the video output is used to evaluate the tests.

Cited by 10

Stochastic representation: A random bitstream.

Arnav Solanki (14066385), Tonglin Chen (15426832), Marc Riedel (215256) · Figshare · 2023

<p>A value <i>x</i> ∈ [0, 1], in this case 3/8, is represented as a bitstream. The probability that a randomly sampled bit in the stream is one is <i>x</i> = 3/8; the probability that it is zero is 1 − <i>x</i> = 5/8.</p>

Cited by 0Open access

A deterministic Bitstream Descartes Algorithm

Kurt Mehlhorn, Michael Sagraloff · 2010

Project co-funded by the European Commission within FP6 (2002–2006) We describe a variant of the Descartes algorithm for root isolation of polynomials with real coefficients. It is assumed that the coefficients of the polynomial can be approximated with arbitrary precision; exact computation in the field of coefficients is not required. We refer to such coefficients as bitstream coefficients. The algorithm is deterministic and has same asymptotic complexity as the randomized bitstream Descartes algorithm of Eigenwillig et. al. [EKK + 05]. Besides being deterministic, the algorithm is also somewhat simpler to analyse.

Cited by 0

ENKRIPSI TEKS DENGAN PENDEKATAN BITSTREAM

Ansar Rizal, Andi Azhari, Arief Susanto et al. · Jurnal Dinamika Informatika · 2022

Informasi merupakan aset penting baik itu bagi pemerintah, organisasi swasta, universitas, LSM, atau perorangan. Perkembangan teknologi yang pesat menjadikan informasi semakin penting lagi. Karenanya informasi perlu mendapat pengamanan. Bukan hanya isinya, tetapi saluran atau media yang digunakan untuk penyebaran informasi. Pada penelitian ini pendekaran bitstream digunakan pengaman data teks menggunakan kunci simetris sederhana. Penggunaan operasi XOR dalam penggabungan datastream dan keystream menghasilkan konfusi yang tinggi pada ciphertext. Hasil penelitian menunjukkan terjadinya perubahan yang signifikan pada hasil enkripsi yang ditunjukkan oleh nilai Avalanche effect yang tinggi dan nilai koefesien korelasi yang rendah. Nilai Avalanche effect tertinggi adalah 53.91% dan koefesien korelasi terbaik adalah -0.0094. Hasil ini membuktikan bahwa enkripsi dengan pendekaran bitstream dapat menghasilkan ciphertext yang baik, dimana hasil enkripsi tidak dipengaruhi oleh teks aslinya

Cited by 0Open access

AAC bitstream watermarking robustness assessment

Neubauer, C., Siebenhaar, F., Steinebach, M. · Publikationsdatenbank der Fraunhofer-Gesellschaft (Fraunhofer-Gesellschaft) · 2002

During the recent years, the advent of the Internet and the availability of high quality audio coding technology have enabled easy access, transmission and consumption of digitally represented music. These new possibilities directly led to an increasing problem of music piracy which besides cryptographic methods is often addressed with watermarking techniques. Especially for online music distribution the so-called transaction watermarking is a promising concept in order to embed customer or transaction specific information into a particular piece of music during the download phase. A beneficial method to perform transaction watermarking is bitstream watermarking which embeds watermarks directly into perceptually coded material. Former publications in the field of bitstream watermarking showed the concept, audio quality results and complexity numbers along with the detection performance. This paper extends former work in presenting a robustness assessment of bitstream wa termarking schemes. Experimental results obtained specifically using MPEG-2/4 Advanced Audio Coding (AAC) as encoding scheme are given.

Cited by 0

Bitstream – Binary Data for Humans

Sébastien Boisgérault · HAL (Le Centre pour la Communication Scientifique Directe) · 2018

Audiophiles are familiar with multiple digital audio file formats (WAV, MP3, AAC, ALAC, FLAC, etc.) and generally know that this multiplicity is justified by different trade-offs and features (in terms of quality, compression rate, complexity, for example). The same logic drives the research for new binary formats in many contexts. Such research goes through an experimental phase where the development of codecs – the software that transforms back and forth the original data into binary data – is required for any theoretical design. Any tool which can simplify and speed up the prototyping of such codecs therefore improves significantly this iterative process. In this context, Bitstream (Boisgérault 2017a) provides a Python library with a simple, high-level and customizable programming interface to manage binary data. Many classic but menial tasks usually required are automatically taken care of under the hood. The cornerstone of the library is the use of the " bitstream " abstraction. The " stream " part means that we use a simple model where one can only write data at one end of the binary structure and read data at the other end, in the same order. The " bit " part means that the library can work seamlessly with individual bits and not merely bytes, a feature frequently required by lossless data compression schemes. Bitstream supports out of the box data types from Python and NumPy: ASCII strings, (arrays of) booleans, fixed-size integers, floating-point numbers, etc. One can also define and register custom (even parametrized) types and their binary representation, and then use them with the same interface. Since the library supports creation and restoration of stream snapshots, it's possible to go beyond the stream model when necessary; this " time machine " scheme is more than adequate for many use cases (header lookahead, decoders with strong exception safety, etc.). And since bitstream is a Python C extension, it is fast enough for many applications.

Cited by 0Open access

Stochastic representation: A random bitstream.

Arnav Solanki (14066385), Zak Griffin (17240651), Purab Ranjan Sutradhar (17240654) et al. · Figshare · 2023

<p>A value <i>x</i> ∈ [0, 1], in this case 3/8, is represented as a bitstream. The probability that a randomly sampled bit in the stream is one is <i>x</i> = 3/8; the probability that it is zero is 1 − <i>x</i> = 5/8.</p>

Cited by 0Open access