Access network for addressing subwords in memory for both little

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

395886, G06F 1300

Patent

active

059180757

ABSTRACT:
The access network selects 2.sup.m byte-size subwords for little or big endian byte order from a 2.sup.n byte-sized memory word with 0.ltoreq.m.ltoreq.n. The access network includes 2.sup.n 2.sup.n :1 multiplexers and a device for generating control signals for the multiplexers. The control signal for the multiplexer for the ith byte is formed by inverting or copying address bits above alignment of the subword for the multiplexer selecting the ith byte with the least address, byte 0, and by setting address bits below alignment of the subword to 0 or 1 for big or little endian byte order. The device for generating the control signals generates the control signal for the multiplexer for the byte i with an exclusive "or" of the subword address i with the control signal for byte 0. By using common parts space can be saved in the access network.

REFERENCES:
patent: 4523276 (1985-06-01), Maejima et al.
patent: 5477543 (1995-12-01), Purcell
patent: 5524256 (1996-06-01), Turkowski
patent: 5655065 (1997-08-01), Robertson
patent: 5687328 (1997-11-01), Lee
patent: 5721957 (1998-02-01), Huang et al.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Access network for addressing subwords in memory for both little does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Access network for addressing subwords in memory for both little, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Access network for addressing subwords in memory for both little will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-1385853

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.